Use of penalties in a branch and bound procedure for the fixed charge transportation problem

DOI10.1016/0377-2217(89)90229-4zbMath0702.90056OpenAlexW1981364505MaRDI QIDQ915648

Joanne R. Schaffer, Daniel E. O'Leary

Publication date: 1989

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(89)90229-4

zbMATH Keywords

branch and boundfixed charge transportationadjacent extreme point heuristic

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) 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 (9)

A new node selection strategy in the branch-and-bound procedure ⋮ Artificial immune system and sheep flock algorithms for two-stage fixed-charge transportation problem ⋮ Step fixed-charge solid transportation problem: a Lagrangian relaxation heuristic approach ⋮ Solving fixed charge transportation problem with truck load constraint using metaheuristics ⋮ 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 ⋮ Penalty computations for the set partitioning problem ⋮ An algorithm for finding the optimum solution of solid fixed-charge transportation problem ⋮ A tabu search heuristic procedure for the fixed charge transportation problem

Cites Work

• Unnamed Item
• A branch-and-bound algorithm for solving fixed charge problems
• Some branch-and-bound procedures for fixed-cost transportation problems
• An integer programming algorithm for portfolio selection with fixed charges
• A New Optimization Method for Large Scale Fixed Charge Transportation Problems
• A more compact formulation of the symmetric multiple traveling salesman problem with fixed charges
• Linear Relaxations of the Capacitated Warehouse Location Problem
• A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem
• Augmented Threaded Index Method For Network Optimization
• Integer Programming Algorithms: A Framework and State-of-the-Art Survey

This page was built for publication: Use of penalties in a branch and bound procedure for the fixed charge transportation problem