Cut generation through binarization (Q896284): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: MIPLIB / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MIPLIB2003 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10107-015-0924-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2206991147 / rank
 
Normal rank
Property / cites work
 
Property / cites work: MIPLIB 2003 / 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: A lift-and-project cutting plane algorithm for mixed 0-1 programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strengthening cuts for mixed integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing over the split closure / 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: On optimizing over lift-and-project closures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cut Generation through Binarization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs / 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: MIR closures of polyhedral sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the relative strength of different generalizations of split cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Experiments with Cross and Crooked Cross Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Curvature inequalities for Lagrangian submanifolds: the final solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5645210 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cook, Kannan and Schrijver's example revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strength of multi-row models / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Value of Binary Expansions for General Mixed-Integer Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5755529 / rank
 
Normal rank

Latest revision as of 05:07, 11 July 2024

scientific article
Language Label Description Also known as
English
Cut generation through binarization
scientific article

    Statements

    Cut generation through binarization (English)
    0 references
    0 references
    0 references
    9 December 2015
    0 references
    0 references
    split cuts
    0 references
    closure
    0 references
    binarization
    0 references
    0 references
    0 references
    0 references