Technical Note—Exact Solution of the Fixed-Charge Transportation Problem

DOI10.1287/OPRE.19.6.1529MaRDI QIDQ5630822zbMATH OpenOpenAlexFDO

Authors Paul A. Gray

Publication date 1971

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.19.6.1529

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Cited in

(32)

• A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge
• A search tree algorithm for plant location problems
• A vertex ranking algorithm for the fixed-charge transportation problem
• An algorithm for a concave production cost network flow problem
• A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
• 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
• Solving fixed charge transportation problem with interval parameters
• Facets and algorithms for capacitated lot sizing
• Computational risk management techniques for fixed charge network flow problems with uncertain arc failures
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms
• A heuristic algorithm for the fixed charge problem
• A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems
• Adaptive dynamic cost updating procedure for solving fixed charge network flow problems
• COLE: a new heuristic approach for fixed charge problem computational results
• Artificial immune system and sheep flock algorithms for two-stage fixed-charge transportation problem
• The pure fixed charge transportation problem
• Degeneracy in fixed cost transportation problems
• Some computationally relevant group theoretic structures of fixed charge problems
• Some computational results of using the Ahrens—Finke method for handling degeneracy in fixed charge transportation problems
• scientific article; zbMATH DE number 1330764 (Why is no real title available?)
• An algorithm for the optimum time-cost trade-off in fixed-charge bi-criterion transportation problem bi-criterion transportation problem
• Fixed charge transportation problem with type-2 fuzzy variables
• A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand
• Polynomial-time algorithms for single resource stochastic capacity expansion models with lost sales
• The transportation problem with packing constraints
• An improved branch and bound algorithm for minimum concave cost network flow problems
• 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
• Complexity and approximation algorithms for fixed charge transportation problems
• An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems

This page was built for publication: Technical Note—Exact Solution of the Fixed-Charge Transportation Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5630822)