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