The 0-1 knapsack problem with multiple choice constraints

DOI10.1016/0377-2217(78)90108-XzbMath0383.90078OpenAlexW2021895358MaRDI QIDQ1248462

Robert M. Nauss

Publication date: 1978

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

Full work available at URL: https://doi.org/10.1016/0377-2217(78)90108-x

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Boolean programming (90C09) Operations research and management science (90B99)

Related Items (19)

Exact methods for the knapsack problem and its generalizations ⋮ Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context ⋮ A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem ⋮ A versatile algorithm for assembly line balancing ⋮ Model and algorithms for multi-period sea cargo mix problem ⋮ A minimal algorithm for the multiple-choice knapsack problem ⋮ Optimal selection of touristic packages based on user preferences during sports mega-events ⋮ The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints ⋮ A decomposition approach for multidimensional knapsacks with family‐split penalties ⋮ On maintenance scheduling of production units ⋮ A best first search exact algorithm for the multiple-choice multidimensional knapsack problem ⋮ Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method ⋮ A o(n logn) algorithm for LP knapsacks with GUB constraints ⋮ Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls ⋮ A multi-criteria approach to approximate solution of multiple-choice knapsack problem ⋮ The multiple multidimensional knapsack with family-split penalties ⋮ A mathematical programming system for preference and compatibility maximized menu planning and scheduling ⋮ A branch and bound algorithm for solving the multiple-choice knapsack problem ⋮ Reliability optimization of a series system with multiple-choice and budget constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Reduction Algorithm for Zero-One Single Knapsack Problems
• A branch and bound algorithm for the generalized assignment problem
• An Efficient Algorithm for the 0-1 Knapsack Problem
• Integer Programming Algorithms: A Framework and State-of-the-Art Survey

This page was built for publication: The 0-1 knapsack problem with multiple choice constraints