A bound-improving approach to discrete programming problems

Paulo Bárcia, J. D. Coelho

Research output: Contribution to journalArticle

Abstract

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

Original languageEnglish
Pages (from-to)205-209
Number of pages5
JournalMathematical Programming
Volume66
Issue number1-3
DOIs
Publication statusPublished - 1 Aug 1994

Keywords

  • Discrete programming
  • Lagrangean duality

Fingerprint Dive into the research topics of 'A bound-improving approach to discrete programming problems'. Together they form a unique fingerprint.

  • Cite this