An improved branch and bound algorithm for a strongly correlated unbounded knapsack problem

DOI10.1057/PALGRAVE.JORS.2601698zbMath1060.90064OpenAlexW2054083367MaRDI QIDQ4661050

Y.-G. G. Kang, Young-Jo Seong, Changwan Kang

Publication date: 4 April 2005

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601698

zbMATH Keywords

combinatorial optimizationbranch and boundknapsack problemexact algorithm

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

This page was built for publication: An improved branch and bound algorithm for a strongly correlated unbounded knapsack problem