Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search
نویسندگان
چکیده
منابع مشابه
Variable Neighborhood Decomposition Search
The recent Variable Neighborhood Search (VNS) metaheuristic combines local search with systematic changes of neighborhood in the descent and escape from local optimum phases. When solving large instances of various problems, its efficiency may be enhanced through decomposition. The resulting two level VNS, called Variable Neighborhood Decomposition Search (VNDS), is presented and illustrated on...
متن کاملFacets of the minimum-adjacency vertex coloring polytope
A wireless network employs some portion of the electromagnetic spectrum to establish communications between the transmitter/receiver network antennas, called TRXs. A certain part of the electromagnetic spectrum is licensed to the company operating the network and is divided into discrete channels. Each TRX must operate through one channel, although whenever two TRXs overlap their coverage areas...
متن کاملVariable neighborhood search for the Vertex Separation Problem
The vertex separation problem belongs to a family of optimization problems in which the objective is to nd the best separator of vertices or edges in a generic graph. This optimization problem is strongly related to other well-known graph problems; such as the Path-Width, the Node Search Number or the Interval Thickness, among others. All of these optimization problems are NP-hard and have prac...
متن کاملoptimization of high-performance concrete structures by variable neighborhood search
this paper describes a methodology in designing high-performance concrete for simply supported beams, using a hybrid optimization strategy based on a variable neighborhood search threshold acceptance algorithm. three strategies have been applied to discrete optimization of reinforced concrete beams: variable neighborhood descent (vnd), reduced neighborhood search (rns) and basic variable neighb...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Optimization
سال: 2020
ISSN: 1382-6905,1573-2886
DOI: 10.1007/s10878-020-00652-7