A heuristic to generate rank-1 GMI cuts (Q621750): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(11 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: Cgllandp / 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: COIN-OR / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GAMS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: QSopt-Exact / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MIQPlib / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: QSopt / 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-010-0018-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2110152564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: MIPLIB 2003 / 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: 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: A lift-and-project cutting plane algorithm for mixed 0-1 programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gomory cuts revisited / 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: Optimizing over the split closure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2712822 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grid-Enabled Optimization with GAMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the separation of split cuts and related inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerically Safe Gomory Mixed-Integer Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elementary closures for integer programs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the strength of Gomory mixed-integer cuts as group cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Step MIR Inequalities for Mixed Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: MIR closures of polyhedral sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroids and the greedy algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing over the first Chvátal closure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed-integer cuts from cyclic groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Exact Separation of Mixed Integer Knapsack Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity Distribution System Design by Benders Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aggregation and Mixed Integer Rounding to Solve MIPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / 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: The Elimination form of the Inverse and its Application to Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial algorithms for computing column space bases that have sparse inverses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases / rank
 
Normal rank

Latest revision as of 16:40, 3 July 2024

scientific article
Language Label Description Also known as
English
A heuristic to generate rank-1 GMI cuts
scientific article

    Statements

    A heuristic to generate rank-1 GMI cuts (English)
    0 references
    0 references
    0 references
    28 January 2011
    0 references
    Gomory mixed-integer cuts
    0 references
    rank one
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers