Tim Hopkins
Abstract
We present a number of corrections and improvements to Algorithm 769 [Pardalos et al. 1997].
- ANSI. 1979. Programming Language Fortran X3.9-1978. American National Standards Institute, New York.Google Scholar
- Fox, P. A., Hall, A. D., and Schryer, N. L. 1978. Framework for a portable library. ACM Trans. Math. Softw. 4, 2 (June), 177--188. Google Scholar
- ISO/IEC. 1997. Information Technology---Programming Languages---Fortran-Part 1: Base Language (ISO/IEC 1539-1:1997). ISO/IEC Copyright Office, Geneva.Google Scholar
- Pardalos, P. M., Pitsoulis, L. S., and Resende, M. G. C. 1997. Algorithm 769: Fortran subroutines for approximate solution of sparse quadratic assignment problems using GRASP. ACM Trans. Math. Softw. 23, 2 (June), 196--208. Google Scholar
- Schrage, L. 1979. A more portable fortran random number generator. ACM Trans. Math. Softw. 5, 2, 132--138. Google Scholar
Index Terms
- Remark on Algorithm 769: Fortran subroutines for approximate solution of sparse quadratic assignment problems using GRASP
Recommendations
Algorithm 769: Fortran subroutines for approximate solution of sparse quadratic assignment problems using GRASP
We describe Fortran subroutines for finding approximate solutions of sparse instances of the Quadratic Assignment Problem (QAP) using a Greedy Randomized Adaptive Search Procedure (GRASP). The design and implementation of the code are described in ...
Remark on Algorithm 815: FORTRAN subroutines for computing approximate solutions of feedback set problems using GRASP
We show that the Fortran source code for Algorithm 815 contains an error and we propose a correction. The error may cause the algorithm to generate incorrect results. We also show that the performance of the corrected algorithm can be improved by a ...
Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization
Optimization problems whose objective function and constraints are quadratic polynomials are called quadratically constrained quadratic programs (QCQPs). QCQPs are NP-hard in general and are important in optimization theory and practice. There have been ...
Comments