Probabilistic analysis of an lp relaxation bound for the steiner problem in networks (Q4732318): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/net.3230190705 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2115981193 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Send-and-Split Method for Minimum-Concave-Cost Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:00, 20 June 2024

scientific article; zbMATH DE number 4118185
Language Label Description Also known as
English
Probabilistic analysis of an lp relaxation bound for the steiner problem in networks
scientific article; zbMATH DE number 4118185

    Statements

    Probabilistic analysis of an lp relaxation bound for the steiner problem in networks (English)
    0 references
    0 references
    0 references
    1989
    0 references
    0 references
    0 references
    0 references
    0 references
    relaxation bound
    0 references
    Steiner tree problem in networks
    0 references
    0 references