Valid inequalities for mixed integer linear programs (Q995784): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10107-006-0086-0 / rank
Normal rank
 
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 / 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/s10107-006-0086-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2152088446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Split closure and intersection cuts / 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: Strong formulations of robust mixed 0-1 programming / 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: Properties of the convex hull of feasible points / 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: 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: 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: Subset Algebra Lift Operators for 0-1 Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5465123 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the MIR closure / 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: 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: Solving Lift-and-Project Relaxations of Binary Integer Programs / 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: Edmonds polytopes and a hierarchy of combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cutting-plane proofs in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact formulations as a union of polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Matrix-Cut Rank of Polyhedra / 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: Elementary closures for integer programs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the rank of mixed 0,1 polyhedra. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A connection between cutting plane theory and the geometry of numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the membership problem for the elementary closure of a polyhedron / 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: When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5645210 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some polyhedra related to combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some continuous functions related to corner polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixing mixed-integer inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intermediate integer programming representations using value disjunctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting planes from a mixed integer Farkas lemma. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4537750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / 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: Aggregation and Mixed Integer Rounding to Solve MIPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight formulations for some simple mixed integer programs and convex objective integer programs / 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: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Value of Binary Expansions for General Mixed-Integer Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Cutting Planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / 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: The Continuous Mixing Polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Polytopes / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10107-006-0086-0 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:15, 28 December 2024

scientific article
Language Label Description Also known as
English
Valid inequalities for mixed integer linear programs
scientific article

    Statements

    Valid inequalities for mixed integer linear programs (English)
    0 references
    10 September 2007
    0 references
    Mixed integer linear program
    0 references
    Lift-and-project
    0 references
    Split cut
    0 references
    Gomory cut
    0 references
    Mixed integer rounding
    0 references
    Elementary closure
    0 references
    Polyhedra
    0 references
    Union of polyhedra
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers