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_39zbMATH Open1131.90462OpenAlexW1910470796MaRDI QIDQ5448795FDOQ5448795
Authors: Dominique Quadri, Éric Soutif, 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
Recommendations
- Upper bounds for large scale integer quadratic multidimensional knapsack problems
- A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems
- Exact solution method to solve large scale integer quadratic multidimensional knapsack problems
- A branch-and-bound algorithm for the quadratic multiple knapsack problem
- Improving an exact approach for solving separable integer quadratic knapsack problems
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Cited In (10)
- An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints
- Improving an exact approach for solving separable integer quadratic knapsack problems
- Upper bounds for large scale integer quadratic multidimensional knapsack problems
- A branch-and-bound algorithm for multi-dimensional quadratic 0–1 knapsack problems
- A branch-and-bound algorithm for the quadratic multiple knapsack problem
- A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems
- A Branch-and-Price Algorithm for the Multiple Knapsack Problem
- Exact solution method to solve large scale integer quadratic multidimensional knapsack problems
- A new bound for the quadratic knapsack problem and its use in a branch and bound algorithm
- Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm
This page was built for publication: A Branch-and-Bound Algorithm to Solve Large Scale Integer Quadratic Multi-Knapsack Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5448795)