We address a particular class of bilevel linear programming problems in which all the variables are discrete. The main computational complexities are analyzed and two enhanced exact algorithms are proposed. The rationale behind these two algorithms is described and a modified version is presented for both. A common test bed is used to assess their computational efficiency along with a comparison with an existing benchmark algorithm.
Caramia, M., Mari, R. (2015). Enhanced exact algorithms for discrete bilevel linear problems. OPTIMIZATION LETTERS, 9(7), 1447-1468 [10.1007/s11590-015-0872-9].
Enhanced exact algorithms for discrete bilevel linear problems
CARAMIA, MASSIMILIANO;
2015-01-01
Abstract
We address a particular class of bilevel linear programming problems in which all the variables are discrete. The main computational complexities are analyzed and two enhanced exact algorithms are proposed. The rationale behind these two algorithms is described and a modified version is presented for both. A common test bed is used to assess their computational efficiency along with a comparison with an existing benchmark algorithm.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
OPTL_2015_Enhanced.pdf
solo utenti autorizzati
Licenza:
Copyright dell'editore
Dimensione
857.76 kB
Formato
Adobe PDF
|
857.76 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
