Algorithm 797

swMATH ID: 13176
Software Authors: Ribeiro, Celso C.; Resende, Mauricio G.C.
Description: Algorithm 797: Fortran subroutines for approximate solution of graph planarization problems using GRASP. We describe Fortran subroutines for finding approximate solutions of the maximum planar subgraph problem (graph planarization) using a Greedy Randomized Adaptive Search Procedure (GRASP). The design and implementation of the code are described in detail. Computational results with the subroutines illustrate the quality of solutions found as a function of number of GRASP iterations.
Homepage: http://dl.acm.org/citation.cfm?id=326147.326153
Keywords: greedy randomized adaptive search procedure; maximum planar subgraph problem
Related Software: Algorithm 787; GRASP; TTTPLOTS; GRASP_QAP; PERL; Algorithm 769; QAPLIB; MPI; PVM; OR-Library
Referenced in: 5 Publications

Referencing Publications by Year