Accelerating List Processing in Discrete Programming

DOI10.1145/321574.321590zbMath0195.20802OpenAlexW2067097286MaRDI QIDQ5591245

No author found.

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

Related Items

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