Algorithm 797
Celso Carneiro Ribeiro, Maurício G. C. Resende · ACM Transactions on Mathematical Software · 1999
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.