We review some complexity results and present a viable heuristic approach based on the Variable Neighborhood Search (VNS) framework for multimode extension of combinatorial optimization problems, such as the the Set Covering Problem (SCP) and the Covering Location Problem (CLP).
Multimode extensions of Combinatorial Optimization problems / R. Cordone, G. Lulli. - In: ELECTRONIC NOTES IN DISCRETE MATHEMATICS. - ISSN 1571-0653. - 55:(2016 Nov), pp. 17-20. ((Intervento presentato al 14. convegno Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW16) nel 2016 [10.1016/j.endm.2016.10.005].
Multimode extensions of Combinatorial Optimization problems
R. CordonePrimo
;
2016
Abstract
We review some complexity results and present a viable heuristic approach based on the Variable Neighborhood Search (VNS) framework for multimode extension of combinatorial optimization problems, such as the the Set Covering Problem (SCP) and the Covering Location Problem (CLP).
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
CordoneLulli_ElectronicNotesDiscreteMatematics_Multimode_2016.pdf
accesso riservato
Tipologia:
Publisher's version/PDF
Dimensione
161.93 kB
Formato
Adobe PDF
|
161.93 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
