Balanced paths in acyclic networks: Tractable cases and related approaches (Q4667719): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The balanced linear programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Most and least uniform spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Multicommodity Flow Approach to the Crew Rostering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-level bottleneck assignment approach to the bus drivers' rostering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: 1-Approximation algorithm for bottleneck disjoint path matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Column Generation Approach for Large-Scale Aircrew Rostering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / 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: The complexity of finding maximum disjoint paths with length constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating disjoint-path problems using packing integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2777025 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of finding two disjoint paths with min-max objective function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly polynomial algorithm for the uniform balanced network flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint paths in a network / rank
 
Normal rank

Revision as of 09:14, 10 June 2024

scientific article; zbMATH DE number 2159823
Language Label Description Also known as
English
Balanced paths in acyclic networks: Tractable cases and related approaches
scientific article; zbMATH DE number 2159823

    Statements

    Balanced paths in acyclic networks: Tractable cases and related approaches (English)
    0 references
    0 references
    0 references
    0 references
    21 April 2005
    0 references
    layered networks
    0 references
    balanced paths
    0 references
    cost difference
    0 references
    pseudopolynomial approaches
    0 references

    Identifiers