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

DOI10.1287/MNSC.22.10.1116MaRDI QIDQ4096138zbMATH OpenOpenAlexFDO

Authors Jeffery 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

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

Cited in

(32)

• A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge
• Reoptimization procedures for bounded variable primal simplex network algorithms
• 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 truck load constraint using metaheuristics
• 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
• The transportation problem with exclusionary side constraints and two branch-and-bound algorithms
• Computational risk management techniques for fixed charge network flow problems with uncertain arc failures
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms
• Uncertain multi-objective multi-item fixed charge solid transportation problem with budget constraint
• 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
• Adaptive dynamic cost updating procedure for solving fixed charge network flow problems
• COLE: a new heuristic approach for fixed charge problem computational results
• Entropy based solid transportation problems with discounted unit costs under fuzzy random environment
• An algorithm for solving fixed-charge problems using surrogate constraints
• Artificial immune system and sheep flock algorithms for two-stage fixed-charge transportation problem
• 4-dimensional transportation problem for substitute and complementary items under rough environment
• The pure fixed charge transportation problem
• scientific article; zbMATH DE number 1330764 (Why is no real title available?)
• An algorithm for finding the optimum solution of solid fixed-charge transportation problem
• 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

This page was built for publication: A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem

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