Complete formulations of polytopes related to extensions of assignment matrices (Q1662654): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4258215 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and Approximate Algorithms for Scheduling Nonidentical Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Most Imbalanced Orientation of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended and discretized formulations for the maximum clique problem / 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: Disjunctive programming: Properties of the convex hull of feasible points / rank
 
Normal rank

Latest revision as of 10:22, 16 July 2024

scientific article
Language Label Description Also known as
English
Complete formulations of polytopes related to extensions of assignment matrices
scientific article

    Statements

    Complete formulations of polytopes related to extensions of assignment matrices (English)
    0 references
    0 references
    0 references
    0 references
    20 August 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    assignment problems
    0 references
    polytope
    0 references
    separation
    0 references
    complete formulation
    0 references
    compact formulation
    0 references
    0 references