An interior point cutting plane heuristic for mixed integer programming (Q632679)
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: An interior point cutting plane heuristic for mixed integer programming |
scientific article; zbMATH DE number 5870586
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An interior point cutting plane heuristic for mixed integer programming |
scientific article; zbMATH DE number 5870586 |
Statements
An interior point cutting plane heuristic for mixed integer programming (English)
0 references
25 March 2011
0 references
mixed integer problems
0 references
analytic center
0 references
ACCPM
0 references
feasibility
0 references
interior point methods
0 references
0 references
0 references
0 references
0 references
0.9163612
0 references
0.9144087
0 references
0.90968263
0 references
0.9069265
0 references
0.9032313
0 references
0.9032043
0 references
0.89928913
0 references
0 references
