Multicommodity network design with discrete node costs
From MaRDI portal
(Redirected from Publication:3418125)
Recommendations
- Optimal solution of the discrete cost multicommodity network design problem
- Multicommodity network flow models and algorithms in telecommunications
- Discrete cost multicommodity network optimization problems and exact solution methods
- Design of Capacitated Multicommodity Networks with Multiple Facilities
- Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems
Cited in
(14)- 0-1 reformulations of the multicommodity capacitated network design problem
- Discrete cost multicommodity network optimization problems and exact solution methods
- Enhancing discretized formulations: the knapsack reformulation and the star reformulation
- Optimal solution of the discrete cost multicommodity network design problem
- New partial aggregations for multicommodity network flow problems: an application to the fixed-charge network design problem
- Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints
- Dimensioning multicast-enabled communications networks
- Design of Capacitated Multicommodity Networks with Multiple Facilities
- Finding Disjoint Routes in Telecommunications Networks with Two Technologies
- Models and heuristics for the \(k\)-degree constrained minimum spanning tree problem with node-degree costs
- An exact approach for the multicommodity network optimization problem with a step cost function
- A mixed-integer optimization formulation for buyer formation
- Charging station location and fleet sizing for shared autonomous electric vehicles using Benders' decomposition
- Prize collecting Steiner trees with node degree dependent costs
This page was built for publication: Multicommodity network design with discrete node costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3418125)
