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

被引：8
|
作者：
Ribeiro, C [1 ]
Resende, MGC
机构：
[1] Pontificia Univ Catolica Rio de Janeiro, Dept Comp Sci, BR-22453900 Rio De Janeiro, Brazil
[2] AT&T Labs Res, Florham Park, NJ 07932 USA
来源：
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE | 1999年 / 25卷 / 03期
关键词：
automatic graph drawing; combinatorial optimization; graph planarization; GRASP; local search;
D O I：
10.1145/326147.326153
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
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.
引用
收藏
页码：341 / 352
页数：12
相关论文
共 50 条
  • [1] Algorithm 787: Fortran subroutines for approximate solution of maximum independent set problems using GRASP
    Resende, MGC
    Feo, TA
    Smith, SH
    ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1998, 24 (04): : 386 - 394
  • [2] Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP
    Resende, MGC
    Pardalos, PM
    Li, Y
    ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1996, 22 (01): : 104 - 118
  • [3] Algorithm 769: Fortran subroutines for approximate solution of sparse quadratic assignment problems using GRASP
    Pardalos, PM
    Pitsoulis, LS
    Resende, MGC
    ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1997, 23 (02): : 196 - 208
  • [4] Remark on Algorithm 769: Fortran subroutines for approximate solution of sparse quadratic assignment problems using GRASP
    Hopkins, T
    ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 2003, 29 (03): : 349 - 351
  • [5] Algorithm 815: FORTRAN subroutines for computing approximate solutions of feedback set problems using GRASP
    Festa, P
    Pardalos, PM
    Resende, MGC
    ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 2001, 27 (04): : 456 - 464
  • [6] Remark on algorithm 815: FORTRAN subroutines for computing approximate solutions of feedback set problems using GRASP
    Hasselman, B
    ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 2006, 32 (01): : 166 - 168
  • [7] Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP
    Resende, MGC
    Pitsoulis, LS
    Pardalos, PM
    DISCRETE APPLIED MATHEMATICS, 2000, 100 (1-2) : 95 - 113
  • [8] ALGORITHM 728 - FORTRAN SUBROUTINES FOR GENERATING QUADRATIC BILEVEL PROGRAMMING TEST PROBLEMS
    CALAMAI, PH
    VICENTE, LN
    ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1994, 20 (01): : 120 - 123
  • [9] Algorithm 774: Fortran subroutines for generating box-constrained optimization problems
    Universita di Roma `La Sapienza', Rome, Italy
    ACM Trans Math Software, 3 (448-450):
  • [10] Algorithm 961: Fortran 77 Subroutines for the Solution of Skew-Hamiltonian/Hamiltonian Eigenproblems
    Benner, Peter
    Sima, Vasile
    Voigt, Matthias
    ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 2016, 42 (03):
12345