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