A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems (Q1329799): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0166-218x(92)00190-w / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2076535438 / rank | |||
Normal rank | |||
Latest revision as of 08:33, 30 July 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
0 references
0 references
0 references
