Optimal solution of the discrete cost multicommodity network design problem
From MaRDI portal
Publication:2518654
DOI10.1016/j.amc.2008.07.031zbMath1191.90010OpenAlexW2055821779MaRDI QIDQ2518654
Publication date: 16 January 2009
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2008.07.031
Related Items (4)
Benders decomposition approach for the robust network design problem with flow bifurcations ⋮ Flow constrained minimum cost flow problem ⋮ Adaptive memory in multistart heuristics for multicommodity network design ⋮ An exact approach for the multicommodity network optimization problem with a step cost function
Cites Work
- Unnamed Item
- Conjugate gradient methods using quasi-Newton updates with inexact line searches
- Minimum cost capacity installation for multicommodity network flows
- Exact solution of multicommodity network optimization problems with general step cost functions
- A polyhedral approach to multicommodity survivable network design
- Discrete cost multicommodity network optimization problems and exact solution methods
- Dioïds and semirings: Links to fuzzy sets and other applications
- The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
- Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements
- Multicommodity network design with discrete node costs
- Design of Capacitated Multicommodity Networks with Multiple Facilities
- Networks synthesis and optimum network design problems: Models, solution methods and applications
- On the Extreme Rays of the Metric Cone
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
This page was built for publication: Optimal solution of the discrete cost multicommodity network design problem
