Algorithm 797: Fortran subroutines for approximate solution of graph planarization problems using GRASP

Authors
Ribeiro, C Resende, MGC
Citation
C. Ribeiro et Mgc. Resende, Algorithm 797: Fortran subroutines for approximate solution of graph planarization problems using GRASP, ACM T MATH, 25(3), 1999, pp. 341-352
Citations number
14
Categorie Soggetti
Computer Science & Engineering
Journal title
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE
ISSN journal
00983500 → ACNP
Volume
25
Issue
3
Year of publication
1999
Pages
341 - 352
Database
ISI
SICI code
0098-3500(199909)25:3<341:A7FSFA>2.0.ZU;2-I
Abstract
We describe Fortran subroutines for finding approximate solutions of the ma ximum planar subgraph problem (graph planarization) using a Greedy Randomiz ed Adaptive Search Procedure (GRASP). The design and implementation of the code are described in detail. Computational results with the subroutines il lustrate the quality of solutions found as a function of number of GRASP it erations.