Extreme points and adjacency relationship in the flow polytope (Q1257824): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5627898 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A generalized upper bounding algorithm for multicommodity network flow problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimum Concave Cost Flows in Certain Networks / rank | |||
Normal rank | |||
Latest revision as of 02:17, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Extreme points and adjacency relationship in the flow polytope |
scientific article |
Statements
Extreme points and adjacency relationship in the flow polytope (English)
0 references
1978
0 references
Extreme Points
0 references
Adjacency
0 references
Flow Polytope
0 references
Flows in Networks
0 references
Maximal Flow Problem
0 references
Capacitated Digraph
0 references
