The ellipsoid method and its consequences in combinatorial optimization (Q1168215)
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: The ellipsoid method and its consequences in combinatorial optimization |
scientific article; zbMATH DE number 3775264
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The ellipsoid method and its consequences in combinatorial optimization |
scientific article; zbMATH DE number 3775264 |
Statements
The ellipsoid method and its consequences in combinatorial optimization (English)
0 references
1981
0 references
submodular set function
0 references
Khachiyan's algorithm
0 references
NP hardness
0 references
polynomial algorithms
0 references
polynomial complexity
0 references
vertex packing in perfect graphs
0 references
matching
0 references
matroid intersection problems
0 references
optimum covering of directed cuts of a digraph
0 references
fractional chromatic number
0 references
