Polyhedral techniques in combinatorial optimization I: Theory (Q4715790): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Capacitated Facility Location: Valid Inequalities and Facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the knapsack polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncapacitated lot-sizing: The convex hull of solutions / 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 a conjecture of Fejes Toth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of cutting-plane proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitivity theorems in integer linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5602518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A min-max relation for stable sets in graphs with no odd-\(K_ 4\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrices with the Edmonds-Johnson property / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Graphs with All Subgraphs T-Perfect / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total dual integrality and integer polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outline of an algorithm for integer solutions to linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the symmetric travelling salesman problem: Solution of a 120-city problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of large-scale symmetric travelling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the symmetric travelling salesman problem I: Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facet of regular 0–1 polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear description of the discrete lot-sizing and scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral Characterization of the Economic Lot-Sizing Problem with Start-Up Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: (1,k)-configurations and facets for packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of a 532-city symmetric traveling salesman problem by branch and cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facet identification for the symmetric traveling salesman polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: MINTO, a Mixed INTeger Optimizer / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Cutting Planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On total dual integrality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of regular matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faces for a linear inequality in 0–1 variables / rank
 
Normal rank

Latest revision as of 15:43, 24 May 2024

scientific article; zbMATH DE number 946899
Language Label Description Also known as
English
Polyhedral techniques in combinatorial optimization I: Theory
scientific article; zbMATH DE number 946899

    Statements

    Polyhedral techniques in combinatorial optimization I: Theory (English)
    0 references
    0 references
    0 references
    18 November 1996
    0 references
    0 references
    polyhedral combinatorics
    0 references
    valid inequalities
    0 references
    polyhedral description
    0 references
    linear inequalities
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references