Cantitate/Preț
Produs
Total produse
Vezi coșul
Variable Neighborhood Search de Nenad Mladenović

Variable Neighborhood Search: Lecture Notes in Computer Science, cartea 12559

Editat de Nenad Mladenović, Andrei Sleptchenko, Angelo Sifaleras, Mohammed Omar
en Limba Engleză Paperback – 18 feb 2021
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.

Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 37213 lei

Preț vechi: 46516 lei
-20%

Puncte Express: 558

Carte tipărită la comandă

Livrare economică 10-24 august

Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 40000 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783030696245
ISBN-10: 3030696243
Pagini: 204
Ilustrații: X, 191 p. 66 illus., 26 illus. in color.
Dimensiuni: 155 x 235 x 12 mm
Greutate: 0.32 kg
Ediția:1st edition 2021
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

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 .