| Alternate document: Details Semidefinite Programming Relaxations For The Quadratic Assignment Problem (98) Qing Zhao, Stefan E. Karisch, Franz Rendl, Henry |
Stefan E. Karisch, Franz Rendl  Home/Search
Context Related
| serv1.imm.dtu.dk/~sk/eqp_psd.ps imm.dtu.dk/documents/users...eqp_psd.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: serv1.imm.dtu.dk/~sk/ (more) From: imm.dtu.dk/documents/users/sk/ (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . Semidefinite relaxations are used to approximate the problem of partitioning a graph into equally sized components. The relaxations extend previous eigenvalue based models, and combine semidefinite and polyhedral approaches. Computational results on graphs with several hundred vertices are given, and indicate that semidefinite relaxations approximate the equipartition problem quite well. 1 Introduction Semidefinite Programming has turned out to be a powerful tool in the analysis of... (Update)
Context of citations to this paper: More
.... 0 1 programming problems is available [22, 13, 16] only few papers presenting computational experience are published so far [14, 18, 31, 30] (all are based on interior point codes) The bounds prove to be of good quality in practice, but implementations suffer from the...
.... Subsequent work extended the range of the dimensions of exactly solvable problem instances considerably, see [19] Karisch and Rendl [26] investigated semidefinite programming relaxations of graph equipartition problems. Their results were based on earlier work of Alizadeh...
Cited by: More
Semidefinite and Cone Programming Bibliography/Comments - Wolkowicz (2004) (Correct)
Cutting Plane Algorithms for Semidefinite Relaxations - Helmberg, Weismantel (1997) (Correct)
Semidefinite Programming and Combinatorial Optimization - Rendl (1998) (Correct)
Similar documents (at the sentence level):
63.3%: Semidefinite Programming and Graph Equipartition - Karisch, Rendl (1995) (Correct)
Active bibliography (related documents): More All
0.2: Graph Partitioning Algorithms With Applications To Scientific.. - Pothen (1997) (Correct)
0.1: Solving Graph Bisection Problems With Semidefinite Programming - Karisch, Rendl, CLAUSEN (1997) (Correct)
0.1: Semidefinite Programming for Assignment and Partitioning Problems - Zhao (1996) (Correct)
Similar documents based on text: More All
0.5: QAPLIB - A Quadratic Assignment Problem Library - Burkard, Karisch, Rendl (1996) (Correct)
0.4: Semidefinite Programming Relaxations For The.. - Zhao, Karisch.. (1998) (Correct)
0.3: CUTSDP - A Toolbox For A Cutting-Plane Approach Based On.. - Karisch (1998) (Correct)
Related documents from co-citation: More All
11: An interior-- point method for semidefinite programming - Helmberg, Rendl et al. - 1996
8: Interior point methods in semidefinite programming with applications to combinat.. - ALIZADEH - 1995
7: Improved approximation algorithms for MAX-k-CUT and MAX BISECTION - Frieze, Jerrum - 1996
BibTeX entry: (Update)
S.E. KARISCH and F. RENDL. Semidefinite programming and graph equipartition. In Topics in Semidefinite and Interior-Point Methods, volume 18 of The Fields Institute for Research in Mathematical Sciences, Communications Series, Providence, Rhode Island, 1998. American Mathematical Society. URL http://www.diku.dk/%7Ekarisch/rep302.ps. http://citeseer.ist.psu.edu/karisch98semidefinite.html More
@incollection{ karisch98semidefinite,
author = "S. E. Karisch and F. Rendl",
title = "Semidefinite Programming and Graph Equipartition",
booktitle = "Topics in Semidefinite and Interior-Point Methods",
volume = "18",
publisher = "AMS",
editor = "P. M. Pardalos and H. Wolkowicz",
pages = "77--95",
year = "1998",
url = "citeseer.ist.psu.edu/karisch98semidefinite.html" }
Citations (may not include all citations):371 Optimization by simulated annealing: an experimental evaluat.. (context) - Johnson, Aragon et al. - 1989
264 Combinatorial Algorithms for integrated Circuit Layout (context) - Lengauer - 1990
230 Interior point methods in semidefinite programming with appl.. - Alizadeh - 1995
173 An interior point method for Semidefinite Programming - Helmberg, Rendl et al. - 1996
173 An interior point method for semidefinite programming and ma.. - Helmberg - 1994
112 Improved approximation algorithms for max k-cut and max bise.. - Frieze, Jerrum - 1995
99 Approximate graph coloring by semidefinite programming - Karger, Motwani et al. - 1994
82 Lower bounds for the partitioning of graphs (context) - Donath, Hoffman - 1973
56 the Shannon capacity of a graph (context) - Lov'asz - 1979
49 Interior-point methods for the monotone linear complementari.. (context) - Kojima, Shindoh et al. - 1994
41 A projection technique for partitioning the nodes of a graph - --, Wolkowicz - 1995
35 Nonpolyhedral relaxations of graph bisection problems - Poljak, Rendl - 1995
34 A spectral technique for coloring random 3-colorable graphs - Alon, Kahale - 1994
26 A computational study of graph partitioning - Falkner, Rendl et al. - 1994
22 Connections between semidefinite relaxations of the max-cut .. - Laurent, Poljak et al. - 1995
20 the sum of the largest eigenvalues of a symmetric matrix (context) - Overton, Womersley - 1992
15 Nonlinear approaches for Quadratic Assignment and Graph Part.. (context) - Karisch - 1995
7 The partition problem (context) - Chopra, Rao - 1993
6 A genetic algorithm for a special class of the quadratic ass.. (context) - Bui, Moon - 1994
1 A branch-and-cut algorithm for the equicut problem (context) - University, Aviv et al. - 1994
1 An efficient heuristic procedure for partitioning graphs (context) - Thesis, of et al. - 1970
1 Some convexity theorems for matrices (context) - Program, Fillmore et al. - 1971
1 The equipartition polytope (context) - Conforti, Rao et al. - 1990
1 Combining semidefinite and polyhedral relaxations to integer.. (context) - thesis, of et al. - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://serv1.imm.dtu.dk/~sk/): More
QAPLIB - A Quadratic Assignment Problem Library - Burkard, Karisch, Rendl (1996) (Correct)
On the Applicability of Lower Bounds for Solving.. - Clausen, Karisch.. (1996) (Correct)
Solving Graph Bisection Problems With Semidefinite Programming - Karisch, Rendl, Clausen (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC