Can Pure Cutting Plane Algorithms Work? (Q3503863): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: MIPLIB / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-540-68891-4_29 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2114330374 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 21:53, 19 March 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
