Optimizing Computer Networks Communication with the Band Collocation Problem: A Variable Neighborhood Search Approach
The Band Collocation Problem appears in the context of problems for optimizing telecommunication networks with the aim of solving some concerns related to the original Bandpass Problem and to present a more realistic approximation to be solved. This problem is interesting to optimize the cost of net...
Main Authors: | Isaac Lozano-Osorio, Jesus Sanchez-Oro, Miguel Ángel Rodriguez-Garcia, Abraham Duarte |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2020-11-01
|
Series: | Electronics |
Subjects: | |
Online Access: | https://www.mdpi.com/2079-9292/9/11/1860 |
Similar Items
-
Variable neighborhood search for maximum diverse grouping problem
by: Urošević Dragan
Published: (2014-01-01) -
Adaptation Of The Variable Neighborhood Search Heuristic To Solve The Vehicle Routing Problem
by: Arif Imran, et al.
Published: (2012-03-01) -
A new variable neighborhood search approach for solving dynamic memory allocation problem
by: Ivanović Marija, et al.
Published: (2018-01-01) -
Landscape properties of the very large-scale and the variable neighborhood search metaheuristics for the multidimensional assignment problem
by: Kammerdiner, A., et al.
Published: (2023) -
Data for a meta-analysis of the adaptive layer in adaptive large neighborhood search
by: Renata Turkeš, et al.
Published: (2020-12-01)