Lifting procedures for the precedence-constrained knapsack problem
Conference
·
OSTI ID:36372
We consider the polyhedral structure of precedence-constrained knapsack problem. The problem itself appears in many applications. Moreover, since the precedence constraints is a common characteristic to many important integer programming problems, the polyhedral results can be used to develop cutting-plane algorithms for more general applications. We propose lifting procedures of the cover inequality, which explicitly consider the precedence constraints. Some properties of the lifted inequality are analyzed and the problem of finding optimal lifting order is also addressed.
- OSTI ID:
- 36372
- Report Number(s):
- CONF-9408161--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Sequential knapsack problem
The nonlinear knapsack problem
Tight polynominal bounds for matroidal knapsacks
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36114
The nonlinear knapsack problem
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36131
Tight polynominal bounds for matroidal knapsacks
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:35762