A modified VNS metaheuristic for max-bisection problems (Q939544): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.cam.2007.08.018 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1975241577 / rank | |||
Normal rank | |||
Revision as of 20:16, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A modified VNS metaheuristic for max-bisection problems |
scientific article |
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
