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