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

DOI10.1287/mnsc.16.1.67zbMath0184.23204OpenAlexW2168226087MaRDI QIDQ5576135

Richard M. Soland, Arnold P. Jones

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

Related Items (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 ⋮ Bounding a class of nonconvex linearly-constrained resource allocation problems via the surrogate dual ⋮ Facets and algorithms for capacitated lot sizing

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