Solution of the zero-one multiple knapsack problem

DOI10.1016/0377-2217(80)90112-5zbMath0439.90059OpenAlexW2031376842MaRDI QIDQ1142701

Paolo Toth, Silvano Martello

Publication date: 1980

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(80)90112-5

zbMATH Keywords

combinatorial optimizationbounding proceduressolution algorithmcomputational performancebranch and bound schemedifferent branching strategieszero-one multiple knapsack problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Specification and verification (program logics, model checking, etc.) (68Q60) Boolean programming (90C09)

Related Items

Placement Optimization in Refugee Resettlement, A Branch-and-Price Algorithm for the Multiple Knapsack Problem, Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem, An exact algorithm for large multiple knapsack problems, Bounds for nested knapsack problems, Wireless IoT sensors data collection reward maximization by leveraging multiple energy- and storage-constrained UAVs, Heuristic algorithms for the multiple knapsack problem, Heuristics and their design: A survey, A bound and bound algorithm for the zero-one multiple knapsack problem, A hybrid evolutionary search for the generalized quadratic multiple knapsack problem, Mathematical models and decomposition methods for the multiple knapsack problem, Semi-definite relaxation algorithm of multiple knapsack problem

Cites Work

• An upper bound for the zero-one knapsack problem and a branch and bound algorithm
• Dynamic Loading and Unloading of Liquids into Tanks
• An Algorithm for the Solution of 0-1 Loading Problems
• Merging and Sorting Applied to the Zero-One Knapsack Problem
• Computing Partitions with Applications to the Knapsack Problem
• An algorithm for 0-1 multiple-knapsack problems