Overview
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 12559)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Included in the following conference series:
Conference proceedings info: ICVNS 2021.
Buy print copy
About this book
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 springerlink.bibliotecabuap.elogim.com.
Similar content being viewed by others
Keywords
- algorithm engineering
- artificial intelligence
- combinatorial optimization
- communication systems
- computer networks
- genetic algorithms
- intelligent optimization methods
- network protocols
- signal processing
- simulated annealing
- tabu search
- telecommunication networks
- telecommunication systems
- telecommunication traffic
- variable neighborhood search
Table of contents (14 papers)
Other volumes
-
Variable Neighborhood Search
Editors and Affiliations
Bibliographic Information
Book Title: Variable Neighborhood Search
Book Subtitle: 8th International Conference, ICVNS 2021, Abu Dhabi, United Arab Emirates, March 21–25, 2021, Proceedings
Editors: Nenad Mladenovic, Andrei Sleptchenko, Angelo Sifaleras, Mohammed Omar
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-030-69625-2
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer Nature Switzerland AG 2021
Softcover ISBN: 978-3-030-69624-5Published: 18 February 2021
eBook ISBN: 978-3-030-69625-2Published: 15 March 2021
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: X, 191
Number of Illustrations: 40 b/w illustrations, 26 illustrations in colour
Topics: Mathematics of Computing, Discrete Mathematics in Computer Science, Algorithm Analysis and Problem Complexity