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 条
  • [31] PMPSO: A Near-Optimal Graph Planarization Algorithm using Probability Model based Particle Swarm Optimization
    Yu, Hang
    Xu, Zhe
    Gao, Shangce
    Wang, Yirui
    Todo, Yuki
    PROCEEDINGS OF 2015 IEEE INTERNATIONAL CONFERENCE ON PROGRESS IN INFORMATCS AND COMPUTING (IEEE PIC), 2015, : 15 - 19
  • [32] Solution of Fractional Programming Problems Using PSO Algorithm
    Pal, Ashok
    Singh, S. B.
    Deep, Kusum
    PROCEEDINGS OF THE 2013 3RD IEEE INTERNATIONAL ADVANCE COMPUTING CONFERENCE (IACC), 2013, : 1060 - 1064
  • [33] Approximate Solution using Machine Learning and Evolutionary Algorithm for Large-Scale Data-Driven Chance Constrained Problems
    Tagawa, Kiyoharu
    2022 JOINT 12TH INTERNATIONAL CONFERENCE ON SOFT COMPUTING AND INTELLIGENT SYSTEMS AND 23RD INTERNATIONAL SYMPOSIUM ON ADVANCED INTELLIGENT SYSTEMS (SCIS&ISIS), 2022,
  • [34] On Flood Algorithm for Approximate Solution of Smooth Nonlinear Programming Problems with Linear Constraints of Large Dimension
    Volodina, E. E.
    Livchits, V. N.
    EKONOMIKA I MATEMATICESKIE METODY-ECONOMICS AND MATHEMATICAL METHODS, 2019, 55 (04): : 78 - 88
  • [35] AN APPROXIMATE SOLUTION TO GRAVITY INVERSION PROBLEMS USING THE NEWTON-KANTOROVICH METHOD
    BOYKLOV, IV
    SHCHUKINA, VE
    IZVESTIYA AKADEMII NAUK SSSR FIZIKA ZEMLI, 1989, (11): : 67 - 78
  • [36] A Tabu Search Based Approximate Solution Algorithm for k-minimum Spanning Tree Problems
    Katagiri, Hideki
    Nishizaki, Ichiro
    Hayashida, Tomohiro
    Ishimatsu, Jun
    IMECS 2009: INTERNATIONAL MULTI-CONFERENCE OF ENGINEERS AND COMPUTER SCIENTISTS, VOLS I AND II, 2009, : 2026 - 2031
  • [37] A solution to linear estimation problems using approximate Karhunen-Loeve expansions
    Navarro-Moreno, J
    Ruiz-Molina, JC
    Valderrama, MJ
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (04) : 1677 - 1682
  • [38] Approximate solution of KdV-Burgers equation using improved PINNs algorithm
    Kumar, Harender
    Yadav, Neha
    INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS, 2024,
  • [39] Optimal Solution of MINLP Problems Using Modified Genetic Algorithm
    Danish, Mohd.
    Kumar, Surendra
    Qamareen, Arees
    Kumar, Shashi
    CHEMICAL PRODUCT AND PROCESS MODELING, 2006, 1 (01):
  • [40] Solution of Optimization Problems in Fuzzy Background Using HVPSO Algorithm
    Pal, Ashok
    Deep, Kusum
    Singh, S. B.
    SOFT COMPUTING FOR PROBLEM SOLVING, 2019, 817 : 495 - 508
12345