Accelerating List Processing in Discrete Programming

DOI10.1145/321574.321590MaRDI QIDQ5591245zbMATH OpenOpenAlexFDO

Authors

Publication date 1970

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/321574.321590

zbMATH Keywords

operations research

Cited in

(3)

• Branching from the largest upper bound. Folklore and facts
• Solution techniques for some allocation problems
• Depth-m search in branch-and-bound algorithms

This page was built for publication: Accelerating List Processing in Discrete Programming

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