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