D.C. programs have been widely studied in the recent literature due to their importance in applicative problems. In this paper the results of a computational study related to a branch and reduce approach for solving a class of d.c. problems are provided, pointing out the concrete effectiveness of the use of Lagrangean cuts as an acceleration device.
On the effectiveness of Lagrangean cuts in solving a class of low rank d.c. programs
Cambini, Riccardo
;SALVI, FRANCESCA
2017-01-01
Abstract
D.C. programs have been widely studied in the recent literature due to their importance in applicative problems. In this paper the results of a computational study related to a branch and reduce approach for solving a class of d.c. problems are provided, pointing out the concrete effectiveness of the use of Lagrangean cuts as an acceleration device.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
JSMS postprint.pdf
accesso aperto
Tipologia:
Documento in Post-print
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
539.18 kB
Formato
Adobe PDF
|
539.18 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
