Christoph Helmberg, Franz Rendl  Home/Search
Context
Related
| zib.de/pub/zibpublicat...SC9535.ps.Z 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: zib.de/helmberg/semidef (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present computational experiments for solving quadratic (0; 1) problems. Our approach combines a semidefinite relaxation with a cutting plane technique, and is applied in a Branch and Bound setting. Our experiments indicate that this type of approach is very robust, and allows to solve many moderately sized problems, having say, less than 100 binary variables, in a routine manner. Key words: quadratic (0,1)-programming, max-cut problem, semidefinite program, Branch and Bound. 1 Quadratic... (Update)
Active bibliography (related documents): More All
1.5: Node and Edge Relaxations of the Max-Cut Problem - Poljak, Rendl (1994) (Correct)
1.2: Heuristic Algorithms for the Unconstrained Binary Quadratic.. - Beasley (1998) (Correct)
0.8: Fixing Variables in Semidefinite Relaxations - Helmberg (1996) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.4: A Spectral Bundle Method for Semidefinite Programming - Helmberg, Rendl (1997) (Correct)
0.3: SBmethod - A C++ Implementation of the Spectral Bundle Method.. - Helmberg (2000) (Correct)
0.3: A Spectral Bundle Method with Bounds - Helmberg, Kiwiel (1999) (Correct)
BibTeX entry: (Update)
@misc{ helmberg-solving,
author = "Christoph Helmberg and Franz Rendl",
title = "Solving Quadratic (0,1)-Problems by Semidefinite Programs and Cutting Planes",
url = "citeseer.ist.psu.edu/helmberg95solving.html" }
Citations (may not include all citations):264 Combinatorial Algorithms for Integrated Circuit Layout (context) - LENGAUER - 1990
173 An interior point method for semidefinite programming and ma.. - HELMBERG - 1994
173 An interior point method for Semidefinite Programming - HELMBERG, RENDL et al.
106 Approximation algorithms for Max-Cut and Max 2SAT (context) - GOEMANS, WILLIAMSON - 1994
46 Laplacian eigenvalues and the maximum cut problem (context) - DELORME, POLJAK - 1993
35 Nonpolyhedral Relaxations of Graph Bisection Problems - POLJAK, RENDL - 1995
23 Solving the Max-Cut Problem using Eigenvalues (context) - POLJAK, RENDL - 1995
21 The max-cut problem in graphs not contractible to K (context) - BARAHONA - 1983
18 Computational aspects of a branch and bound algorithm for qu.. (context) - PARDALOS, RODGERS - 1990
17 Combining Semidefinite and Polyhedral Relaxations for Intege.. - HELMBERG, POLJAK et al. - 1995
15 The Max-Cut Problem - A Survey (context) - POLJAK, TUZA - 1994
12 The metric polytope (context) - LAURENT, POLJAK - 1992
11 a positive Semidefinite relaxation of the Cut Polytope - LAURENT, POLJAK - 1995
11 The cut polytope and the Boolean quadric polytope (context) - De SIMONE - 1989
10 complementation and persistency in quadratic 0-1 optimizatio.. (context) - HAMMER, HANSEN et al. - 1984
10 The hypermetric cone is polyhedral (context) - DEZA, GRISHUCHIN et al. - 1993
8 personal communication (context) - SCHRIJVER - 1992
8 Eigenvalues and the max-cut problem (context) - MOHAR, POLJAK - 1990
8 Experiments in quadratic 0-1 programming (context) - BARAHONA, UNGER et al. - 1989
8 Parallel Branch and Bound algorithms for quadratic zero-one .. (context) - PARDALOS, RODGERS - 1990
5 The indefinite Zero-One quadratic problem (context) - CARTER - 1984
5 A cutting plane algorithm for the max-cut problem (context) - De SIMONE, RINALDI - 1992
5 Exact ground states of ising spin glasses: new experimental .. - De SIMONE, DIEHL et al. - 1994
5 Node and Edge Relaxations of the Max-Cut Problem - POLJAK, RENDL - 1994
4 the expected relative error of the polyhedral approximation .. (context) - POLJAK, TUZA - 1994
4 Chv'atal cuts and odd cycle inequalities in quadratic 0-1 op.. (context) - BOROS, CRAMA et al. - 1992
4 Polyhedral and eigenvalue approximations of the max-cut prob.. (context) - POLJAK - 1992
3 Ground-State magnetization of Ising spin glasses (context) - BARAHONA - 1994
2 Quadratic 0-1 Programming using the Roof dual with computati.. (context) - WILLIAMS - 1985
2 An algorithm for quadratic zero-one programs (context) - KALANTARI, BAGCHI - 1990
2 Max mean cuts and max cuts (context) - BARAHONA, TITAN - 1991
2 The max-cut problem and quadratic 0-1 optimization; polyhedr.. (context) - BOROS, HAMMER - 1991
2 Cut Polyhedra and Metrics (context) - DEZA, LAURENT
1 An efficient Branch and Bound Algorithm to solve Quadratic I.. (context) - ORNER - 1983
1 Complexity of a max cut approximation (context) - DELORME, POLJAK - 1993
1 The DDT method for quadratic 0-1 minimization (context) - BOROS, HAMMER et al. - 1989
1 boolean quadric polytopes and nonnegative pseudo-boolean fun.. (context) - BOROS, HAMMER - 1993
1 to appear in Computational and Applied Mathematics (context) - DEZA, LAURENT et al. - 1992
1 An interior point algorithm for solving max-cut problems (context) - BURKARD - 1994
Documents on the same site (http://www.zib.de/helmberg/semidef.html): More
The Lovasz Theta Function and a Semidefinite Programming.. - Kleinberg, Goemans (1995) (Correct)
Global and Local Convergence of Predictor-Corrector.. - Kojima, Shida, Shindoh (1995) (Correct)
A Predictor-Corrector Interior-Point Algorithm for the.. - Kojima, Shida, Shindoh (1996) (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