Integer Programming Scheduling Multicast Combinatorial optimization Constrained shortest path Time windows Integer programming Coupled-task scheduling model NP-hardness FSO Light-forest Column generation Constraint programming Clearing algorithms Approximation ratio Grover algorithm Réseaux de capteurs Budgeted uncertainty Multicast routing Quality of Service Hypergraph Approximability RPL Wireless sensor networks Vehicle routing Approximation algorithm Exact computation Linear and mixed-integer programming Bass model K-MBVST Dynamic Programming Branch and Price Degree constrained minimum spanning hierarchy Robust Optimization Robust combinatorial optimization Cutting plane Approximation algorithms Spanning tree Network design Dynamic programming WDM network Checkpointing Exascale Integer Linear Programming ILP Variable link capacity Quality of service Sparse splitting Wavelength minimization Complexité Computational complexity Compatibility graph Degree constrained minimum spanning tree Bilevel optimization Homomorphisme Affine routing FPTAS Multicommodity flows Quantum optimization Coupled-tasks Homomorphism Routing Free space optics Light-trail Light-tree FPT algorithm Approximation Exact methods Scaffolding Branch-cut-and-price Genome scaffolding Parallel job All-optical WDM networks Robust optimization Quantum computing Optimization Bi-level programming ILP Branch-and-Cut Optimisation combinatoire Combinatorial Optimization Replication Model Driven Engineering Light-hierarchy Fault-tolerance Linear programming Complexity & approximation Graph theory Optimisation Complexity Branch vertices constraint Capacity Expansion Hierarchy Demand response Path generation Column Generation Spanning problems Benders decomposition Heuristic Energy-aware engineering Chordal graphs