Skip to main content
SpringerLink
Log in

Abilio Lucena

Universidade Federal do Rio de Janeiro, Brazil

  • Discussion
  • Published:
Top Aims and scope Submit manuscript

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

References

  • Barahona F. and Anbil R. (2000). The volume algorithm: producing primal solutions with the subgradient method.Mathematical Programming 87, 385–399.

    Article  Google Scholar 

  • Beasley J.E. (1993). Lagrangean Relaxation. In: Reeves C. (ed.),Modern Heuristic Techniques. Blackwell Scientific Press.

  • Belloni A. and Lucena A. (2003). A Lagrangean Heuristic for the Linear Ordering Problem. In: Pinho de Sousa J. and Resende M.G.C. (eds.),Metaheuristics: Computer Decision-Making. Kluwer Academic Publisher (in press).

  • Bonnans J.F., Gilbert F.Ch., Lemaréchal C. and Sagastizábal C. (1997).Optimisation numérique: aspects théoriques et pratiques. Springer Verlag.

  • Calheiros F., Lucena A. and de Souza C. (2003). Optimal Rectangular Partitions.Networks 41, 51–67.

    Article  Google Scholar 

  • Escudero L., Guignard M. and Malik K. (1994). A Lagrangean relax and cut approach for the sequential ordering with precedence constraints.Annals of Operations Research 50, 219–237.

    Article  Google Scholar 

  • Fisher M.L. (1981). The Lagrangean relaxation method for solving integer programming problems.Management Science 27, 1–18.

    Article  Google Scholar 

  • Held M., Wolfe P. and Crowder H.P. (1974). Validation of subgradient optimization.Mathematical Programming 6, 62–88.

    Article  Google Scholar 

  • Hunting M., Faigle U. and Kern W. (2001). A Lagrangean relaxation approach to the edge-weighted clique problem.European Journal of Operational Research 131, 119–131.

    Article  Google Scholar 

  • Lucena A. (1982). Steiner problem in graphs: Lagrangean relaxation and cutting-planes.COAL Bulletin 21, 2–8.

    Google Scholar 

  • Lucena A. (1993). Tight bounds for the Steiner problem in graphs, Proceedings of NETFLOW93, Technical report TR-21/93, Dipartimento di Informatica, Universitá degli Studi di Pisa, Pisa, Italy, 147–154.

    Google Scholar 

  • Martinhon C., Lucena A. and Maculan N. (2003). StrongerK-Tree relaxations for the vehicle routing problem.European Journal of Operational Research (to appear).

  • Padberg M. and Rinaldi G. (1991). A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems.SIAM Review 33, 60–100.

    Article  Google Scholar 

Download references

Rights and permissions

Reprints and permissions

About this article

Cite this article

Abilio Lucena. Top 11, 219–224 (2003). https://doi.org/10.1007/BF02579041

Download citation

  • Issue Date:

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

Keywords

Search

Navigation