Approximation of Corner Polyhedra with Families of Intersection Cuts (Q4637498): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q130064193, #quickstatements; #temporary_batch_1726420686562
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: On an Analysis of the Strength of Mixed-Integer Cutting Planes from Multiple Simplex Tableau Rows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of Lovász's theorem on maximal lattice-free sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notions of Maximality for Integral Lattice-Free Polyhedra: The Case of Dimension Three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Flatness Theorem for Nonsymmetric Convex Bodies via the Local Theory of Banach Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4790110 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the relative strength of split, triangle and quadrilateral cuts / 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: Minimal Inequalities for an Infinite Relaxation of Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A geometric approach to cut-generating functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cut-Generating Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some polyhedra related to combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4733665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of optimal solutions to integer and mixed-integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Bodies The Brunn-MinkowskiTheory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On degenerate multi-row Gomory cuts / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1137/17m1128939 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2794912356 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q130064193 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:22, 15 September 2024

scientific article; zbMATH DE number 6863993
Language Label Description Also known as
English
Approximation of Corner Polyhedra with Families of Intersection Cuts
scientific article; zbMATH DE number 6863993

    Statements

    Approximation of Corner Polyhedra with Families of Intersection Cuts (English)
    0 references
    0 references
    0 references
    0 references
    24 April 2018
    0 references
    cutting plane theory
    0 references
    lattice-free sets
    0 references
    corner polyhedra
    0 references

    Identifiers