A Branch-and-Bound Algorithm for Multi-Level Fixed-Charge Problems

DOI10.1287/MNSC.16.1.67MaRDI QIDQ5576135zbMATH OpenOpenAlexFDO

Authors Arnold P. Jones, Richard M. Soland

Publication date 1969

Published in Management Science (Search for Journal in Brave)

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

zbMATH Keywords

operations research

Cited in

(5)

• A heuristic for multiple choice programming
• A note on the duality gap in nonconvex optimization and a very simple procedure for bid evaluation type problems
• Calculation of bounds on variables satisfying nonlinear inequality constraints
• Facets and algorithms for capacitated lot sizing
• Bounding a class of nonconvex linearly-constrained resource allocation problems via the surrogate dual

This page was built for publication: A Branch-and-Bound Algorithm for Multi-Level Fixed-Charge Problems

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