On convergence in mixed integer programming (Q715071): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57568127, #quickstatements; #temporary_batch_1712286835472
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: An Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets / 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: Q5801057 / 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: Chvátal closures for mixed integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5645210 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751649 / 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: A disjunctive cutting plane procedure for general mixed-integer linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence of Sequences of Convex Sets in Finite Dimensions / 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

Revision as of 18:06, 5 July 2024

scientific article
Language Label Description Also known as
English
On convergence in mixed integer programming
scientific article

    Statements

    Identifiers