Robust routing in deterministic delay-tolerant networks
DOI10.1016/j.cor.2017.12.004zbMath1391.90108OpenAlexW2772560054MaRDI QIDQ1651586
Ronan Bocquillon, Antoine Jouglet
Publication date: 12 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2017.12.004
combinatorial optimizationrobust optimizationconstraint programmingsystems of systemsdelay- and disruption-tolerant networksstore-carry-and-forward routing
Linear programming (90C05) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- The data transfer problem in a system of systems
- Dominance rules in combinatorial optimization problems
- A constraint-programming-based approach for solving the data dissemination problem
- Modeling elements and solving techniques for the data dissemination problem
- Maximal Flow Through a Network
- The Price of Robustness
This page was built for publication: Robust routing in deterministic delay-tolerant networks
