Logo of Humboldt-Universität zu BerlinLogo of Humboldt-Universität zu Berlin
edoc-Server
Open-Access-Publikationsserver der Humboldt-Universität
de|en
Header image: facade of Humboldt-Universität zu Berlin
View Item 
  • edoc-Server Home
  • Schriftenreihen und Sammelbände
  • Fakultäten und Institute der HU
  • Institut für Mathematik
  • Preprints aus dem Institut für Mathematik
  • View Item
  • edoc-Server Home
  • Schriftenreihen und Sammelbände
  • Fakultäten und Institute der HU
  • Institut für Mathematik
  • Preprints aus dem Institut für Mathematik
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.
All of edoc-ServerCommunity & CollectionTitleAuthorSubjectThis CollectionTitleAuthorSubject
PublishLoginRegisterHelp
StatisticsView Usage Statistics
All of edoc-ServerCommunity & CollectionTitleAuthorSubjectThis CollectionTitleAuthorSubject
PublishLoginRegisterHelp
StatisticsView Usage Statistics
View Item 
  • edoc-Server Home
  • Schriftenreihen und Sammelbände
  • Fakultäten und Institute der HU
  • Institut für Mathematik
  • Preprints aus dem Institut für Mathematik
  • View Item
  • edoc-Server Home
  • Schriftenreihen und Sammelbände
  • Fakultäten und Institute der HU
  • Institut für Mathematik
  • Preprints aus dem Institut für Mathematik
  • View Item
2002-05-28Buch DOI: 10.18452/2619
Lagrangian Smoothing Heuristics for Max-Cut
Alperin, Hernán
Nowak, Ivo
This paper presents smoothing heuristics for an NP-hard combinatorial problem based on Lagrangian relaxation. We formulate the Lagrangian dual for this nonconvex quadratic problem and propose eigenvalue nonsmooth unconstrained optimization to solve the dual problem with bundle or subgradient methods. Derived heuristics are considered to obtain good primal solutions through pathfollowing methods using a projected gradient algorithm. Starting points are drawn using several sampling techniques that use randomization and eigenvectors. The proposed method turns out to be competitive with the most recent ones. The idea presented here is generic and can be generalized, to all problems where convex Lagrangian relaxation can be applied. Furthermore, to the best of our knowledge, this is the first time that a Lagrangian heuristic is combined with pathfollowing techniques.
Files in this item
Thumbnail
6.pdf — Adobe PDF — 329.0 Kb
MD5: c3b1cddbc83ebb12d8de29b2d6f83a78
Cite
BibTeX
EndNote
RIS
InCopyright
Details
DINI-Zertifikat 2019OpenAIRE validatedORCID Consortium
Imprint Policy Contact Data Privacy Statement
A service of University Library and Computer and Media Service
© Humboldt-Universität zu Berlin
 
DOI
10.18452/2619
Permanent URL
https://doi.org/10.18452/2619
HTML
<a href="https://doi.org/10.18452/2619">https://doi.org/10.18452/2619</a>