Facets and cuts from additive systems
Integer Program Facets with non-negative entries could be derived from Additive System Problems, like Semigroup or Gomory`s Group Problems. These facets can be used as cuts for Branch and Cuts Algorithms. In fact, any Master Problem facet with some equal coefficients came from lifting a facet of a easily related Multivalued Additive System. A morphism type relation between problems allow us to obtain facets for Master Problems or cuts for Integer Programs. We use Knapsack Problems as examples either to present results about sequential lifting for non-Master Problems, pseudo-morphisms for facet generation for Master Problems and cut generation for Integer Programs solving small subadditive linear programs or to state open problems.
- OSTI ID:
- 35774
- Report Number(s):
- CONF-9408161--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Solving set covering problems with general cutting planes
Lifting procedures for the precedence-constrained knapsack problem