Budget-constrained minimum cost flows (Q281825): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10878-015-9865-y / rank
Normal rank
 
Property / author
 
Property / author: Sven O. Krumke / rank
Normal rank
 
Property / author
 
Property / author: Sven O. Krumke / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C59 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6579254 / rank
 
Normal rank
Property / zbMATH Keywords
 
algorithms
Property / zbMATH Keywords: algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
complexity
Property / zbMATH Keywords: complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
NP-completeness
Property / zbMATH Keywords: NP-completeness / rank
 
Normal rank
Property / zbMATH Keywords
 
minimum cost flow
Property / zbMATH Keywords: minimum cost flow / rank
 
Normal rank
Property / zbMATH Keywords
 
network improvement
Property / zbMATH Keywords: network improvement / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-015-9865-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2069017795 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A capacity scaling algorithm for the constrained maximum flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cost flow algorithms for series-parallel networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the Minimum-Cost Maximum Flow in a Series-Parallel Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quickest flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3012190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the flow cost lowering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing cost flows by edge cost and capacity upgrade / rank
 
Normal rank
Property / cites work
 
Property / cites work: The accessibility arc upgrading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Bicriterion Mathematical Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Recognition of Series Parallel Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of a flow problem with fixed charges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On budget-constrained flow improvement. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for certain network improvement problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization with Rational Objective Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying Parallel Computation Algorithms in the Design of Serial Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4221106 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10878-015-9865-Y / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:23, 9 December 2024

scientific article
Language Label Description Also known as
English
Budget-constrained minimum cost flows
scientific article

    Statements

    Budget-constrained minimum cost flows (English)
    0 references
    0 references
    0 references
    0 references
    11 May 2016
    0 references
    algorithms
    0 references
    complexity
    0 references
    NP-completeness
    0 references
    minimum cost flow
    0 references
    network improvement
    0 references

    Identifiers