A branch and bound algorithm for solving the multiple-choice knapsack problem
DOI10.1016/0377-0427(84)90023-2zbMATH Open0555.65039OpenAlexW2045247420WikidataQ56324179 ScholiaQ56324179MaRDI QIDQ760766FDOQ760766
Authors: D. Kharzeev 
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
Recommendations
branch and bound algorithmcomparisonspegging testComputational experiencemultiple-choice knapsack problem
Numerical mathematical programming methods (65K05) Integer programming (90C10) Boolean programming (90C09)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- THE MULTIPLE-CHOICE KNAPSACK PROBLEM
- The Multiple-Choice Knapsack Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- A computational study of a multiple-choice knapsack algorithm
- Pivot and Complement–A Heuristic for 0-1 Programming
- The Linear Multiple Choice Knapsack Problem
- A o(n logn) algorithm for LP knapsacks with GUB constraints
- The 0-1 knapsack problem with multiple choice constraints
- Title not available (Why is that?)
- Title not available (Why is that?)
- A mathematical programming system for preference and compatibility maximized menu planning and scheduling
Cited In (29)
- An O(n) algorithm for the multiple-choice knapsack linear program
- A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints
- Title not available (Why is that?)
- Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm
- Approximate and exact algorithms for the fixed-charge knapsack problem
- An approach for solving nonlinear multi-objective separable discrete optimization problem with one constraint
- Computational comparison on the partitioning strategies in multiple choice integer programming
- The bottleneck generalized assignment problem
- Title not available (Why is that?)
- An approximate binary search algorithm for the multiple-choice knapsack problem
- A fast algorithm for the linear multiple-choice knapsack problem
- Algorithm 632: A program for the 0–1 multiple knapsack problem
- An O(n) algorithm for the linear multiple choice knapsack problem and related problems
- Experimental investigations of combined algorithms of branch and bound method and dynamic programming method for knapsack problems
- A Branch-and-Price Algorithm for the Multiple Knapsack Problem
- Title not available (Why is that?)
- A multi-criteria approach to approximate solution of multiple-choice knapsack problem
- An exact algorithm for the fixed-charge multiple knapsack problem
- Title not available (Why is that?)
- A minimal algorithm for the multiple-choice knapsack problem
- The use of duality to determine the branching order of variables and to estimate the bounds in the solution of the knapsack problem
- An improved binary search algorithm for the multiple-choice knapsack problem
- A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem
- A branch-and-bound algorithm for hard multiple knapsack problems
- An Exact Algorithm for the Multiple-Choice Multidimensional Knapsack Based on the Core
- A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints
- A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
- The linear multiple choice knapsack problem
- A solution method for a knapsack problem and its variant
This page was built for publication: A branch and bound algorithm for solving the multiple-choice knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q760766)
