Can Pure Cutting Plane Algorithms Work? (Q3503863): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: MIPLIB / rank | |||
Normal rank | |||
Revision as of 12:11, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Can Pure Cutting Plane Algorithms Work? |
scientific article |
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
