Skip to main content
SpringerLink
Log in

A bound-improving approach to discrete programming problems

  • Published:
Mathematical Programming Submit manuscript

Abstract

This note deals with the extension of the bound-improving sequence idea to general discrete programming problems.

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

  • P. Barcia, “Bound-improving sequences,” Working paper 18, Universidade Nova de Lisboa, Department of Economics (1984).

  • P. Barcia, “The bound improving sequence algorithm,”Operations Research Letters 4 (1985) 27–30.

    Google Scholar 

  • P. Barcia, “Constructive dual methods for discrete programming,”Discrete Applied Mathematics 18 (1987) 107–117.

    Google Scholar 

  • P. Barcia and S. Holm, “A revised bound improving sequence algorithm,”European Journal of Operational Research 36(2) (1988) 202–206.

    Google Scholar 

  • P. Barcia and K. Jörnsten, “Improved Lagrangean decomposition: An application to the generalized assignment problem,”European Journal of Operational Research, 46(1) (1990) 84–92.

    Google Scholar 

  • J.D. Coelho, “Dual strenghening methods for integer programming,” Working paper 48, Universidade Nove de Lisboa, Department of Economics (1986).

Download references

Author information

Authors and Affiliations

  1. Department of Economics, Travessa Estevao Pinto, Universidade Nova de Lisboa, Campolide, P-1000, Lisboa, Portugal

    P. Barcia & J. D. Coelho

Authors
  1. P. Barcia
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. D. Coelho
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Corresponding author.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Barcia, P., Coelho, J.D. A bound-improving approach to discrete programming problems. Mathematical Programming 66, 205–209 (1994). https://doi.org/10.1007/BF01581146

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation