A set covering reformulation of the pure fixed charge transportation problem
From MaRDI portal
Publication:1317046
DOI10.1016/0166-218X(92)00177-NzbMath0799.90094OpenAlexW2045250339MaRDI QIDQ1317046
Torbjörn Larsson, Maud Göthe-Lundgren
Publication date: 17 November 1994
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(92)00177-n
lower boundheuristicset coveringbranch-and- boundminimum cost network flowLagrangean dualitypure fixed charge transportation problem
Related Items (6)
The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation ⋮ The robust set covering problem with interval data ⋮ Surrogate constraint normalization for the set covering problem ⋮ Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems ⋮ The teacher assignment problem: A special case of the fixed charge transportation problem ⋮ A decision support system for urban waste management
Cites Work
- Unnamed Item
- Unnamed Item
- A theorem on flows in networks
- Partitioning procedures for solving mixed-variables programming problems
- Fixed-cost transportation problems
- Valid Linear Inequalities for Fixed Charge Problems
- An approximative algorithm for the fixed-charges transportation problem
- A Greedy Heuristic for the Set-Covering Problem
- A restricted Lagrangean approach to the traveling salesman problem
- The pure fixed charge transportation problem
- Degeneracy in fixed cost transportation problems
- Facets of the knapsack polytope
- A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem
- Some computational results of using the Ahrens—Finke method for handling degeneracy in fixed charge transportation problems
- Validation of subgradient optimization
- The fixed charge problem
- Technical Note—Exact Solution of the Fixed-Charge Transportation Problem
- Set Covering and Involutory Bases
- Solving the Fixed Charge Problem by Ranking the Extreme Points
This page was built for publication: A set covering reformulation of the pure fixed charge transportation problem
