Improved Penalties for Fixed Cost Linear Programs Using Lagrangean Relaxation

DOI10.1287/mnsc.32.7.856zbMath0599.90084OpenAlexW2030241623MaRDI QIDQ3735468

S. Selcuk Erenguc, A. Victor Cabot

Publication date: 1986

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

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

zbMATH Keywords

Lagrangean relaxationbranch and boundDreibeek-Tomlin penaltyfixed cost problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Related Items

Tabu search applied to the general fixed charge problem, Algorithms for solving the single-sink fixed-charge transportation problem, An improved branch and bound algorithm for minimum concave cost network flow problems, Some branch-and-bound procedures for fixed-cost transportation problems, Unnamed Item, Exact algorithm for solving a special fixed-charge linear programming problem, Solving the fixed charge problem with Lagrangian relaxation and cost allocation heuristics, A computational study of using preprocessing and stronger formulations to solve large general fixed charge problems, COLE: a new heuristic approach for fixed charge problem computational results, Penalty computations for the set partitioning problem, A tabu search heuristic procedure for the fixed charge transportation problem