| TÃtulo : |
8th International Conference, ICVNS 2021, Abu Dhabi, United Arab Emirates, March 21–25, 2021, Proceedings |
| Tipo de documento: |
documento electrónico |
| Autores: |
Mladenović, Nenad, ; Sleptchenko, Andrei, ; Sifaleras, Angelo, ; Omar, Mohammed, |
| Mención de edición: |
1 ed. |
| Editorial: |
[s.l.] : Springer |
| Fecha de publicación: |
2021 |
| Número de páginas: |
X, 191 p. 66 ilustraciones, 26 ilustraciones en color. |
| ISBN/ISSN/DL: |
978-3-030-69625-2 |
| Nota general: |
Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos. |
| Palabras clave: |
Informática Matemáticas discretas Algoritmos Matemáticas de la Computación Matemáticas discretas en informática Diseño y Análisis de Algoritmos |
| Ãndice Dewey: |
40.151 |
| Resumen: |
Este volumen constituye las actas de la 8.ª Conferencia Internacional sobre Búsqueda de Vecindad Variable, ICVNS 2021, celebrada en Abu Dhabi, Emiratos Ãrabes Unidos, en marzo de 2021. Los 14 artÃculos completos presentados en este volumen fueron cuidadosamente revisados ​​y seleccionados entre 27 presentaciones. Los artÃculos describen avances recientes en métodos y aplicaciones de búsqueda de vecindad variable. El capÃtulo "Búsqueda de vecindad variable reducida para la generación de datos circulares controlados" está disponible en acceso abierto bajo una licencia internacional Creative Commons Attribution 4.0 a través de link.springer.com. |
| Nota de contenido: |
Which are the most critical nodes in a network? A Basic Variable Neighborhood Search approach -- Variable Neighborhood Descent Branching applied to the Green Electric Vehicle Routing Problem with Time Window and Mixed Fleet -- A Variable Neighborhood Heuristic for Facility Locations in Fog Computing -- A GRASP/VND Heuristic for the Generalized Steiner Problem with Node-Connectivity Constraints and Hostile Reliability -- Max-Diversity Orthogonal Regrouping of MBA Students using a GRASP/VND Heuristic -- Scheduling in parallel machines with two servers: the restrictive case -- Reduced Variable Neighbourhood Search for the generation of controlled circular data -- Sequential and Parallel Scattered Variable Neighborhood Search for Solving Nurikabe -- A Hybrid VNS for the Multi-Product Maritime Inventory Routing Problem -- Simplicial vertex heuristic in solving the Railway arrival and departure paths assignment problem -- Scheduling of Patients in Emergency Departments with a Variable NeighborhoodSearch -- A GRASP/VND Heuristic for the Heterogeneous Fleet Vehicle Routing Problem with Time Windows -- Using K-means and Variable Neighborhood Search for Automatic Summarization of Scientific Articles -- BVNS approach for the Order Processing in Parallel Picking Workstations . |
| En lÃnea: |
https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] |
| Link: |
https://biblioteca.umanizales.edu.co/ils/opac_css/index.php?lvl=notice_display&i |
8th International Conference, ICVNS 2021, Abu Dhabi, United Arab Emirates, March 21–25, 2021, Proceedings [documento electrónico] / Mladenović, Nenad, ; Sleptchenko, Andrei, ; Sifaleras, Angelo, ; Omar, Mohammed, . - 1 ed. . - [s.l.] : Springer, 2021 . - X, 191 p. 66 ilustraciones, 26 ilustraciones en color. ISBN : 978-3-030-69625-2 Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos.
| Palabras clave: |
Informática Matemáticas discretas Algoritmos Matemáticas de la Computación Matemáticas discretas en informática Diseño y Análisis de Algoritmos |
| Ãndice Dewey: |
40.151 |
| Resumen: |
Este volumen constituye las actas de la 8.ª Conferencia Internacional sobre Búsqueda de Vecindad Variable, ICVNS 2021, celebrada en Abu Dhabi, Emiratos Ãrabes Unidos, en marzo de 2021. Los 14 artÃculos completos presentados en este volumen fueron cuidadosamente revisados ​​y seleccionados entre 27 presentaciones. Los artÃculos describen avances recientes en métodos y aplicaciones de búsqueda de vecindad variable. El capÃtulo "Búsqueda de vecindad variable reducida para la generación de datos circulares controlados" está disponible en acceso abierto bajo una licencia internacional Creative Commons Attribution 4.0 a través de link.springer.com. |
| Nota de contenido: |
Which are the most critical nodes in a network? A Basic Variable Neighborhood Search approach -- Variable Neighborhood Descent Branching applied to the Green Electric Vehicle Routing Problem with Time Window and Mixed Fleet -- A Variable Neighborhood Heuristic for Facility Locations in Fog Computing -- A GRASP/VND Heuristic for the Generalized Steiner Problem with Node-Connectivity Constraints and Hostile Reliability -- Max-Diversity Orthogonal Regrouping of MBA Students using a GRASP/VND Heuristic -- Scheduling in parallel machines with two servers: the restrictive case -- Reduced Variable Neighbourhood Search for the generation of controlled circular data -- Sequential and Parallel Scattered Variable Neighborhood Search for Solving Nurikabe -- A Hybrid VNS for the Multi-Product Maritime Inventory Routing Problem -- Simplicial vertex heuristic in solving the Railway arrival and departure paths assignment problem -- Scheduling of Patients in Emergency Departments with a Variable NeighborhoodSearch -- A GRASP/VND Heuristic for the Heterogeneous Fleet Vehicle Routing Problem with Time Windows -- Using K-means and Variable Neighborhood Search for Automatic Summarization of Scientific Articles -- BVNS approach for the Order Processing in Parallel Picking Workstations . |
| En lÃnea: |
https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] |
| Link: |
https://biblioteca.umanizales.edu.co/ils/opac_css/index.php?lvl=notice_display&i |
|  |
8th International Conference, ICVNS 2021, Abu Dhabi, United Arab Emirates, March 21–25, 2021, Proceedings
