Obtaining clique, cover and coefficient reduction inequalities as Chvatal-Gomory inequalities and Gomory fractional cuts

Obtaining clique, cover and coefficient reduction inequalities as Chvatal-Gomory inequalities and Gomory fractional cuts

0.00 Avg rating0 Votes
Article ID: iaor19972101
Country: Netherlands
Volume: 73
Issue: 3
Start Page Number: 539
End Page Number: 546
Publication Date: Mar 1994
Journal: European Journal of Operational Research
Authors: ,
Abstract:

The authors show how clique and cover induced inequalities implied from 0-1 knapsack constraints can be obtained as Chvatal-Gomory inequalities. LP tighter and 0-1 equivalent constraints to 0-1 knapsack constraints obtained by the ‘big M’ reduction procedure can also be generated as Chvatal-Gomory inequalities. They also show how some extended coefficient reduction based LP tighter and 0-1 equivalent constraints can be generated as Gomory fractional cuts.

Reviews

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