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