Fixed-cost transportation problems
From MaRDI portal
Publication:3292913
DOI10.1002/nav.3800080104zbMath0106.34801OpenAlexW1967088945MaRDI QIDQ3292913
Publication date: 1961
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800080104
Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items
The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation, An approximative algorithm for the fixed charge problem, On lower bounds for the fixed charge problem, A matheuristic for the two-stage fixed-charge transportation problem, Credit linked two-stage multi-objective transportation problem in rough and bi-rough environments, General network design: a unified view of combined location and network design problems, Some Transportation Problems Under Uncertain Environments, A novel matheuristic approach for a two-stage transportation problem with fixed costs associated to the routes, Solving a fuzzy fixed charge solid transportation problem using batch transferring by new approaches in meta-heuristic, Eine Erweiterung des Transportproblems, Minimizing settlements, Two classical transportation problems revisited: pure constant fixed charges and the paradox, The transportation problem with packing constraints, Scalable timing-aware network design via Lagrangian decomposition, On the fixed cost flow problem†, A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution., A heuristic algorithm for the fixed charge problem, A vertex ranking algorithm for the fixed-charge transportation problem, Approximating some network design problems with node costs, Degeneracy in fixed cost transportation problems, La programacion lineal bivalente mixta: Nuevo campo de aplicabilidad de las tecnicas de programacion lineal, A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations, New algorithmic framework for conditional value at risk: application to stochastic fixed-charge transportation, Fixed charge transportation problem with type-2 fuzzy variables, An improved branch and bound algorithm for minimum concave cost network flow problems, Some computationally relevant group theoretic structures of fixed charge problems, A genetic algorithm for solving the fixed-charge transportation model: two-stage problem, IP over 40+ years at IBM scientific centers and marketing, Unnamed Item, An extension of the product-parts replacement problem, Quasi-concave minimization subject to linear constraints, Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems, Solving stochastic dynamic programming problems by linear programming — An annotated bibliography, Minimum concave-cost network flow problems: Applications, complexity, and algorithms, Exact algorithm for solving a special fixed-charge linear programming problem, Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation, A study of the fixed charge transportation problem, A branch-and-bound algorithm for solving a fixed charge problem in the profit optimization of sawn timber production, Heuristic algorithms for the fixed-charge transportation problem, Some computational results of using the Ahrens—Finke method for handling degeneracy in fixed charge transportation problems, Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité, Facets and algorithms for capacitated lot sizing, Uncertain random shortest path 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, Fractional polynomial bounds for the fixed charge problem, A set covering reformulation of the pure fixed charge transportation problem, A tabu search heuristic procedure for the fixed charge transportation problem, Logical processing for integer programming, The pure fixed charge transportation problem
