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