Burer, Monteiro, and Zhang [2001] proposed a rank-2 relaxation heuristic for MAX-CUT and described a computer code, called circut, that produces better solutions in practice than the randomized algorithm of Goemans and Williamson [1995]. Their heuristic is based on continuous optimization and can be applied for solving any binary quadratic program. In this talk, we discuss on how to add path-relinking to circut as a way to intensify search around high-quality solutions produced by circut.

A randomized multistart rank-2 algorithm for Max-Cut

FESTA, PAOLA
2008

Abstract

Burer, Monteiro, and Zhang [2001] proposed a rank-2 relaxation heuristic for MAX-CUT and described a computer code, called circut, that produces better solutions in practice than the randomized algorithm of Goemans and Williamson [1995]. Their heuristic is based on continuous optimization and can be applied for solving any binary quadratic program. In this talk, we discuss on how to add path-relinking to circut as a way to intensify search around high-quality solutions produced by circut.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11588/395197
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact