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).
Cordone, R., Lulli, G. (2016). Multimode extensions of Combinatorial Optimization problems. ELECTRONIC NOTES IN DISCRETE MATHEMATICS, 55, 17-20 [10.1016/j.endm.2016.10.005].
Multimode extensions of Combinatorial Optimization problems
Lulli, G.
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:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
