Name
Abstract | ||
|---|---|---|
In this paper, we discuss an extension of split cuts that is based on widening the underlying disjunctions. That the formula for deriving intersection cuts based on splits can be adapted to this case has been known for a decade now. For the first time though, we present applications and computational results. We further provide some theory that supports our findings, discuss extensions with respect to cut strengthening procedures and present some ideas on how to use the wider disjunctions also in branching. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/978-3-319-59250-3_9 | INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, IPCO 2017 |
Field | DocType | Volume |
Discrete mathematics,Computer science,Calculus,Branching (version control) | Conference | 10328 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
4 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pierre Bonami | 1 | 547 | 28.71 |
| Andrea Lodi | 2 | 2198 | 152.51 |
| Andrea Tramontani | 3 | 96 | 6.05 |
| Sven Wiese | 4 | 26 | 1.82 |