Abstract
In this article we consider the binary knapsack problem under disjoint multiple‐choice constraints. We propose a two‐stage algorithm based on Lagrangian relaxation. The first stage determines in polynomial time an optimal Lagrange multiplier value, which is then used within a branch‐and‐bound scheme to rank‐order the solutions, leading to an optimal solution in a relatively low depth of search. The validity of the algorithm is established, a numerical example is included, and computational experience is described.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 213-227 |
| Number of pages | 15 |
| Journal | Naval Research Logistics (NRL) |
| Volume | 39 |
| Issue number | 2 |
| DOIs | |
| State | Published - Jan 1 1992 |
Fingerprint
ASJC Scopus subject areas
- Modeling and Simulation
- Ocean Engineering
- Management Science and Operations Research
Cite this
The knapsack problem with disjoint multiple‐choice constraints. / Aggarwal, Vijay; Deo, Narsingh; Sarkar, Dilip.
In: Naval Research Logistics (NRL), Vol. 39, No. 2, 01.01.1992, p. 213-227.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - The knapsack problem with disjoint multiple‐choice constraints
AU - Aggarwal, Vijay
AU - Deo, Narsingh
AU - Sarkar, Dilip
PY - 1992/1/1
Y1 - 1992/1/1
N2 - In this article we consider the binary knapsack problem under disjoint multiple‐choice constraints. We propose a two‐stage algorithm based on Lagrangian relaxation. The first stage determines in polynomial time an optimal Lagrange multiplier value, which is then used within a branch‐and‐bound scheme to rank‐order the solutions, leading to an optimal solution in a relatively low depth of search. The validity of the algorithm is established, a numerical example is included, and computational experience is described.
AB - In this article we consider the binary knapsack problem under disjoint multiple‐choice constraints. We propose a two‐stage algorithm based on Lagrangian relaxation. The first stage determines in polynomial time an optimal Lagrange multiplier value, which is then used within a branch‐and‐bound scheme to rank‐order the solutions, leading to an optimal solution in a relatively low depth of search. The validity of the algorithm is established, a numerical example is included, and computational experience is described.
UR - http://www.scopus.com/inward/record.url?scp=84989675145&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84989675145&partnerID=8YFLogxK
U2 - 10.1002/nav.3220390206
DO - 10.1002/nav.3220390206
M3 - Article
AN - SCOPUS:84989675145
VL - 39
SP - 213
EP - 227
JO - Naval Research Logistics Quarterly
JF - Naval Research Logistics Quarterly
SN - 0028-1441
IS - 2
ER -