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