The probabilistic minimum spanning tree problem (Q3481518): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1002/net.3230200302 / rank
Normal rank
 
Property / author
 
Property / author: Dimitris J. Bertsimas / rank
Normal rank
 
Property / author
 
Property / author: Dimitris J. Bertsimas / rank
 
Normal rank
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.3230200302 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2120881403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1002/NET.3230200302 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:25, 21 December 2024

scientific article
Language Label Description Also known as
English
The probabilistic minimum spanning tree problem
scientific article

    Statements

    The probabilistic minimum spanning tree problem (English)
    0 references
    0 references
    1990
    0 references
    probabilistic variation
    0 references
    minimal spanning tree
    0 references
    minimal expected length
    0 references
    NP-hard
    0 references
    a priori optimization
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references