The fixed charge problem. I: A new heuristic method

DOI10.1016/0898-1221(75)90010-3MaRDI QIDQ1228545zbMATH OpenOpenAlexFDO

Authors 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) Linear programming (90C05) Integer programming (90C10)

Cites work

• scientific article; zbMATH DE number 3286662 (Why is no real title available?)
• An approximate solution method for the fixed charge problem
• Eine variante der simplexmethode mit gleichzeitigem austausch mehrerer basisvariablen pro iterationsschritt
• The Simplex Method: Two Basic Variables Replacement
• The fixed charge problem
• The fixed charge problem

Cited in

(10)

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

This page was built for publication: The fixed charge problem. I: A new heuristic method

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