New heuristics and adaptive memory procedures for boolean optimization problems

Integer Programming: Theory and Practice

Volumn , Issue , 2005, Pages 1-18

  Hvattum, Lars M ^a   Løkketangen, Arne ^a   Glover, Fred ^b  

^a MOLDE UNIVERSITY COLLEGE   (Norway)

^b UNIVERSITY OF COLORADO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 79751537001     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Chapter

References (17)

1. Cook, S. A., The complexity of theorem-proving procedures, in Proc. Third ACM Symp. on Theory of Computing, 1971, 151.
2. Davoine, T., Hammer P. L., and Vizvári, B., A heuristic for Boolean optimization problems, J of Heuristics, 9, 229, 2003.
3. Dolan, E. D. and Moré J. J., Benchmarking optimization software with performance profiles, preprint ANL/MCS-P861-1200, Mathematics and Computer Science Division, Argonne National Laboratory, 2001.
4. Du, D., Gu, J., and Pardalos, P., Eds., Satisfiability Problem: Theory and Applications, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 35, AMS, 1997.
5. Feo, T. A. and Resende M. G. C., A probabilistic heuristic for a computationally difficult set covering problem, Operations Research Letters, 8, 67, 1989.
6. Gendreau, M., An introduction to tabu Search, in Handbook of Metaheuristics, Glover, F. and Kochenberger, G., Eds., Kluwer Academic Publishers, 2003, 37.
7. Glover, F., Tabu search— part I, ORSA Journal on Computing, 1, 190, 1989.
8. Glover, F., Multi-start and strategic oscillation methods — principles to exploit adaptive memory, in OR Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research, Laguna, M. and González-Velarde, J. L., 2000, 1.
9. Glover, F. and Kochenberger, G., Critical event tabu search for multidimensional knapsack problems, in Meta Heuristics: Theory and Applications, Osman, I. H. and Kelly, J. P., Eds., Kluwer Academic Publishers, 1996, 407.
10. Glover, F. and Laguna, M., Tabu Search, Kluwer Academic Publishers, 1997.
11. Hvattum, L. M., Løkketangen, A., and Glover, F., Adaptive memory search for Boolean optimization problems, Discrete Applied Mathematics, 142, 99, 2004.
12. Løkketangen, A. and Glover F., Probabilistic move selection in tabu Search for 0/1 mixed integer programming problems, in Metaheuristics: Theory and Applications, Eds.: Osman, I. H. and Kelly, J. P., Eds., Kluwer Academic Publishers, 1996, 467.
13. Løkketangen, A. and Glover, F., Surrogate constraint analysis—new heuristics and learning schemes for satisfiability problems, in Satisfiability Problem: Theory and Applications, Du, D., Gu, J., and Pardalos, P. M., Eds., DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 35, AMS, 1997, pp. 537–572.
14. Martí, R., Multi-start methods, in Handbook of Metaheuristics, Glover, F. and Kochenberger, G., Eds., Kluwer Academic Publishers, 2003, 355.
15. Resende, M. G. C., Pitsoulis, L. S., and Pardalos, P. M., Approximate solution of weighted MAX-SAT problems using GRASP, in Satisfiability Problem: Theory and Applications, Du, D., Gu, J., and Pardalos, P. M., Eds., DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 35, AMS, 1997, 393.
16. Resende, M. G. C. and Ribeiro, C. C., GRASP with path-relinking: recent advances and applications, submitted to Metaheuristics: Progress as Real Problem Solvers, Ibaraki, T., Nonobe, K., and Yagiura, M., Eds., Springer, 2005.
17. Shang, Y., Global search methods for solving nonlinear optimization problems, Ph.D. Thesis, Dept. of Computer Science, University of Illinois, Urbana- Champaign, 1997.