The fixed charge problem. I: A new heuristic method

DOI10.1016/0898-1221(75)90010-3zbMath0332.90029OpenAlexW2065599960MaRDI QIDQ1228545

Leon Cooper

Publication date: 1975

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(75)90010-3

Mathematics Subject Classification ID

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

Related Items

On lower bounds for the fixed charge problem ⋮ Global optimization algorithm for capacitated multi-facility continuous location-allocation problems ⋮ A guided reactive GRASP for the capacitated multi-source Weber problem ⋮ A heuristic algorithm for the fixed charge problem ⋮ A family of heuristic solution methods for a class of nonlinear programming problems ⋮ Region-rejection based heuristics for the capacitated multi-source Weber problem ⋮ COLE: a new heuristic approach for fixed charge problem computational results ⋮ Fixed charge problems with identical fixed charges ⋮ Fractional polynomial bounds for the fixed charge problem ⋮ A tabu search heuristic procedure for the fixed charge transportation problem

Cites Work

• Unnamed Item
• Eine variante der simplexmethode mit gleichzeitigem austausch mehrerer basisvariablen pro iterationsschritt
• The Simplex Method: Two Basic Variables Replacement
• An approximate solution method for the fixed charge problem
• The fixed charge problem
• The fixed charge problem