Partial convexification cuts for 0--1 mixed-integer programs (Q1771349): 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: CPLEX / rank | |||
Normal rank |
Revision as of 12:35, 28 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Partial convexification cuts for 0--1 mixed-integer programs |
scientific article |
Statements
Partial convexification cuts for 0--1 mixed-integer programs (English)
0 references
21 April 2005
0 references
Integer programming
0 references
Cutting plane
0 references
Branch-and-cut
0 references
Convexification cut
0 references
Reformulation-linearization technique (RLT)
0 references