Cargando…
A Hybrid Solution Method for the Multi-Service Location Set Covering Problem
The Multi-Service Location Set Covering Problem is an extension of the well-known Set Covering Problem. It arises in practical applications where a set of physical locations need to be equipped with services to satisfy demand within a certain area, while minimizing costs. In this paper we formulate...
Autores principales: | Chiscop, Irina, Nauta, Jelle, Veerman, Bert, Phillipson, Frank |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7304718/ http://dx.doi.org/10.1007/978-3-030-50433-5_41 |
Ejemplares similares
-
Multi-agent Reinforcement Learning Using Simulated Quantum Annealing
por: Neumann, Niels M. P., et al.
Publicado: (2020) -
Microsoft SQL Server 2008 Integration Services Problem-Design-Solution
por: Veerman, Erik, et al.
Publicado: (2009) -
Multi-objective database queries in combined knapsack and set covering problem domains
por: Mochocki, Sean A., et al.
Publicado: (2021) -
Maximal covering location problem for nuclear medicine clinics allocation in Nigeria
por: Taiwo, Olalekan J., et al.
Publicado: (2021) -
Solving Set Cover with Pairs Problem using Quantum Annealing
por: Cao, Yudong, et al.
Publicado: (2016)