Extending a CIP Framework to Solve MIQCPs (Q2897306): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: CPLEX / rank | |||
Normal rank | |||
Revision as of 13:09, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Extending a CIP Framework to Solve MIQCPs |
scientific article |
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
