A strongly polynomial algorithm for line search in submodular polyhedra (Q2427694)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A strongly polynomial algorithm for line search in submodular polyhedra |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A strongly polynomial algorithm for line search in submodular polyhedra |
scientific article |
Statements
A strongly polynomial algorithm for line search in submodular polyhedra (English)
0 references
14 May 2008
0 references
submodular function
0 references
network flow
0 references
exchange capacity
0 references
0 references
0 references
