Valid inequalities for mixed integer linear programs.

Cornuéjols, G. (2008). Valid inequalities for mixed integer linear programs. Mathematical Programming, 112(1), 3-44.

Type

Journal article

Intellectual base

Primary research

Year

2008

Volume

112

Issue

1

Pages

3-44

DOI

10.1007/s10107-006-0086-0

DOI registrant

Springer Nature

Link

https://doi.org/10.1007/s10107-006-0086-0

Cited from

operations_research

Cited by

1 citation across 1 artifact.

Each citation links to the sentence it supports in the citing article.

Primes

• Branch and Bound
  • Third, it exemplifies the relationship between relaxation and search: tighter relaxations (convex hulls, cutting-plane strengthening per Cornuéjols's (2007)

    This sourcecanonical modern survey of cutting-plane theory/practice for MIP (Gomory, MIR, lift-and-project, split cuts) — the relaxation-strengthening techniques used inside branch-and-cut. (Published 2008; circulated as a 2007 survey.)

    Supported in partVerified against the publisher's abstract

    Cornuejols's survey does cover the cutting-plane families the claim names, but its abstract never states that tighter relaxations improve search.

    “The tutorial also discusses computational aspects of generating the cuts and their strength.”

    Read by an automated reader; not a human review. How support was checked

Verification

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Read against the text for 1 of 1 citation: 1 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:76f7e84c0b95 · see in the full table