A Branch-and-Bound Algorithm to Solve Large Scale Integer Quadratic Multi-Knapsack Problems
From MaRDI portal
Publication:5448795
DOI10.1007/978-3-540-69507-3_39zbMath1131.90462OpenAlexW1910470796MaRDI QIDQ5448795
Eric Soutif, Dominique Quadri, Pierre Tolla
Publication date: 7 March 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://basepub.dauphine.fr/handle/123456789/3951
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)