An easy solution for a special class of fixed charge problems

DOI10.1002/NAV.3800270409MaRDI QIDQ3893674zbMATH OpenOpenAlexFDO

Authors Patrick G. McKeown, Prabhakant Sinha

Publication date 1980

Published in Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nav.3800270409

zbMATH Keywords

branch-and-bound integer programming codecomputational experiencefixed charge problemset-coveringsolution procedurestest problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Mixed integer programming (90C11)

Cites work

• The fixed charge problem

Cited in

(3)

• A tabu search heuristic procedure for the fixed charge transportation problem
• COLE: a new heuristic approach for fixed charge problem computational results
• An algorithm for solving fixed-charge problems using surrogate constraints

This page was built for publication: An easy solution for a special class of fixed charge problems

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