Vai al contenuto principale della pagina

Variable Neighborhood Search [[electronic resource] ] : 8th International Conference, ICVNS 2021, Abu Dhabi, United Arab Emirates, March 21–25, 2021, Proceedings / / edited by Nenad Mladenovic, Andrei Sleptchenko, Angelo Sifaleras, Mohammed Omar



(Visualizza in formato marc)    (Visualizza in BIBFRAME)

Titolo: Variable Neighborhood Search [[electronic resource] ] : 8th International Conference, ICVNS 2021, Abu Dhabi, United Arab Emirates, March 21–25, 2021, Proceedings / / edited by Nenad Mladenovic, Andrei Sleptchenko, Angelo Sifaleras, Mohammed Omar Visualizza cluster
Pubblicazione: Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021
Edizione: 1st ed. 2021.
Descrizione fisica: 1 online resource (X, 191 p. 66 illus., 26 illus. in color.)
Disciplina: 519.64
Soggetto topico: Computer science—Mathematics
Discrete mathematics
Algorithms
Mathematics of Computing
Discrete Mathematics in Computer Science
Design and Analysis of Algorithms
Persona (resp. second.): MladenovićNenad
Nota di bibliografia: Includes bibliographical references and index.
Nota di contenuto: 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 Neighborhood Search -- 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 .
Sommario/riassunto: This volume constitutes the proceedings of the 8th International Conference on Variable Neighborhood Search, ICVNS 2021, held in Abu Dhabi, United Arab Emirates, in March 2021. The 14 full papers presented in this volume were carefully reviewed and selected from 27 submissions. The papers describe recent advances in methods and applications of variable neighborhood search. Chapter “Reduced Variable Neighbourhood Search for the Generation of Controlled Circular Data” is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.
Titolo autorizzato: Variable neighborhood search  Visualizza cluster
ISBN: 3-030-69625-1
Formato: Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione: Inglese
Record Nr.: 9910483960303321
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Serie: Theoretical Computer Science and General Issues, . 2512-2029 ; ; 12559