Practical strategies for generating rank-1 split cuts in mixed-integer linear programming (Q384805): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(10 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Cornuéjols, Gérard / rank
Normal rank
 
Property / author
 
Property / author: Cornuéjols, Gérard / rank
 
Normal rank
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: Cgl / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Cbc / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CLP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / 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/s12532-011-0028-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2001634654 / rank
 
Normal rank
Property / cites work
 
Property / cites work: MIPLIB 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduce-and-Split Cuts: Improving the Performance of Mixed-Integer Gomory Cuts / 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 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants / 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: Progress in computational mixed integer programming -- a look back from the other side of the tipping point / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projected Chvátal-Gomory cuts for 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: Improved strategies for branching on general disjunctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: MIR closures of polyhedral sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming and Pricing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing cut generators for mixed-integer linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recursive procedure to generate all cuts for 0-1 mixed integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4217266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5289008 / rank
 
Normal rank

Latest revision as of 02:23, 7 July 2024

scientific article
Language Label Description Also known as
English
Practical strategies for generating rank-1 split cuts in mixed-integer linear programming
scientific article

    Statements

    Practical strategies for generating rank-1 split cuts in mixed-integer linear programming (English)
    0 references
    0 references
    0 references
    28 November 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers