Coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds

Coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds

0.00 Avg rating0 Votes
Article ID: iaor1990694
Country: Netherlands
Volume: 9
Issue: 1
Start Page Number: 1
End Page Number: 7
Publication Date: Jan 1990
Journal: Operations Research Letters
Authors: ,
Abstract:

The notion of coefficient reduction is extended for 0-1 knapsack-like constraints by taking advantage of the special structure of variable bounding constraints. The present procedure produces reductions not detected by myopic coefficient reduction methods.

Reviews

Required fields are marked *. Your email address will not be published.