We propose FORTRAN subroutines for approximately solving the feedback vertex and arc set problems on directed graphs using a Greedy Randomized Adaptive Search Procedure (GRASP). Implementation and usage of the package is outlined and computational experiments are reported illustrating solution quality as a function of running time.
Algorithm 815: Fortran subroutines for computing approximate solutions of feedback set problems using GRASP / Festa, Paola; P. M., Pardalos; M. G. C., Resende. - In: ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE. - ISSN 0098-3500. - 27:4(2001), pp. 456-464. [10.1145/504210.504214]
Algorithm 815: Fortran subroutines for computing approximate solutions of feedback set problems using GRASP
FESTA, PAOLA;
2001
Abstract
We propose FORTRAN subroutines for approximately solving the feedback vertex and arc set problems on directed graphs using a Greedy Randomized Adaptive Search Procedure (GRASP). Implementation and usage of the package is outlined and computational experiments are reported illustrating solution quality as a function of running time.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
a5_alg815_fsp.pdf
non disponibili
Tipologia:
Documento in Post-print
Licenza:
Accesso privato/ristretto
Dimensione
130.34 kB
Formato
Adobe PDF
|
130.34 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
