Lift-and-Project Cuts for Mixed Integer Convex Programs (Q3009750): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conic mixed-integer rounding cuts / 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: 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: Strengthening cuts for mixed integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lift-and-project for mixed 0-1 programming: recent progress / 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: Facets of the Knapsack Polytope From Minimal Covers / 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: An algorithmic framework for convex mixed integer nonlinear programs / 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: MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex programming for disjunctive convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cuts for mixed 0-1 conic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the separation of disjunctive cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: An In-Out Approach to Disjunctive Optimization / 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: Testing cut generators for mixed-integer linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut method for 0-1 mixed convex programming / rank
 
Normal rank

Latest revision as of 04:43, 4 July 2024

scientific article
Language Label Description Also known as
English
Lift-and-Project Cuts for Mixed Integer Convex Programs
scientific article

    Statements

    Lift-and-Project Cuts for Mixed Integer Convex Programs (English)
    0 references
    0 references
    24 June 2011
    0 references
    mixed integer nonlinear programming
    0 references
    disjunctive programming
    0 references
    lift-and-project
    0 references
    cutting planes
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers