Partial convexification cuts for 0--1 mixed-integer programs (Q1771349): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / 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.1016/j.ejor.2002.09.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2046559810 / 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: A lift-and-project cutting plane algorithm for mixed 0-1 programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strengthening cuts for mixed integer programs / 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: Generating cuts from surrogate constraint analysis for zero-one and multiple choice programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cones of Matrices and Set-Functions and 0–1 Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Facet Generation Procedure for Solving 0/1 Integer Programs / 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 hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the generation of deep disjunctive cutting planes / rank
 
Normal rank

Latest revision as of 09:13, 10 June 2024

scientific article
Language Label Description Also known as
English
Partial convexification cuts for 0--1 mixed-integer programs
scientific article

    Statements

    Partial convexification cuts for 0--1 mixed-integer programs (English)
    0 references
    0 references
    0 references
    0 references
    21 April 2005
    0 references
    Integer programming
    0 references
    Cutting plane
    0 references
    Branch-and-cut
    0 references
    Convexification cut
    0 references
    Reformulation-linearization technique (RLT)
    0 references

    Identifiers