Fixed-charge transportation problem: facets of the projection polyhedron
From MaRDI portal
(Redirected from Publication:4648260)
Recommendations
- Fixed-charge transportation on a path: optimization, LP formulations and separation
- Fixed-charge transportation on a path: linear programming formulations
- Fixed-charge transportation problems on trees
- Valid Linear Inequalities for Fixed Charge Problems
- A set covering reformulation of the pure fixed charge transportation problem
Cited in
(16)- Fixed charge multicommodity network design using p-partition facets
- Fixed-charge transportation problems on trees
- Regenerator location problem: polyhedral study and effective branch-and-cut algorithms
- On logarithmic fixed-charge transportation problem
- The noncooperative fixed charge transportation problem
- Fixed-charge transportation on a path: optimization, LP formulations and separation
- Fixed-charge transportation on a path: linear programming formulations
- Valid Linear Inequalities for Fixed Charge Problems
- scientific article; zbMATH DE number 4045479 (Why is no real title available?)
- Minimum‐cost flow problems having arc‐activation costs
- On the pure fixed charge transportation problem
- Benders decomposition for bi-objective linear programs
- A stochastic multi-stage fixed charge transportation problem: worst-case analysis of the rolling horizon approach
- Complexity and approximation algorithms for fixed charge transportation problems
- Fair cost savings allocation in two-stage fixed-cost transportation problem
- Complexity and approximation algorithms for fixed charge transportation problems
This page was built for publication: Fixed-charge transportation problem: facets of the projection polyhedron
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4648260)
