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