Multiset graph partitioning
From MaRDI portal
Publication:1397035
DOI10.1007/s001860200173zbMath1031.90053OpenAlexW1992551373MaRDI QIDQ1397035
Yaroslav Krylyuk, William W. Hager
Publication date: 16 July 2003
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s001860200173
Programming involving graphs or networks (90C35) Quadratic programming (90C20) Combinatorial optimization (90C27)
Related Items (6)
An exact algorithm for graph partitioning ⋮ Multi-way clustering and biclustering by the ratio cut and normalized cut in graphs ⋮ Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization ⋮ Robust optimization of graph partitioning involving interval uncertainty ⋮ Linear and quadratic programming approaches for the general graph partitioning problem ⋮ Global convergence of SSM for minimizing a quadratic over a sphere
This page was built for publication: Multiset graph partitioning
