Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building
heuristics, based upon systematic changes of neighbourhoods both in descent phase, to …

Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building
heuristics, based upon systematic changes of neighbourhoods both in descent phase, to …

Given an undirected graph G=(V, E) with weights on the edges, the max-bisection problem
(MBP) is to find a partition of the vertex set V into two subsets V1 and V2 of equal cardinality …

Given an edge weighted graph G=(V, E), the maximum bisection problem involves
partitioning the vertices of V into two disjoint subsets of equal cardinality such that the weight …

The max-bisection problem consists in partitioning the vertices of a weighted undirected
graph into two equally sized subsets so as to maximize the sum of the weights of crossing …

The maximum bisection problem (max-bisection) belongs to a family of well-known graph
partitioning problems with wide applications. In this study, we develop a simple and efficient …

Max-bisection of a weighted graph G=(V, E) is to partition the vertex set V into two subsets
that have equal cardinality, such that the sum of the weights of the edges connecting vertices …

Abstract The Maximum Bisection Problem (MBP) is a well-known combinatorial optimization
problem that has been proven to be NP-hard. The maximum bisection of a graph is the …

The quadratic unconstrained binary optimization (QUBO) problem is categorized as an NP-
hard combinatorial optimization problem. The variable neighborhood search (VNS) …

为更好地解决最大二等分问题, 提出了一种求解该问题的混合二进制人工蜂群算法. 首先,
针对传统人工蜂群算法不能解决离散问题的缺陷, 根据最大二等分问题的特点 …