A branch-and-bound algorithm for hard multiple knapsack problems
From MaRDI portal
Publication:545544
DOI10.1007/S10479-009-0660-YzbMATH Open1225.90104OpenAlexW2024626675MaRDI QIDQ545544FDOQ545544
Authors: Alex 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
Recommendations
- Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver
- A branch and bound algorithm for solving the multiple-choice knapsack problem
- A branch-and-bound algorithm for the quadratic multiple knapsack problem
- An exact algorithm for the budget-constrained multiple knapsack problem
- scientific article; zbMATH DE number 3889280
Cites Work
- An exact algorithm for large multiple knapsack problems
- Title not available (Why is that?)
- A 3/4-approximation algorithm for multiple subset sum
- Where are the hard knapsack problems?
- A PTAS for the multiple subset sum problem with different knapsack capacities
- An algorithm for 0-1 multiple-knapsack problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bin completion algorithms for multicontainer packing, Knapsack, and covering problems
- A new dominance procedure for combinatorial optimization problems
- A bound and bound algorithm for the zero-one multiple knapsack problem
- Upper bounds and algorithms for the maximum cardinality bin packing problem.
- Computational aspects of clearing continuous call double auctions with assignment constraints and indivisible demand
- Pruning moves
- An Algorithm for the Solution of 0-1 Loading Problems
- Title not available (Why is that?)
- The Loading Problem
Cited In (21)
- Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver
- Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm
- Solutions of hard knapsack problems using extreme pruning
- Mathematical models and decomposition methods for the multiple knapsack problem
- A study of lattice reformulations for integer programming
- Experimental investigations of combined algorithms of branch and bound method and dynamic programming method for knapsack problems
- A Branch-and-Price Algorithm for the Multiple Knapsack Problem
- Title not available (Why is that?)
- Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems
- The use of duality to determine the branching order of variables and to estimate the bounds in the solution of the knapsack problem
- Hard multidimensional multiple choice knapsack problems, an empirical study
- A new upper bound for the multiple knapsack problem
- A binary multiple knapsack model for single machine scheduling with machine unavailability
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- Bin completion algorithms for multicontainer packing, Knapsack, and covering problems
- A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints
- Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem
- A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
- Title not available (Why is that?)
- Two-agent advertisement scheduling on physical books to maximize the total profit
- Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables
Uses Software
This page was built for publication: A branch-and-bound algorithm for hard multiple knapsack problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q545544)
