LEADER 04015nam  22006015  450 
001 996464392303316
005 20230329232456.0
010   $a3-030-69625-1
024 7 $a10.1007/978-3-030-69625-2
035   $a(CKB)4100000011797683
035   $a(DE-He213)978-3-030-69625-2
035   $a(MiAaPQ)EBC6519257
035   $a(Au-PeEL)EBL6519257
035   $a(OCoLC)1243545920
035   $a(PPN)254719015
035   $a(EXLCZ)994100000011797683
100   $a20210217d2021      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aVariable Neighborhood Search$b[electronic resource] $e8th International Conference, ICVNS 2021, Abu Dhabi, United Arab Emirates, March 21?25, 2021, Proceedings /$fedited by Nenad Mladenovic, Andrei Sleptchenko, Angelo Sifaleras, Mohammed Omar
205   $a1st ed. 2021.
210  1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2021.
215   $a1 online resource (X, 191 p. 66 illus., 26 illus. in color.) 
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12559
311   $a3-030-69624-3 
320   $aIncludes bibliographical references and index.
327   $aWhich 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 .
330   $aThis 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.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12559
606   $aComputer science?Mathematics
606   $aDiscrete mathematics
606   $aAlgorithms
606   $aMathematics of Computing
606   $aDiscrete Mathematics in Computer Science
606   $aDesign and Analysis of Algorithms
615  0$aComputer science?Mathematics.
615  0$aDiscrete mathematics.
615  0$aAlgorithms.
615 14$aMathematics of Computing.
615 24$aDiscrete Mathematics in Computer Science.
615 24$aDesign and Analysis of Algorithms.
676   $a519.64
702   $aMladenovic?$b Nenad
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a996464392303316
996   $aVariable neighborhood search$91902308
997   $aUNISA