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