A branch-and-bound algorithm for hard multiple knapsack problems

DOI10.1007/s10479-009-0660-yzbMath1225.90104OpenAlexW2024626675MaRDI QIDQ545544

Alex S. Fukunaga

Publication date: 22 June 2011

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-009-0660-y

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (10)

Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ A Branch-and-Price Algorithm for the Multiple Knapsack Problem ⋮ Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem ⋮ A binary multiple knapsack model for single machine scheduling with machine unavailability ⋮ Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables ⋮ A new upper bound for the multiple knapsack problem ⋮ A study of lattice reformulations for integer programming ⋮ Mathematical models and decomposition methods for the multiple knapsack problem ⋮ Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems ⋮ Two-Agent Advertisement Scheduling on Physical Books to Maximize the Total Profit

Uses Software

• Knapsack
• MULKNAP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new dominance procedure for combinatorial optimization problems
• An exact algorithm for large multiple knapsack problems
• A bound and bound algorithm for the zero-one multiple knapsack problem
• Upper bounds and algorithms for the maximum cardinality bin packing problem.
• A 3/4-approximation algorithm for multiple subset sum
• A PTAS for the multiple subset sum problem with different knapsack capacities
• Computational aspects of clearing continuous call double auctions with assignment constraints and indivisible demand
• Where are the hard knapsack problems?
• Pruning Moves
• An Algorithm for the Solution of 0-1 Loading Problems
• An algorithm for 0-1 multiple-knapsack problems
• The Loading Problem

This page was built for publication: A branch-and-bound algorithm for hard multiple knapsack problems