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