A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem

DOI10.1287/mnsc.22.10.1116zbMath0329.90039OpenAlexW1976440380MaRDI QIDQ4096138

Jeffrey L. Kennington, Ed Unger

Publication date: 1976

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.22.10.1116

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Linear programming (90C05)

Related Items

The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation, An algorithm for solving fixed-charge problems using surrogate constraints, Artificial immune system and sheep flock algorithms for two-stage fixed-charge transportation problem, A search tree algorithm for plant location problems, Computational risk management techniques for fixed charge network flow problems with uncertain arc failures, A vertex ranking algorithm for the fixed-charge transportation problem, Solving fixed charge transportation problem with truck load constraint using metaheuristics, 4-Dimensional Transportation Problem for Substitute and Complementary Items Under Rough Environment, A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems, Algorithms for solving the single-sink fixed-charge transportation problem, A bicriteria solid transportation problem with fixed charge under stochastic environment, An improved branch and bound algorithm for minimum concave cost network flow 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, A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge, Uncertain programming models for fixed charge multi-item solid transportation problem, A computational study of using preprocessing and stronger formulations to solve large general fixed charge problems, Uncertain multi-objective multi-item fixed charge solid transportation problem with budget constraint, An algorithm for a concave production cost network flow problem, COLE: a new heuristic approach for fixed charge problem computational results, The transportation problem with exclusionary side constraints and two branch-and-bound algorithms, A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure, An algorithm for finding the optimum solution of solid fixed-charge transportation problem, Reoptimization procedures for bounded variable primal simplex network algorithms, A set covering reformulation of the pure fixed charge transportation problem, A tabu search heuristic procedure for the fixed charge transportation problem, Entropy based solid transportation problems with discounted unit costs under fuzzy random environment, The pure fixed charge transportation problem