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.

Bonami P., Lodi A., Tramontani A., Wiese S. (2017). Cutting planes from wide split disjunctions [10.1007/978-3-319-59250-3_9].

Cutting planes from wide split disjunctions

Lodi A.;Wiese S.
2017

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.
2017
Integer Programming and Combinatorial Optimization
99
110
Bonami P., Lodi A., Tramontani A., Wiese S. (2017). Cutting planes from wide split disjunctions [10.1007/978-3-319-59250-3_9].
Bonami P.; Lodi A.; Tramontani A.; Wiese S.
File in questo prodotto:
Eventuali allegati, non sono esposti

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11585/905310
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 3
  • ???jsp.display-item.citation.isi??? 3
social impact