The pure fixed charge transportation problem

DOI10.1002/NAV.3800260408MaRDI QIDQ3960466zbMATH OpenOpenAlexFDO

Authors John C. Fisk, Patrick G. McKeown

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

0-1 knapsack problemscomputational resultsdirect search procedureLIFO decision ruleonly fixed costsoptimal allocation of supplypure fixed charge transportation problem

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)

Cites work

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

Cited in

(13)

• A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge
• A decision support system for urban waste management
• A set covering reformulation of the pure fixed charge transportation problem
• A tabu search heuristic procedure for the fixed charge transportation problem
• 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
• COLE: a new heuristic approach for fixed charge problem computational results
• A branch-and-bound algorithm for solving fixed charge problems
• Formulation for a fixed-charge, separable nonlinear production planning problem
• On the pure fixed charge transportation problem
• Complexity and approximation algorithms for fixed charge transportation problems
• Complexity and approximation algorithms for fixed charge transportation problems

This page was built for publication: 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 Q3960466)