On the pure fixed charge transportation problem
From MaRDI portal
Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Integer programming (90C10) Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60)
Cites work
- A Branch-and-Bound Method for the Fixed Charge Transportation Problem
- A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
- A genetic algorithm for solving the fixed-charge transportation model: two-stage problem
- A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem
- A reduced-cost iterated local search heuristic for the fixed-charge transportation problem
- A set covering reformulation of the pure fixed charge transportation problem
- Algorithms for solving the single-sink fixed-charge transportation problem
- Fixed-charge transportation problem: facets of the projection polyhedron
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Optimal Design of Regional Wastewater Systems: A Fixed-Charge Network Flow Model
- The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation
- The pure fixed charge transportation problem
- The teacher assignment problem: A special case of the fixed charge transportation problem
- Two classical transportation problems revisited: pure constant fixed charges and the paradox
This page was built for publication: On the pure fixed charge transportation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6962504)