Partial convexification cuts for 0--1 mixed-integer programs (Q1771349): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 08:35, 1 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
