CUTSDP

A Toolbox for a Cutting-Plane Approach Based on Semidefinite Programming (C) (Source: http://plato.asu.edu)

References in zbMATH (referenced in 2 articles )

Showing results 1 to 2 of 2.
Sorted by year (citations)

  1. Sensen, Norbert: Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows (2001)
  2. Karisch, Stefan E.: Nonlinear approaches for quadratic assignment and graph partition problems (1995)