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