The ellipsoid method and its consequences in combinatorial optimization (Q1168215): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q55882924, #quickstatements; #temporary_batch_1722838931121 |
Created claim: DBLP publication ID (P1635): journals/combinatorica/GrotschelLS81, #quickstatements; #temporary_batch_1731468600454 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/combinatorica/GrotschelLS81 / rank | |||
Normal rank | |||
Latest revision as of 04:45, 13 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The ellipsoid method and its consequences in combinatorial optimization |
scientific article |
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
