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