Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver

DOI10.1007/978-3-540-68155-7_9zbMATH Open1142.90501OpenAlexW1551828178MaRDI QIDQ5387622FDOQ5387622

Authors: Alex Fukunaga 

Publication date: 27 May 2008

Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-68155-7_9

Recommendations

• A branch-and-bound algorithm for hard multiple knapsack problems
• A new dominance procedure for combinatorial optimization problems
• A new upper bound for the multiple knapsack problem
• The multidimensional knapsack problem: structure and algorithms
• A ``reduce and solve approach for the multiple-choice multidimensional knapsack problem

Mathematics Subject Classification ID

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

Cites Work

• An exact algorithm for large multiple knapsack problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Loading Problem
• Title not available (Why is that?)
• Bin completion algorithms for multicontainer packing, Knapsack, and covering 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
• Title not available (Why is that?)

Cited In (1)

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

Uses Software

• Knapsack
• MULKNAP

This page was built for publication: Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387622)