Extending a CIP framework to solve MIQCPs (Q2897306)
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: Extending a CIP framework to solve MIQCPs |
scientific article; zbMATH DE number 6054061
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Extending a CIP framework to solve MIQCPs |
scientific article; zbMATH DE number 6054061 |
Statements
Extending a CIP Framework to Solve MIQCPs (English)
0 references
10 July 2012
0 references
mixed integer quadratically constrained programming
0 references
constraint integer programming
0 references
branch-and-cut
0 references
convex relaxation
0 references
domain propagation
0 references
primal heuristic
0 references
nonconvex
0 references
0.8014456629753113
0 references
0.7958076000213623
0 references
0.7763563394546509
0 references
0.7742478847503662
0 references
