The knapsack problem with disjoint multiple-choice constraints (Q3993988): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/nav.3220390206 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2020305217 / rank | |||
Normal rank | |||
Latest revision as of 20:30, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The knapsack problem with disjoint multiple-choice constraints |
scientific article |
Statements
The knapsack problem with disjoint multiple-choice constraints (English)
0 references
13 August 1992
0 references
multiple-choice knapsack problem
0 references
GUB constraints
0 references
two-stage algorithm
0 references
Lagrangean dual
0 references
branch-and-bound
0 references
