On the Complexity of Selecting Disjunctions in Integer Programming (Q3083283): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:48, 3 February 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
