Pages that link to "Item:Q1340061"
From MaRDI portal
The following pages link to A computational study of graph partitioning (Q1340061):
Displayed 16 items.
- Orbitopal fixing (Q408377) (← links)
- Semidefinite approximations for quadratic programs over orthogonal matrices (Q609564) (← links)
- The MIN-cut and vertex separator problem (Q683339) (← links)
- Spectral partitioning with multiple eigenvectors (Q1276952) (← links)
- An optimal tree search method for the manufacturing systems cell formation problem (Q1291773) (← links)
- Spectral methods for graph bisection problems. (Q1406654) (← links)
- Algorithms for graph partitioning problems by means of eigenspace relaxations (Q1577115) (← links)
- A projection technique for partitioning the nodes of a graph (Q1904714) (← links)
- An exact algorithm for graph partitioning (Q1942271) (← links)
- Semidefinite programming relaxations for the graph partitioning problem (Q1961466) (← links)
- Spectral bounds for graph partitioning with prescribed partition sizes (Q2328109) (← links)
- Semidefinite programming and eigenvalue bounds for the graph partition problem (Q2349129) (← links)
- Un Algorithme pour la Bipartition d'un Graphe en Sous-graphes de Cardinalité Fixée (Q4546064) (← links)
- (Q5111755) (← links)
- Semidefinite programming and combinatorial optimization (Q5906394) (← links)
- Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem (Q5963676) (← links)