A new upper bound for the multiple knapsack problem

DOI10.1016/j.cor.2021.105210OpenAlexW3120855898MaRDI QIDQ2668625

Paolo Detti

Publication date: 7 March 2022

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2010.04187

zbMATH Keywords

upper bounddivisible sizesmultiple knapsack problemsequential relaxation

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (4)

Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ A Branch-and-Price Algorithm for the Multiple Knapsack Problem ⋮ A threshold search based memetic algorithm for the disjunctively constrained knapsack problem ⋮ A hybrid evolutionary search for the generalized quadratic multiple knapsack problem

Uses Software

• Knapsack
• MULKNAP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A polynomial-time algorithm for knapsack with divisible item sizes
• A branch-and-bound algorithm for hard multiple knapsack problems
• Solving sequential knapsack problems
• A polynomial algorithm for the multiple knapsack problem with divisible item sizes
• An exact algorithm for large multiple knapsack problems
• A bound and bound algorithm for the zero-one multiple knapsack problem
• Mathematical models and decomposition methods for the multiple knapsack problem
• A procedure-based heuristic for 0-1 multiple knapsack problems
• Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
• Upper and lower bounding procedures for the multiple knapsack assignment problem
• The cutting stock problem and integer rounding
• The Sequential Knapsack Polytope

This page was built for publication: A new upper bound for the multiple knapsack problem