Can I read Multistart search for the Cyclic Cutwidth Minimization Problem on EtoBox?

Multistart search for the Cyclic Cutwidth Minimization Problem by Cavero, Sergio; Pardo, Eduardo G.; Laguna, Manuel; Duarte, Abraham is a Engineering article available to read on EtoBox.

What is Multistart search for the Cyclic Cutwidth Minimization Problem about?

The Cyclic Cutwidth Minimization Problem (CCMP) is a Graph Layout Problem that consists of finding an embedding of the vertices of a candidate graph in a host graph, in order to minimize the maximum cut of a host edge. In this case, the host graph is restricted to be a cycle. In this paper, we identify a new lower bound for the problem, and also a property which allows search procedures to drastically reduce the neighborhood size during the search. Additionally, we propose the use of an alternative objective function for min-max optimization problems, never used before in the context of the CCMP. These strategies have been combined within a multistart search procedure for this problem. The obtained method is compared with the state of the art for the CCMP using sets of problem instances previously published. Statistical tests indicate the merit of our proposal.

Who reads Multistart search for the Cyclic Cutwidth Minimization Problem?

Author

Cavero, Sergio; Pardo, Eduardo G.; Laguna, Manuel; Duarte, Abraham

Publisher

Elsevier Science; Elsevier ; Elsevier Ltd.; Elsevier BV (ISSN 0305-0548)

Published

2021

Language

EN

Field

Engineering (Physical Sciences)