scientific article

zbMath1172.90475arXiv1110.2209MaRDI QIDQ3624058

Richard E. Korf, Alex S. Fukunaga

Publication date: 28 April 2009

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

dominance criterionbranch-and-bound strategy

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorial optimization (90C27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (12)

Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ A Branch-and-Price Algorithm for the Multiple Knapsack Problem ⋮ Exhaustive approaches to 2D rectangular perfect packings ⋮ A new upper bound for the multiple knapsack problem ⋮ A constraint programming approach for a batch processing problem with non-identical job sizes ⋮ Exploiting subproblem dominance in constraint programming ⋮ Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver ⋮ Lower bounds and algorithms for the minimum cardinality bin covering problem ⋮ Lower bounds for a bin packing problem with linear usage cost ⋮ Mathematical models and decomposition methods for the multiple knapsack problem ⋮ A branch-and-bound algorithm for hard multiple knapsack problems ⋮ Packing-based branch-and-bound for discrete malleable task scheduling

Uses Software

• Knapsack
• MULKNAP

This page was built for publication: