A modified VNS metaheuristic for max-bisection problems (Q939544)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A modified VNS metaheuristic for max-bisection problems |
scientific article; zbMATH DE number 5315409
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A modified VNS metaheuristic for max-bisection problems |
scientific article; zbMATH DE number 5315409 |
Statements
A modified VNS metaheuristic for max-bisection problems (English)
0 references
22 August 2008
0 references
The authors design a variable neighborhood search metaheuristic to solve max-bisection problems. The max-bisection problem is transferred into an equivalent quadratic optimization problem which has the same feasible region as the max-cut problem. Then the modified variable neighborhood search metaheuristic by using a distinct local search is applied to solve the optimization problem. Some numerical experimental results are presented by comparing the proposed method to an existing approximate algorithm.
0 references
combinatorial optimization
0 references
max-bisection problem
0 references
max-cut problem
0 references
variable neighborhood search
0 references
heuristic method
0 references
local search
0 references
0 references
0 references
0.8757672
0 references
0.86805207
0 references
0.8655348
0 references
0.8618499
0 references
0.8504782
0 references
0.8459589
0 references
