A branch and bound algorithm for solving the multiple-choice knapsack problem
From MaRDI portal
Publication:760766
DOI10.1016/0377-0427(84)90023-2zbMath0555.65039OpenAlexW2045247420WikidataQ56324179 ScholiaQ56324179MaRDI QIDQ760766
Publication date: 1984
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-0427(84)90023-2
branch and bound algorithmcomparisonspegging testComputational experiencemultiple-choice knapsack problem
Numerical mathematical programming methods (65K05) Integer programming (90C10) Boolean programming (90C09)
Related Items (8)
A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem ⋮ A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints ⋮ A minimal algorithm for the multiple-choice knapsack problem ⋮ The bottleneck generalized assignment problem ⋮ An approach for solving nonlinear multi-objective separable discrete optimization problem with one constraint ⋮ A multi-criteria approach to approximate solution of multiple-choice knapsack problem ⋮ Computational comparison on the partitioning strategies in multiple choice integer programming ⋮ Approximate and exact algorithms for the fixed-charge knapsack problem
Cites Work
- The 0-1 knapsack problem with multiple choice constraints
- A computational study of a multiple-choice knapsack algorithm
- A o(n logn) algorithm for LP knapsacks with GUB constraints
- Pivot and Complement–A Heuristic for 0-1 Programming
- The Linear Multiple Choice Knapsack Problem
- THE MULTIPLE-CHOICE KNAPSACK PROBLEM
- A mathematical programming system for preference and compatibility maximized menu planning and scheduling
- The Multiple-Choice Knapsack Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A branch and bound algorithm for solving the multiple-choice knapsack problem
