Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables (Q2164683): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: James R. Luedtke / rank
Normal rank
 
Property / author
 
Property / author: James R. Luedtke / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3214182848 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2111.07855 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inequalities from Two Rows of a Simplex Tableau / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mixed vertex packing problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive 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: 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: Lift-and-project for mixed 0-1 programming: recent progress / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Lattice-Free Convex Sets in Linear Subspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840365 / 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: Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the facets of mixed integer programs with two integer variables and two constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some lower bounds on sparse outer approximations of polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments with Two Row Tableau Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating polyhedra with sparse inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Split cuts from sparse disjunctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixing mixed-integer inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The integer \(L\)-shaped method for stochastic integer programs with complete recourse / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cook, Kannan and Schrijver's example revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for the latent-class logit assortment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of approximations for maximizing submodular set functions—I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fenchel decomposition for stochastic mixed-integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing a stochastic maximum-reliability path / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4537754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Benders Dual Decomposition Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finitely Convergent Decomposition Algorithms for Two-Stage Stochastic Pure Integer Programs / rank
 
Normal rank

Latest revision as of 22:20, 29 July 2024

scientific article
Language Label Description Also known as
English
Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables
scientific article

    Statements

    Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables (English)
    0 references
    0 references
    0 references
    16 August 2022
    0 references
    0 references
    disjunctive cuts
    0 references
    epigraph
    0 references
    sparsity
    0 references
    valid inequalities
    0 references
    0 references
    0 references
    0 references
    0 references