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