A Branch-and-Bound Method for the Fixed Charge Transportation Problem
From MaRDI portal
Publication:5750718
DOI10.1287/mnsc.36.9.1092zbMath0718.90068OpenAlexW2155644717MaRDI QIDQ5750718
Udatta S. Palekar, Mark H. Karwan, Stanley Zionts
Publication date: 1990
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.36.9.1092
Mixed integer programming (90C11) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Bilinear modeling solution approach for fixed charge network flow problems, An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems, On lower bounds for the fixed charge problem, Artificial immune system and sheep flock algorithms for two-stage fixed-charge transportation problem, Discontinuous piecewise linear optimization, Some Transportation Problems Under Uncertain Environments, A heuristic algorithm for the fixed charge problem, Minimal-cost network flow problems with variable lower bounds on arc flows, On the transformation mechanism for formulating a multiproduct two-layer supply chain network design problem as a network flow model, Solving fixed charge transportation problem with truck load constraint using metaheuristics, A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems, Algorithms for solving the single-sink fixed-charge transportation problem, Adaptive dynamic cost updating procedure for solving fixed charge network flow problems, A genetic algorithm for solving the fixed-charge transportation model: two-stage problem, Unnamed Item, Multiperiod tool and production assignment in flexible manufacturing systems, Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems, Stochastic optimization models for a single-sink transportation problem, Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation, Solving fixed charge transportation problem with interval parameters, A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge, 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, Fractional polynomial bounds for the fixed charge problem, Penalty computations for the set partitioning problem, An algorithm for finding the optimum solution of solid fixed-charge transportation problem, An algorithm for the optimum time-cost trade-off in fixed-charge bi-criterion transportation problem bi-criterion transportation problem, A tabu search heuristic procedure for the fixed charge transportation problem
