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