Robust min-max regret covering problems

This article deals with two min-max regret covering problems: the min-max regret Weighted Set Covering Problem (min-max regret WSCP) and the min-max regret Maximum Benefit Set Covering Problem (min-max regret MSCP). These problems are the robust optimization counterparts, respectively, of the Weight...

Descripción completa

Detalles Bibliográficos
Autores principales: Coco, Amadeu A., Santos, Andréa Cynthia, Noronha, Thiago F.
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Springer US 2022
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9283832/
https://www.ncbi.nlm.nih.gov/pubmed/35855459
http://dx.doi.org/10.1007/s10589-022-00391-x

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9283832/
https://www.ncbi.nlm.nih.gov/pubmed/35855459
http://dx.doi.org/10.1007/s10589-022-00391-x

Ejemplares similares