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; ORLibrary 
Referenced in:  5 Publications 
Standard Articles
1 Publication describing the Software, including 1 Publication in zbMATH  Year 

Algorithm 797: Fortran subroutines for approximate solution of graph planarization problems using GRASP. Zbl 0966.68161 Ribeiro, Celso C.; Resende, Mauricio G. C. 
1999

all
top 5
Referenced by 9 Authors
4  Ribeiro, Celso Carneiro 
2  Resende, Mauricio G. C. 
1  Aiex, Renata M. 
1  Cung, VanDat 
1  Martins, Simone L. 
1  Osman, Ibrahim Hassan 
1  Rosseti, Isabel 
1  Roucairol, Catherine 
1  Vallejos, Reinaldo 
Referenced in 4 Serials
1  ACM Transactions on Mathematical Software 
1  Journal of the Operational Research Society 
1  Journal of Global Optimization 
1  Journal of Heuristics 
Referenced in 2 Fields
4  Operations research, mathematical programming (90XX) 
3  Computer science (68XX) 