A factor \(\frac {1}{2}\) approximation algorithm for two-stage stochastic matching problems (Q2488899): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Partitioning procedures for solving mixed-variables programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4371290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms and relaxations for a service provision problem on a telecommunication network / 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: Q4309474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>L</i>-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank

Latest revision as of 14:02, 24 June 2024

scientific article
Language Label Description Also known as
English
A factor \(\frac {1}{2}\) approximation algorithm for two-stage stochastic matching problems
scientific article

    Statements

    A factor \(\frac {1}{2}\) approximation algorithm for two-stage stochastic matching problems (English)
    0 references
    0 references
    0 references
    16 May 2006
    0 references
    0 references
    Stochastic programming
    0 references
    Approximation algorithms
    0 references
    Matching
    0 references
    Combinatorial optimization
    0 references
    0 references