On the Complexity of Selecting Disjunctions in Integer Programming (Q3083283): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/080737587 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2158102350 / rank | |||
Normal rank | |||
Latest revision as of 20:56, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Complexity of Selecting Disjunctions in Integer Programming |
scientific article |
Statements
On the Complexity of Selecting Disjunctions in Integer Programming (English)
0 references
21 March 2011
0 references
complexity
0 references
disjunctions
0 references
general branching
0 references
split inequalities
0 references
integer programming
0 references
