A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems (Q1329799): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:30, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems |
scientific article |
Statements
A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems (English)
0 references
5 September 1995
0 references
tight relaxations
0 references
convex hull representations
0 references
facetial inequalities
0 references
disjunctive programming
0 references
mixed-integer zero-one programming
0 references
convex hull of feasible solutions
0 references
