On the prize-collecting generalized minimum spanning tree problem (Q2480209): 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.1007/s10479-006-0153-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2014324934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalized minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparative analysis of several formulations for the generalized minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the generalized minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4448919 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressing combinatorial optimization problems by linear programs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:31, 27 June 2024

scientific article
Language Label Description Also known as
English
On the prize-collecting generalized minimum spanning tree problem
scientific article

    Statements

    On the prize-collecting generalized minimum spanning tree problem (English)
    0 references
    0 references
    31 March 2008
    0 references
    0 references
    combinatorial optimization
    0 references
    minimum spanning trees
    0 references
    generalized minimum spanning tree problem
    0 references
    linear relaxation
    0 references
    0 references