Exploring the discrete and continuous edge improvement problems: models and algorithms
From MaRDI portal
Cites work
- A network simplex method for the budget-constrained minimum cost flow problem
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Accelerating the Benders decomposition method: application to stochastic network design problems
- Approximation algorithms for certain network improvement problems
- Benchmarking optimization software with performance profiles.
- Budget-constrained minimum cost flows
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem
- Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design
- Modifying edges of a network to obtain short subgraphs
- Multi-vehicle prize collecting arc routing for connectivity problem
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- On the complexity and approximability of budget-constrained minimum cost flows
- Practical enhancements to the Magnanti-Wong method
- The accessibility arc upgrading problem
- The Benders decomposition algorithm: a literature review
- The budgeted minimum cost flow problem with unit upgrading cost
- Upgrading arcs to minimize the maximum travel time in a network
This page was built for publication: Exploring the discrete and continuous edge improvement problems: models and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6981829)
