Tesi etd-05192010-002840 |
Link copiato negli appunti
Tipo di tesi
Tesi di dottorato di ricerca
Autore
SALVI, FRANCESCA
URN
etd-05192010-002840
Titolo
"Branch and Bound" and "Branch and Reduce" approaches for a class of D.C. Programs
Settore scientifico disciplinare
MAT/09
Corso di studi
MATEMATICA PER LE DECISIONI ECONOMICHE
Relatori
tutor Prof. Cambini, Riccardo
Parole chiave
- d.c. programs
- branch and reduce
- optimization
Data inizio appello
31/05/2010
Consultabilità
Parziale
Data di rilascio
31/05/2050
Riassunto
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.
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
| Nome file | Dimensione |
|---|---|
| Bibliografia.pdf | 114.16 Kb |
| Conclusioni.pdf | 135.03 Kb |
| Introduzione.pdf | 205.03 Kb |
1 file non consultabili su richiesta dell’autore. |
|