Construct · 1 fields · 1 citations

Sherali-Adams hierarchy: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Combinatorial optimization

a sequence of ever tighter linear-programming relaxations of a 0-1 program formed by multiplying constraints by products of variables.

In combinatorial optimization, Sherali-Adams hierarchy refers to a sequence of ever tighter linear-programming relaxations of a 0-1 program formed by multiplying constraints by products of variables. This meaning comes from Sherali (1990) in SIAM Journal on Discrete Mathematics.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how Sherali-Adams hierarchy sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

hierarchy4 fields · 4 citationsjingle · one word, four constructs program2 fields · 2 citationsjingle · one word, two constructs sequence3 fields · 3 citationsjingle · one word, three constructs

References

Sherali, H. D., & Adams, W. P. (1990). A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems. SIAM Journal on Discrete Mathematics, 3(3), 411-430. https://doi.org/10.1137/0403036

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct