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

DOI10.1287/OPRE.19.6.1529zbMath0224.90036OpenAlexW2069737189MaRDI QIDQ5630822

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)

Related Items (30)

Polynomial-time algorithms for single resource stochastic capacity expansion models with lost sales ⋮ The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation ⋮ An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems ⋮ Artificial immune system and sheep flock algorithms for two-stage fixed-charge transportation problem ⋮ The transportation problem with packing constraints ⋮ A search tree algorithm for plant location problems ⋮ Computational risk management techniques for fixed charge network flow problems with uncertain arc failures ⋮ A heuristic algorithm for the fixed charge problem ⋮ A vertex ranking algorithm for the fixed-charge transportation problem ⋮ Degeneracy in fixed cost transportation problems ⋮ A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems ⋮ 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 ⋮ An improved branch and bound algorithm for minimum concave cost network flow problems ⋮ Some computationally relevant group theoretic structures of fixed charge problems ⋮ Adaptive dynamic cost updating procedure for solving fixed charge network flow problems ⋮ Unnamed Item ⋮ Minimum concave-cost network flow problems: Applications, complexity, and algorithms ⋮ A stochastic multi-stage fixed charge transportation problem: worst-case analysis of the rolling horizon approach ⋮ Solving fixed charge transportation problem with interval parameters ⋮ Some computational results of using the Ahrens—Finke method for handling degeneracy in fixed charge transportation problems ⋮ A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge ⋮ Facets and algorithms for capacitated lot sizing ⋮ An algorithm for a concave production cost network flow problem ⋮ COLE: a new heuristic approach for fixed charge problem computational results ⋮ A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure ⋮ An algorithm for the optimum time-cost trade-off in fixed-charge bi-criterion transportation problem bi-criterion transportation problem ⋮ A set covering reformulation of the pure fixed charge transportation problem ⋮ A tabu search heuristic procedure for the fixed charge transportation problem ⋮ The pure fixed charge transportation problem

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