New heuristic solution procedures for the uniform graph partitioning problem: Extensions and evaluation

DOI10.1016/0305-0548(94)90019-1zbMath0813.90123OpenAlexW2042932207MaRDI QIDQ1342107

Hasan Pirkul, Erik Rolland

Publication date: 11 January 1995

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(94)90019-1

zbMATH Keywords

VLSI designheuristicNP-completecomputer compiler designplacement and layout problemsuniform graph partitioning problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Neural networks for/in biological studies, artificial life and related topics (92B20)

Related Items

A user's guide to tabu search, New heuristic solution procedures for the uniform graph partitioning problem: Extensions and evaluation, Finding optimal solutions to the graph partitioning problem with heuristic search, Solution of large weighted equicut problems

Cites Work

• Unnamed Item
• Unnamed Item
• Some simplified NP-complete graph problems
• A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
• New heuristic solution procedures for the uniform graph partitioning problem: Extensions and evaluation
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• An Efficient Heuristic Procedure for Partitioning Graphs