Lifting inequalities: a framework for generating strong cuts for nonlinear programs (Q847822): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Flow pack facets of the single node fixed-charge flow polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the facets of the mixed-integer knapsack polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the knapsack polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3340498 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2712822 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5465123 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex programming for disjunctive convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new linearization technique for multi-quadratic 0-1 programming problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large-Scale Zero-One Linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the Complementarity Knapsack Polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequence independent lifting in mixed integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facet of regular 0–1 polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Hard Mixed-Integer Programming Problems with Xpress-MP: A MIPLIB 2003 Case Study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Box-constrained quadratic programs with fixed charge variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifting, superadditivity, mixed integer rounding and single node flow sets revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5566063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 0-1 knapsack problem with a single continuous variable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / 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: On the facial structure of set packing polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid Linear Inequalities for Fixed Charge Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifted inequalities for 0-1 mixed integer programming: superlinear lifting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequence independent lifting for mixed integer programs with variable upper bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reformulation-linearization technique for solving discrete and continuous nonconvex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new reformulation-linearization technique for bilinear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut method for 0-1 mixed convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex extensions and envelopes of lower semi-continuous functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid inequalities and separation for uncapacitated fixed charge networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral study of nonconvex quadratic programs with box constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faces for a linear inequality in 0–1 variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Facets and Strong Valid Inequalities for Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid Inequalities and Superadditivity for 0–1 Integer Programs / rank
 
Normal rank

Revision as of 11:04, 2 July 2024

scientific article
Language Label Description Also known as
English
Lifting inequalities: a framework for generating strong cuts for nonlinear programs
scientific article

    Statements

    Lifting inequalities: a framework for generating strong cuts for nonlinear programs (English)
    0 references
    19 February 2010
    0 references
    Cutting planes
    0 references
    Bilinear knapsacks
    0 references
    Convex extensions
    0 references
    Sequence-independent lifting
    0 references
    Elementary closures
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers