On the multiperiod binary knapsack problem (Q1058454)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the multiperiod binary knapsack problem |
scientific article; zbMATH DE number 3900492
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the multiperiod binary knapsack problem |
scientific article; zbMATH DE number 3900492 |
Statements
On the multiperiod binary knapsack problem (English)
0 references
1985
0 references
We consider the 0-1 programming problem having special stair-case constraints. An efficient algorithm for solving the linear programming relaxation of the problem is given and some variable reduction rules are presented. A generalization of our results to more general 0-1 problem with nested constraints is discussed.
0 references
multiperiod binary knapsack problem
0 references
stair-case constraints
0 references
efficient algorithm
0 references
linear programming relaxation
0 references
variable reduction rules
0 references
nested constraints
0 references
0.9522951
0 references
0.9320158
0 references
0.9085794
0 references
0 references
0 references
