|
771
|
An efficient heuristic procedure for partitioning graphs, The Bell Syst
– Kernighan, Lin
- 1970
|
|
574
|
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
– Goemans, Williamson
- 1995
|
|
436
|
Optimization by Simulated Annealing: An Experimental Evaluation
– Johnson, Aragon, et al.
- 1991
|
|
405
|
Interior point methods in semidefinite programming with applications to combinatorial optimization
– Alizadeh
- 1995
|
|
364
|
Combinatorical algorithms for integrated circuit layout. Applicable Theory
– Lengauer
- 1990
|
|
177
|
An interior-point method for semidefinite programming
– HELMBERG, RENDL, et al.
- 1996
|
|
131
|
Approximate Graph Coloring by Semidefinite Programming
– Karger, Motwani, et al.
- 1994
|
|
121
|
Improved approximation algorithms for max k-cut and max bisection
– Frieze, Jerrum
- 1995
|
|
113
|
Lower bounds for the partitioning of graphs
– Donath, Hoffman
- 1973
|
|
56
|
A spectral technique for coloring random 3colorable graphs
– Alon, Kahale
- 1997
|
|
55
|
Interior-point methods for the monotone linear complementarityproblem in symmetric matrices
– Kom, SHINDOH, et al.
- 1994
|
|
50
|
A projection technique for partitioning the nodes of a graph
– RENDL, WOLKOWICZ
- 1995
|
|
45
|
Genetic Algorithm and Graph Partitioning
– Bui, Moon
- 1996
|
|
41
|
Rendl: Nonpolyhedral relaxations of graph-bisection problems
– Poljak, F
- 1992
|
|
34
|
A computational study of graph partitioning
– Falkner, Rendl, et al.
- 1994
|
|
25
|
On the sum of the largest eigenvalues of a symmetric matrix
– Overton, Womersley
- 1992
|
|
24
|
The partition problem
– Chopra, Rao
- 1993
|
|
21
|
Connections between semidefinite relaxations of the max-cut and stable set problems
– Laurent, Poljak, et al.
- 1997
|
|
19
|
Combining semidefinite and polyhedral relaxations for integer programs
– Helmberg, Poljak, et al.
- 1995
|
|
18
|
Nonlinear Approaches for Quadratic Assignment and Graph Partition Problems
– KARISCH
- 1995
|
|
16
|
Positive Definite Programming
– Vandenberghe, Boyd
- 1994
|
|
14
|
Some convexity theorems for matrices
– FILLMORE, WILLIAMS
- 1971
|
|
13
|
ASZ. On the Shannon capacity of a graph
– Lov
- 1979
|
|
11
|
A branch-and-cut algorithm for the equicut problem
– Brunetta, Conforti, et al.
- 1997
|
|
9
|
A Genetic Algorithm for a Special Class of the Quadratic Assignment Problem
– Bui, Moon
- 1994
|
|
6
|
Approximating the independence number via the Theta function
– Alon, Kahale
- 1998
|
|
3
|
The equipartition polytope
– Conforti, Rao, et al.
- 1990
|
|
