A general variable neighborhood search for the cyclic antibandwidth problem
Sign Up to like & getrecommendations! Published in 2022 at "Computational Optimization and Applications"
DOI: 10.1007/s10589-021-00334-y
Abstract: Graph Layout Problems refer to a family of optimization problems where the aim is to assign the vertices of an input graph to the vertices of a structured host graph, optimizing a certain objective function.… read more here.
Keywords: cyclic antibandwidth; neighborhood; antibandwidth problem; general variable ... See more keywords
General variable neighborhood search for the uncapacitated single allocation p-hub center problem
Sign Up to like & getrecommendations! Published in 2017 at "Optimization Letters"
DOI: 10.1007/s11590-016-1004-x
Abstract: In this paper we propose a general variable neighborhood search heuristic for solving the uncapacitated single allocation p-hub center problem (USApHCP). For the local search step we develop a nested variable neighborhood descent strategy. The… read more here.
Keywords: neighborhood; variable neighborhood; general variable; uncapacitated single ... See more keywords