A polyhedral approach to an integer multicommodity flow problem (Q1975361): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / cites work
 
Property / cites work: On the cycle polytope of a binary matroid / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Circuit Polytope: Facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5675543 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3972951 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Complexity of Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Odd Minimum Cut-Sets and <i>b</i>-Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroids and multicommodity flows / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127186905 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0166-218x(99)00187-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2063375015 / rank
 
Normal rank

Latest revision as of 10:35, 30 July 2024

scientific article
Language Label Description Also known as
English
A polyhedral approach to an integer multicommodity flow problem
scientific article

    Statements

    A polyhedral approach to an integer multicommodity flow problem (English)
    0 references
    0 references
    0 references
    0 references
    22 June 2000
    0 references
    \({\mathcal N}{\mathcal P}\)-hard problem
    0 references
    branch-and-cut
    0 references
    integer multi-commodity flow problem
    0 references
    transportation
    0 references
    VLSI design, and telecommunications
    0 references
    0 references
    0 references

    Identifiers