An enhanced Benders decomposition method for unique shortest path routing
From MaRDI portal
Publication:6613945
DOI10.1007/s12597-023-00718-0MaRDI QIDQ6613945
Publication date: 7 October 2024
Published in: Opsearch (Search for Journal in Brave)
mathematical modelingBenders decompositionshortest path routingconstraint structureredundancy generation
Cites Work
- Benders decomposition without separability: a computational study for capacitated facility location problems
- A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks
- Partitioning procedures for solving mixed-variables programming problems
- On an instance of the inverse shortest paths problem
- On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
- Inverse optimization in high-speed networks
- Approximating the single source unsplittable min-cost flow problem
- An inverse problem of the weighted shortest path problem
- Calculating some inverse linear programming problems
- Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework
- Generalized Benders decomposition
- Approximation Algorithms for Single-Source Unsplittable Flow
- Approximability of unsplittable shortest path routing problems
- Optimization of OSPF Routing in IP Networks
- Inverse Optimization
- On the selection of primary paths for a communication network
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Internet Routing and Related Topology Issues
- Optimization of Internet Protocol network design and routing
- On the complexity of equal shortest path routing
- Combinatorial algorithms for inverse network flow problems
- Computational Science – ICCS 2005
- Intra-domain traffic engineering with shortest path routing protocols
This page was built for publication: An enhanced Benders decomposition method for unique shortest path routing
