On three approaches to length-bounded maximum multicommodity flow with unit edge-lengths (Q3388417): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q128748981, #quickstatements; #temporary_batch_1726270021205
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: IPM / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Potential function methods for approximately solving linear programming problems: theory and practice. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4509380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Length-bounded cuts and flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving difficult multicommodity problems with a specialized interior-point algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior-point solver for convex separable block-angular problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5624995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Fractional Multicommodity Flow Independent of the Number of Commodities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840370 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual approximation algorithms for integral flow and multicut in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum cost multiple-source unsplittable flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds for the unsplittable flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The solution of the multi-product problem with integer-valued flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiobjective optimization: Improved FPTAS for shortest paths and nonlinear objectives with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Multicommodity Flow Problems by an Approximation Scheme / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128748981 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:29, 14 September 2024

scientific article
Language Label Description Also known as
English
On three approaches to length-bounded maximum multicommodity flow with unit edge-lengths
scientific article

    Statements

    On three approaches to length-bounded maximum multicommodity flow with unit edge-lengths (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 May 2021
    0 references
    computational experiment
    0 references
    linear programming
    0 references
    fully polynomial-time approximation scheme
    0 references
    greedy heuristic
    0 references
    software defined satellite network
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references