Robust energy-aware routing with redundancy elimination
DOI10.1016/J.COR.2015.05.008zbMATH Open1349.90161OpenAlexW1552452211MaRDI QIDQ342072FDOQ342072
Authors: David Coudert, Alvinice Kodjo, Truong Khoa Phan 
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01155639/file/CKP15.pdf
Recommendations
- A MILP-Based Heuristic for Energy-Aware Traffic Engineering with Shortest Path Routing
- Simultaneous routing and flow rate optimization in energy-aware computer networks
- Minimizing energy and link utilization in ISP backbone networks with multi-path routing: a bi-level approach
- Energy-efficient network routing with discrete cost functions
- Energy-aware survivable networks
Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Mixed integer programming (90C11) Traffic problems in operations research (90B20)
Cites Work
- Theory and applications of robust optimization
- Robust optimization
- The Price of Robustness
- Robust discrete optimization and network flows
- Robust optimization-methodology and applications
- Provisioning virtual private networks under traffic uncertainty
- Robust network design: formulations, valid inequalities, and computations
- A robust optimisation model and cutting planes for the planning of energy-efficient wireless networks
- Mixed integer non-linear programming models for green network design
Cited In (3)
Uses Software
This page was built for publication: Robust energy-aware routing with redundancy elimination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342072)
