000 04339nam a22005775i 4500
001 978-3-030-69625-2
003 DE-He213
005 20240730170850.0
007 cr nn 008mamaa
008 210217s2021 sz | s |||| 0|eng d
020 _a9783030696252
_9978-3-030-69625-2
024 7 _a10.1007/978-3-030-69625-2
_2doi
050 4 _aQA76.9.M35
072 7 _aUYAM
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYAM
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aVariable Neighborhood Search
_h[electronic resource] :
_b8th International Conference, ICVNS 2021, Abu Dhabi, United Arab Emirates, March 21-25, 2021, Proceedings /
_cedited by Nenad Mladenovic, Andrei Sleptchenko, Angelo Sifaleras, Mohammed Omar.
250 _a1st ed. 2021.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2021.
300 _aX, 191 p. 66 illus., 26 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v12559
505 0 _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 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 .
520 _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.
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aAlgorithms.
_93390
650 1 4 _aMathematics of Computing.
_931875
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aDesign and Analysis of Algorithms.
_931835
700 1 _aMladenovic, Nenad.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_995860
700 1 _aSleptchenko, Andrei.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_995861
700 1 _aSifaleras, Angelo.
_eeditor.
_0(orcid)
_10000-0002-5696-7021
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_995862
700 1 _aOmar, Mohammed.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_995864
710 2 _aSpringerLink (Online service)
_995865
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783030696245
776 0 8 _iPrinted edition:
_z9783030696269
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v12559
_995866
856 4 0 _uhttps://doi.org/10.1007/978-3-030-69625-2
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c87232
_d87232