Can Pure Cutting Plane Algorithms Work? (Q3503863)
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 5285922
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Can Pure Cutting Plane Algorithms Work? |
scientific article; zbMATH DE number 5285922 |
Statements
Can Pure Cutting Plane Algorithms Work? (English)
0 references
10 June 2008
0 references
Cutting Plane Methods
0 references
Gomory Cuts
0 references
Degeneracy in Linear Programming
0 references
Lexicographic Dual Simplex
0 references
Computational Analysis
0 references
0.941780924797058
0 references
0.8610166907310486
0 references
0.8069207072257996
0 references
0.7929931282997131
0 references
0.7914240956306458
0 references
