Blocking pairs of polyhedra arising from network flows (Q1221561): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3292914 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5620998 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Anti-blocking polyhedra / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Blocking and anti-blocking pairs of polyhedra / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Packing rooted directed cuts in a weighted directed graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A theorem on flows in networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Extremal configurations and decomposition theorems. I / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3851094 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a Class of Capacitated Transportation Problems / rank | |||
Normal rank |
Latest revision as of 16:36, 12 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Blocking pairs of polyhedra arising from network flows |
scientific article |
Statements
Blocking pairs of polyhedra arising from network flows (English)
0 references
1975
0 references