LEADER 03353nam  22006255  450 
001 9910728395403321
005 20230528072424.0
010   $a3-031-34500-2
024 7 $a10.1007/978-3-031-34500-5
035   $a(MiAaPQ)EBC30553697
035   $a(Au-PeEL)EBL30553697
035   $a(OCoLC)1380758428
035   $a(DE-He213)978-3-031-34500-5
035   $a(BIP)091528290
035   $a(PPN)270612491
035   $a(EXLCZ)9926795829700041
100   $a20230528d2023      u|             0
101 0 $aeng
135   $aurcnu||||||||
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aVariable Neighborhood Search$b[electronic resource] $e9th International Conference, ICVNS 2022, Abu Dhabi, United Arab Emirates, October 25?28, 2022, Revised Selected Papers /$fedited by Andrei Sleptchenko, Angelo Sifaleras, Pierre Hansen
205   $a1st ed. 2023.
210  1$aCham :$cSpringer Nature Switzerland :$cImprint: Springer,$d2023.
215   $a1 online resource (159 pages)
225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v13863
311 08$aPrint version: Sleptchenko, Andrei Variable Neighborhood Search Cham : Springer,c2023 9783031344992 
327   $aA metaheuristic approach for solving Monitor Placement Problem -- A VNS-based heuristic for the minimum number of resources under a perfect schedule -- BVNS for Overlapping Community Detection -- A Simulation-Based Variable Neighborhood Search Approach for Optimizing Cross-Training Policies -- Multi-Objective Variable Neighborhood Search for improving software modularity -- An Effective VNS for Delivery Districting -- BVNS for the Minimum Sitting Arrangement problem in a cycle -- Assigning Multi-Skill Confgurations to Multiple Servers with a Reduced VNS -- Multi-Round Infuence Maximization: A Variable Neighborhood Search Approach -- A VNS based heuristic for a 2D Open Dimension Problem -- BVNS for the bi-objective multi row equal facility layout problem.
330   $aThis volume constitutes the proceedings of the 9th International Conference on Variable Neighborhood Search, ICVNS 2023, held in Abu Dhabi, United Arab Emirates, in October 2022. The 11 full papers presented in this volume were carefully reviewed and selected from 29 submissions. The papers describe recent advances in methods and applications of variable neighborhood search.
410  0$aLecture Notes in Computer Science,$x1611-3349 ;$v13863
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
610   $aMathematics
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.3
700   $aSleptchenko$b Andrei$01358935
701   $aSifaleras$b Angelo$01358936
701   $aHansen$b Pierre$0104398
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910728395403321
996   $aVariable Neighborhood Search$93371746
997   $aUNINA