NDLI: An efficient simulated annealing algorithm for graph bisectioning

Content Provider	IEEE Xplore Digital Library
Author	Zhao, Y.C. Tao, L. Thulasiraman, K. Swamy, M.N.S.
Copyright Year	1991
Description	Author affiliation: Fac. of Eng. & Comput. Sci., Concordia Univ., Montreal, Que., Canada (Zhao, Y.C.; Tao, L.; Thulasiraman, K.; Swamy, M.N.S.)
Abstract	A new simulated annealing algorithm for solving the graph bisectioning problem is proposed. The authors run their simulated annealing algorithm, the Kernighan-Lin algorithm, and the Saab-Rao algorithms on the same set of random graphs with 50 to 500 nodes and compare their performances. Experiments show that their simulated annealing algorithm provides lower bisection cost than the Kernighan-Lin algorithm and the Saab-Rao algorithms for all of the graphs and their algorithm takes less running time than the other algorithms mentioned for all of the graphs with more than 100 nodes. For the simulated annealing approach, they conclude that sequential neighborhood search outperforms random neighborhood search in solving the graph bisectioning problem.<>
Starting Page	65
Ending Page	68
File Size	302926
Page Count	4
File Format	PDF
ISBN	0818621362
DOI	10.1109/SOAC.1991.143848
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1991-04-03
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Simulated annealing Costs Computational modeling Computer science Computer simulation Very large scale integration Routing Physics Temperature distribution
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

An efficient tabu search algorithm for graph bisectioning

A two-stage simulated annealing methodology

Simulated annealing-based channel routing on hypercube computers

An array optimization algorithm for VLSI layout

Best-so-far vs. where-you-are: New perspectives on simulated annealing for CAD

Simulated Annealing And Resource Location In Computer Networks

Improving the Performance of the Kernighan-Lin and Simulated Annealing Graph Bisection Algorithms

Zero skew clock routing with tree topology construction using simulated annealing method

An improved floor planning algorithm using topological constraint reduction

An efficient simulated annealing algorithm for graph bisectioning

Similar Documents

An efficient tabu search algorithm for graph bisectioning

A two-stage simulated annealing methodology

Simulated annealing-based channel routing on hypercube computers

An array optimization algorithm for VLSI layout

Best-so-far vs. where-you-are: New perspectives on simulated annealing for CAD

Simulated Annealing And Resource Location In Computer Networks

Improving the Performance of the Kernighan-Lin and Simulated Annealing Graph Bisection Algorithms

Zero skew clock routing with tree topology construction using simulated annealing method

An improved floor planning algorithm using topological constraint reduction

An efficient simulated annealing algorithm for graph bisectioning