Module 787 in TOMS

• TOMS Information

• Components
  • Fullsource from NETLIB

787

 
Approximate solution of the maximum independent set problem. A subset of
vertices of a graph is independent if all its members are pairwise nonadjacent.
This finds independent sets of maximum cardinality. (See M.G.C. Resende, T.A.
Feo and S.H. Smith, ACM TOMS 24 (1998) pp. 386-394).
 
Classes  :  G2d . Network optimization (for network reliability search class
                M)
            P .   Computational geometry (search also classes G and Q)
 
Type     : Fortran software in TOMS collection.
Access   : Some uses prohibited. Portable.
Precision: Single.
 
Details  : Fullsource
Sites    : (1) NETLIB
 

Implementation of 787 from TOMS on NETLIB

 
NETLIB:    Public access repository, The University of Tennessee at
           Knoxville and Bell Laboratories
 
Precision: Single.
 
You may access components from NETLIB outside GAMS as follows.
 
   Fullsource   : echo "send 787 from toms" | mail netlib@ornl.gov