Sufficiency of cut-generating functions (Q494318): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Inequalities from Two Rows of a Simplex Tableau / 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: Cut-Generating Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence between intersection cuts and the corner polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained Infinite Group Relaxations of MIPs / 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: Some polyhedra related to combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of facets for multiple right-hand choice linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: On degenerate multi-row Gomory cuts / rank
 
Normal rank

Latest revision as of 16:37, 10 July 2024

scientific article
Language Label Description Also known as
English
Sufficiency of cut-generating functions
scientific article

    Statements

    Identifiers