Packing and covering with integral feasible flows in integral supply-demand networks (Q3790920): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Integer Rounding for Polymatroid and Branching Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integer analogue of Carathéodory's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal attack and reinforcement of a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum partition of a matroid into independent subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blocking pairs of polyhedra arising from network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional covers for forests and matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of regular matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3854942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Class of Capacitated Transportation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Flows, Minimum Coverings, and the Four-Color Conjectures / rank
 
Normal rank

Revision as of 17:41, 18 June 2024

scientific article
Language Label Description Also known as
English
Packing and covering with integral feasible flows in integral supply-demand networks
scientific article

    Statements

    Packing and covering with integral feasible flows in integral supply-demand networks (English)
    0 references
    0 references
    0 references
    0 references
    1987
    0 references
    polynomial-time algorithm
    0 references
    packing and covering
    0 references
    integral feasible flows
    0 references
    integral supply-demand network
    0 references
    decomposition
    0 references
    totally unimodular systems
    0 references

    Identifiers

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