Optimal set partitioning, matchings and lagrangian duality (Q3960468): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4145425 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling-salesman problem and minimum spanning trees: Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validation of subgradient optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4404428 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Large Set Partitioning Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitivity analysis of optimal matchings / rank
 
Normal rank

Latest revision as of 16:09, 13 June 2024

scientific article
Language Label Description Also known as
English
Optimal set partitioning, matchings and lagrangian duality
scientific article

    Statements

    Optimal set partitioning, matchings and lagrangian duality (English)
    0 references
    0 references
    0 references
    1979
    0 references
    set partitioning problem
    0 references
    matching problem
    0 references
    simple side constraints
    0 references
    Lagrangian relaxation
    0 references
    Lagrangian dual
    0 references
    cyclic coordinate method
    0 references
    sensitivity analysis
    0 references

    Identifiers