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