About strongly polynomial time algorithms for quadratic optimization over submodular constraints (Q1908017)
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: About strongly polynomial time algorithms for quadratic optimization over submodular constraints |
scientific article; zbMATH DE number 849128
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | About strongly polynomial time algorithms for quadratic optimization over submodular constraints |
scientific article; zbMATH DE number 849128 |
Statements
About strongly polynomial time algorithms for quadratic optimization over submodular constraints (English)
0 references
10 April 1996
0 references
Kuhn-Tucker conditions
0 references
lexicographically optimal flow
0 references
parametric maximum flow
0 references
strongly polynomial algorithms
0 references
convex separable quadratic minimization over submodular constraints
0 references
0.8325751423835754
0 references
0.825804591178894
0 references
0.8195532560348511
0 references
0.8189110159873962
0 references
