Skip to main content
SpringerLink
Log in

Boolean query optimization and the 0-1 hyperbolic sum problem

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

An “intelligent front-end” or “logic assistant” is an interactive program devised to assist the users of an information retrieval system in the formulation of their queries. In order to provide knowledge usable in such a program, we study a problem of query optimization with an average efficiency criterion. We formulate it as a new combinatorial optimization problem, which we call 0-1 hyperbolic sum, and provide an exact branch-and-bound algorithm and two heuristics (of simulated annealing and tabu search type) to solve it. Computational experience illustrating the effectiveness of the tabu search technique is reported.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. E. Aarts and J. Korst,Simulated Annealing and Boltzmann Machines (Wiley, 1989).

  2. R.E. Burkard and F. Rendl, A thermodynamically motivated simulation procedure for combinatorial optimization problems, Europ. J. Oper. Res. 17 (1984) 169–174.

    Article  MATH  Google Scholar 

  3. V. Cerny, A thermodynamical approach to the Traveling Salesman problem: An efficient simulation algorithm, J. Optimization Theory Appl. 45 (1985) 41–51.

    Article  MathSciNet  MATH  Google Scholar 

  4. A. El Baamrani, Analyse the deux méthodes heuristiques: méthode de “recuit” et méthode de “plus grande descente-plus petite remontée”, B. Sc. Essay, Faculté Universitaire Catholique de Mons (supervised by P. Hansen) (1985).

  5. F. Glover, Future paths for integer programming and links with artificial intelligence, Comput. Oper. Res. 13 (1986) 533–549.

    Article  MathSciNet  MATH  Google Scholar 

  6. F. Glover, Tabu search methods in artificial intelligence and operations research, ORSA Artificial Intell. Newsletter 1 (1987) 2–6.

    Google Scholar 

  7. F. Glover, Tabu search — Part I, ORSA J. Comput. 1 (1989) 190–206.

    Article  MathSciNet  MATH  Google Scholar 

  8. F. Glover, Tabu search — Part II, ORSA J. Comput. 2 (1990) 4–32.

    Article  MATH  Google Scholar 

  9. F. Glover and H.J. Greenberg, New approaches for heuristic search: A bilateral linkage with artificial intelligence, Europ. J. Oper. Res. 39 (1989) 119–130.

    Article  MathSciNet  MATH  Google Scholar 

  10. P. Hansen, The steepest-ascent-mildest-descent heuristic for combinatorial programming, presentation at theConf. on Numerical Methods in Combinatorial Optimization, Capri, Italy (1986).

  11. P. Hansen and B. Jaumard, Algorithms for the maximum satisfiability problem, Computing 44 (1990), in press.

  12. P. Hansen, M.V. Poggi de Aragão and C.C. Ribeiro, Hyperbolic 0-1 programming and query optimization in information retrieval, to appear in Math. Programming Series B (1991).

  13. M.H. Heine, A simple intelligent front-end for information retrieval systems using Boolean logic, Inform. Technol. 2 (1982) 247–260.

    Google Scholar 

  14. M.H. Heine, Information retrieval from classical databases from a signal detection stand point: A review, Inform. Technol. 3 (1984) 95–112.

    Google Scholar 

  15. M.H. Heine, Automatic optimization of search logic, contribution to theRound Table Workshop on Techniques for Access to Information and its Re-Use, Luxemburg (1986).

  16. M.H. Heine, A logic assistant for the database researcher, Inform. Proc. Management 24 (1988) 323–329.

    Article  Google Scholar 

  17. A. Hertz and D. de Werra, The tabu search metaheuristic — How we used it, Ann. Math. AI 1 (1990) 111–121.

    MATH  Google Scholar 

  18. S. Kirkpatrick, C.D. Gelatt and M.P. Vecchi, Optimization by simulated annealing, Science 220 (1983) 671–674.

    Article  MathSciNet  MATH  Google Scholar 

  19. M.V. Poggi de Aragão,Programação hiperbólica em variáveis 0-1 e otimização de consultas a bancos de dados bibliográficos, M. Sc. Dissertation, Catholic University of Rio de Janeiro, Rio de Janeiro, Brazil (1988).

    Google Scholar 

  20. M. Queyranne, private communication (1987).

  21. G. Salton, A simple blueprint for automatic Boolean query processing, Inform. Proc. Management 24 (1988) 269–280.

    Article  Google Scholar 

  22. D. Stephany, Localisation de postes en fonction du trafic interpostes, B. Sc. Essay, Faculté Universitaire Catholique de Mons (supervised by P. Hansen) (1986).

  23. C.J. Van Rijsbergen, Foundation of evaluation, J. Documentation 30 (1974) 365–373.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. RUTCOR, Rutgers University, 08903, New Brunswick, NJ, USA

    Pierre Hansen

  2. Ecole Polytechnique, H3C3A7, Montréal, Québec, Canada

    Marcus V. Poggi de Aragão

  3. Catholic University of Rio de Janeiro, Caixa Postal 38063, 22452, Rio de Janeiro, Brazil

    Celso C. Ribeiro

  4. CASNAV-Centro de Análise de Sistemas Navais, Rio de Janeiro, Brazil

    Marcus V. Poggi de Aragão

Authors
  1. Pierre Hansen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marcus V. Poggi de Aragão
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Celso C. Ribeiro
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research was done in part during a visit of the first author to the Pontifical Catholic University of Rio de Janeiro in July and August 1987, sponsored by CNPq. It was also supported in part by grants 0271 and 0066 of AFOSR to Rutgers University.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hansen, P., Poggi de Aragão, M.V. & Ribeiro, C.C. Boolean query optimization and the 0-1 hyperbolic sum problem. Ann Math Artif Intell 1, 97–109 (1990). https://doi.org/10.1007/BF01531072

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01531072

Keywords

Search

Navigation