A branch-and-bound algorithm for the quadratic multiple knapsack problem

DOI10.1016/j.ejor.2021.06.018zbMath1490.90242OpenAlexW3172926224MaRDI QIDQ2076914

Krzysztof Fleszar

Publication date: 22 February 2022

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2021.06.018

zbMATH Keywords

branch-and-boundlocal searchpackingtransportation problemfractional knapsack problem

Mathematics Subject Classification ID

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

Related Items (3)

Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Lagrangian matheuristics for the quadratic multiple knapsack problem ⋮ LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup

Cites Work

• Unnamed Item
• An ejection chain approach for the quadratic multiple knapsack problem
• Generalized quadratic multiple knapsack problem and two solution approaches
• Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem
• A branch and search algorithm for a class of nonlinear knapsack problems
• Approximation algorithms for the multiple knapsack problem with assignment restrictions
• Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem
• Efficient Production-Distribution System Design
• An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating

This page was built for publication: A branch-and-bound algorithm for the quadratic multiple knapsack problem