Intersection cuts from multiple rows: a disjunctive programming approach (Q458123): Difference between revisions

From MaRDI portal
Changed an Item
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s13675-013-0008-x / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2037710606 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1206.1630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inequalities from Two Rows of a Simplex Tableau / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection Cuts—A New Type of Cutting Planes for Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive programming: Properties of the convex hull of feasible points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strengthening cuts for mixed integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the relative strength of split, triangle and quadrilateral cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments with Two-Row Cuts from Degenerate Tableaux / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Valid Inequalities for Integer Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence between intersection cuts and the corner polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chvátal closures for mixed integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the facets of mixed integer programs with two integer variables and two constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two row mixed-integer cuts via lifting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments with Two Row Tableau Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some polyhedra related to combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing cut generators for mixed-integer linear programming / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S13675-013-0008-X / rank
 
Normal rank

Latest revision as of 18:13, 9 December 2024

scientific article
Language Label Description Also known as
English
Intersection cuts from multiple rows: a disjunctive programming approach
scientific article

    Statements

    Intersection cuts from multiple rows: a disjunctive programming approach (English)
    0 references
    0 references
    0 references
    30 September 2014
    0 references
    mixed integer programming
    0 references
    disjunctive programming
    0 references
    intersection cuts
    0 references
    0-1 programming
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references