Min-cut clustering-Reference-Cited by-同舟云学术

Min-cut clustering

Published:1993-02 Issue:1-3 Volume:62 Page:133-151
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Mathematical Programming

Author:

Johnson Ellis L.,Mehrotra Anuj,Nemhauser George L.

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01585164.pdf

Reference16 articles.

1. F. Barahona and R. Majhoub, “On the cut polytope,”Mathematical Programming 36 (1986) 157–173.

2. S. Chopra, “The graph partitioning polytope on series-parallel and 4-wheel free graphs,” J.L. Kellogg Graduate School of Management, Northwestern University (Evanston, IL, 1991).

3. S. Chopra and M.R. Rao, “The partition problem,” J.L. Kellogg Graduate School of Management, Northwestern University (Evanston, IL, 1990).

4. S. Chopra and M.R. Rao, “Facets of thek-partition polytope,” J.L. Kellogg Graduate School of Management, Northwestern University (Evanston, IL, 1991).

5. M. Conforti, M.R. Rao and A. Sassano, “The equipartition polytope. I: Formulations, dimension and basic facets,”Mathematical Programming 49 (1990) 49–70.

Cited by 167 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Proximity guarantees of a lift-and-project approach for the cardinality-constrained Boolean quadric polytope;Operations Research Letters;2024-11

2. Solving continuous quadratic programming for the discrete balanced graph partitioning problem using simulated annealing algorithm hybridized local search and multi-start algorithms;Applied Soft Computing;2024-11

3. A bisection method for solving distance-based clustering problems globally;TOP;2024-09-11

4. Parameter-Insensitive Min Cut Clustering With Flexible Size Constrains;IEEE Transactions on Pattern Analysis and Machine Intelligence;2024-08

5. Limiting Computation Levels in Prioritized Trajectory Planning with Safety Guarantees;2024 European Control Conference (ECC);2024-06-25