Valid Inequalities and Superadditivity for 0–1 Integer Programs

descriptionPublicationkeyboard_double_arrow_right Article 01 Feb 1977 English Publisher:Institute for Operations Research and the Management Sciences (INFORMS)Journal:Mathematics of Operations Research, volume 2, pages 66-77 (issn: 0364-765X, eissn: 1526-5471,

Copyright policy )

Authors: Laurence A. Wolsey;

doi: 10.1287/moor.2.1.66

Valid Inequalities and Superadditivity for 0–1 Integer Programs

- Summary
- Subjects
- Metrics

Abstract

It is shown that valid inequalities for 0–1 problems can be essentially characterized by two underlying functions, one of which is superadditive. These functions are essential to the characterization of maximal inequalities, the projection of valid inequalities and the definition of a master polytope. Similar properties are shown to hold for 0–1 group problems.

Keywords

Maximal Inequalities, Superadditivity, Boolean Programming, Boolean programming, Valid Inequalities, Master Polytope

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	56
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average