The pure fixed charge transportation problem

DOI10.1002/nav.3800260408zbMath0496.90055OpenAlexW1903816159MaRDI QIDQ3960466

Patrick G. McKeown, John C. Fisk

Publication date: 1979

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800260408

zbMATH Keywords

computational results0-1 knapsack problemspure fixed charge transportation problemdirect search procedureLIFO decision ruleonly fixed costsoptimal allocation of supply

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Boolean programming (90C09)

Related Items (10)

The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation ⋮ A novel intensive distribution logistics network design and profit allocation problem considering sharing economy ⋮ Solving fixed charge transportation problem with truck load constraint using metaheuristics ⋮ A branch-and-bound algorithm for solving fixed charge problems ⋮ Formulation for a fixed-charge, separable nonlinear production planning problem ⋮ A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge ⋮ A decision support system for urban waste management ⋮ COLE: a new heuristic approach for fixed charge problem computational results ⋮ A set covering reformulation of the pure fixed charge transportation problem ⋮ A tabu search heuristic procedure for the fixed charge transportation problem

Cites Work

• Fixed-cost transportation problems
• An approximative algorithm for the fixed-charges transportation problem
• A branch and bound algorithm for the generalized assignment problem
• A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem
• Technical Note—A Vertex Ranking Procedure for Solving the Linear Fixed-Charge Problem
• An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
• A Direct Descent Binary Knapsack Algorithm
• The Group-Theoretic Structure in the Fixed-Charge Transportation Problem
• The fixed charge problem
• A Branch Search Algorithm for the Knapsack Problem
• The fixed charge problem
• Technical Note—Exact Solution of the Fixed-Charge Transportation Problem
• Solving the Fixed Charge Problem by Ranking the Extreme Points

This page was built for publication: The pure fixed charge transportation problem