Probabilistic partial set covering problems (Q5202816): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
label / enlabel / en
 
Probabilistic partial set covering problems
Property / cites work
 
Property / cites work: Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tree-search algorithm for mixed integer programming problems / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/1520-6750(199102)38:1<41::aid-nav3220380106>3.0.co;2-l / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2036208295 / rank
 
Normal rank
Property / title
 
Probabilistic partial set covering problems (English)
Property / title: Probabilistic partial set covering problems (English) / rank
 
Normal rank

Latest revision as of 09:31, 30 July 2024

scientific article; zbMATH DE number 4197715
Language Label Description Also known as
English
Probabilistic partial set covering problems
scientific article; zbMATH DE number 4197715

    Statements

    0 references
    0 references
    0 references
    1991
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    probabilistic partial set covering
    0 references
    group of facilities
    0 references
    total service reliability
    0 references
    branch-and-bound
    0 references
    0 references
    Probabilistic partial set covering problems (English)
    0 references