Adjacent extreme flows and application to min concave cost flow problems (Q3853462)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3653894
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Adjacent extreme flows and application to min concave cost flow problems |
scientific article; zbMATH DE number 3653894 |
Statements
Adjacent extreme flows and application to min concave cost flow problems (English)
0 references
1979
0 references
adjacent extreme flows
0 references
enumerating algorithm
0 references
network flows
0 references
network programming
0 references
neighboring extreme flows
0 references
single source
0 references
set of sinks
0 references
flow polyhedron
0 references
minimum concave cost flow problems
0 references
uncapacited networks
0 references
multicommodity transportation problems
0 references
computational experiments
0 references
test problems
0 references
capacited networks
0 references
