Module 754 in TOMS

• TOMS Information

• Components
  • Fullsource from NETLIB

754

 
Solves dense quadratic assignment problems, where n facilities are to be
assigned to n sites at minimum cost. Uses a greedy, randomized, adaptive search
procedure (GRASP) to approximate the solution. Applicable to problems with at
least one symmetric flow or distance matrix. (See M. Resende, P. Pardalos, and Y.
Li, ACM TOMS 22 (1996) pp. 104-118.).
 
Classes  :  G2c4 . Matching problems in integer programming
            G2c5 . Routing, scheduling, and location problems in integer
                 programming
 
Type     : Fortran software in TOMS collection.
Access   : Some uses prohibited. Portable.
Precision: Single.
 
Usage    : CALL GQAPD (N, N2, NITER, ALPHA, BETA, LOOK4, SEED, F, D, A, B, SRTF,
           SRTIF, SRTD, SRTID, SRTC, SRTIC, INDEXD, INDEXF, COST, FDIND, OPTA,
           BESTV, ITER)
 
Details  : Fullsource
Sites    : (1) NETLIB
 

Implementation of 754 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 754 from toms" | mail netlib@ornl.gov