A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints
DOI10.1016/S0305-0548(03)00021-2zbMATH Open1046.90046OpenAlexW1974632181MaRDI QIDQ1433165FDOQ1433165
George Kozanidis, Emanuel Melachrinoudis
Publication date: 15 June 2004
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(03)00021-2
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Mixed integer programming (90C11) Boolean programming (90C09)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Introduction to algorithms
- An efficient algorithm for determining the convex hull of a finite planar set
- A minimal algorithm for the multiple-choice knapsack problem
- An O(n) algorithm for the multiple-choice knapsack linear program
- LAPACK95 user's guide
- A note on the knapsack problem with special ordered sets
- The Multiple-Choice Knapsack Problem
- A Bibliographical Survey On Some Well-Known Non-Standard Knapsack Problems
- Approximate algorithms for some generalized knapsack problems
- A computational study of a multiple-choice knapsack algorithm
- An O(n) algorithm for the linear multiple choice knapsack problem and related problems
- The Linear Multiple Choice Knapsack Problem
- A o(n logn) algorithm for LP knapsacks with GUB constraints
- A fast algorithm for the linear multiple-choice knapsack problem
- The linear multiple choice knapsack problem
- On the solution of special generalized upper-bounded problems: The LP/GUB knapsack problem and the Ξ»-form separable convex objective function problem
Cited In (7)
- An O(n) algorithm for the multiple-choice knapsack linear program
- An O(n) algorithm for the linear multiple choice knapsack problem and related problems
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- Solving the linear multiple choice knapsack problem with two objectives: Profit and equity
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- Development of a hybrid dynamic programming approach for solving discrete nonlinear Knapsack problems
- A new Lagrangian based branch and bound algorithm for the 0-1 knapsack problem
Uses Software
Recommendations
- Title not available (Why is that?) π π
- A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem π π
- A branch and bound algorithm for solving the multiple-choice knapsack problem π π
- An O(n) algorithm for the multiple-choice knapsack linear program π π
- A branch-and-bound algorithm for hard multiple knapsack problems π π
- A new Lagrangian based branch and bound algorithm for the 0-1 knapsack problem π π
- An O(n) algorithm for the linear multiple choice knapsack problem and related problems π π
- A fast algorithm for the linear multiple-choice knapsack problem π π
- A branch-and-bound algorithm for the quadratic multiple knapsack problem π π
- A branch-and-bound algorithm for multi-dimensional quadratic 0β1 knapsack problems π π
This page was built for publication: A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1433165)
