In this Ph.D. thesis an important class of d.c. programs is studied from both a theoretical and an algorithmic point of view. This class of problems is computationally studied with a "branch and bound" and a "branch and reduce" approaches, pointing out the e ffectiveness of partitioning rules and of stack policies for managing the branches. In this light, the results appeared in the literature are extended and deepened on. This study can be virtually divided into three main steps.
"Branch and Bound" and "Branch and Reduce" approaches for a class of D.C. Programs
SALVI, FRANCESCA
2010
Abstract
In this Ph.D. thesis an important class of d.c. programs is studied from both a theoretical and an algorithmic point of view. This class of problems is computationally studied with a "branch and bound" and a "branch and reduce" approaches, pointing out the e ffectiveness of partitioning rules and of stack policies for managing the branches. In this light, the results appeared in the literature are extended and deepened on. This study can be virtually divided into three main steps.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
TesiFrancescaSalvi.pdf
embargo fino al 31/05/2050
Tipologia:
Altro materiale allegato
Dimensione
745.43 kB
Formato
Adobe PDF
|
745.43 kB | Adobe PDF | |
|
Bibliografia.pdf
accesso aperto
Dimensione
111.49 kB
Formato
Adobe PDF
|
111.49 kB | Adobe PDF | Visualizza/Apri |
|
Conclusioni.pdf
accesso aperto
Dimensione
131.86 kB
Formato
Adobe PDF
|
131.86 kB | Adobe PDF | Visualizza/Apri |
|
Introduzione.pdf
accesso aperto
Dimensione
200.23 kB
Formato
Adobe PDF
|
200.23 kB | Adobe PDF | Visualizza/Apri |
I documenti in UNITESI 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/20.500.14242/151590
Il codice NBN di questa tesi è
URN:NBN:IT:UNIPI-151590