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