The node capacitated graph partitioning problem: A computational study

Optimization by Simulated Annealing

Scott Kirkpatrick, C. D. Gelatt, M.P. Vecchi · Science · 1983 · 44.6K citations

Natural Sciences, Mathematics, Algorithms +10

An Efficient Heuristic Procedure for Partitioning Graphs

Brian W. Kernighan, Shang Min Lin · Bell System Technical Journal · 1970 · 5.3K citations

Computing, Computer Science, Electrical Engineering +17

Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning

David S. Johnson, C. Aragon, Lyle A. McGeoch et al. · Operations Research · 1989 · 1.5K citations

Computing, Computer Science, Algorithms +13

A Linear-Time Heuristic for Improving Network Partitions

Charles M. Fiduccia, R. M. Mattheyses · 19th Design Automation Conference · 1982 · 1.3K citations

Computing, Computer Science, Computer Systems +9

A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems

Manfred Padberg, Giovanni Rinaldi · SIAM Review · 1991 · 1.1K citations

Computing, Computer Science, Algorithms +16