Optimizing cost flows by edge cost and capacity upgrade (Q876725): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Hans-Christoph Wirth / rank
Normal rank
 
Property / author
 
Property / author: Hans-Christoph Wirth / 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.1016/j.jda.2004.04.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2051873362 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228484 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving spanning trees by upgrading nodes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upgrading bottleneck constrained forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4494412 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modifying edges of a network to obtain short subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriteria Network Design Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network upgrading problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The network inhibition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many birds with one stone / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:18, 25 June 2024

scientific article
Language Label Description Also known as
English
Optimizing cost flows by edge cost and capacity upgrade
scientific article

    Statements

    Optimizing cost flows by edge cost and capacity upgrade (English)
    0 references
    0 references
    0 references
    0 references
    26 April 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    transportation problems
    0 references
    network design
    0 references
    network upgrade
    0 references
    minimum cost flow
    0 references
    series-parallel graphs
    0 references
    0 references