A bound-improving approach to discrete programming problems

Paulo Bárcia; J. D. Coelho

doi:10.1007/BF01581146

A bound-improving approach to discrete programming problems

Paulo Bárcia, J. D. Coelho

NOVA School of Business and Economics (NOVA SBE)

Research output: Contribution to journal › Article › peer-review

Abstract

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

Original language	English
Pages (from-to)	205-209
Number of pages	5
Journal	Mathematical Programming
Volume	66
Issue number	1-3
DOIs	https://doi.org/10.1007/BF01581146
Publication status	Published - 1 Aug 1994

Keywords

Discrete programming
Lagrangean duality

Access to Document

10.1007/BF01581146

Cite this

@article{44721cef13954fbeb20ba224466dcb91,

title = "A bound-improving approach to discrete programming problems",

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

keywords = "Discrete programming, Lagrangean duality",

author = "Paulo B{\'a}rcia and Coelho, {J. D.}",

year = "1994",

month = aug,

day = "1",

doi = "10.1007/BF01581146",

language = "English",

volume = "66",

pages = "205--209",

journal = "Mathematical Programming",

issn = "0025-5610",

publisher = "Springer",

number = "1-3",

}

TY - JOUR

T1 - A bound-improving approach to discrete programming problems

AU - Bárcia, Paulo

AU - Coelho, J. D.

PY - 1994/8/1

Y1 - 1994/8/1

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

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

KW - Discrete programming

KW - Lagrangean duality

UR - http://www.scopus.com/inward/record.url?scp=34249769338&partnerID=8YFLogxK

U2 - 10.1007/BF01581146

DO - 10.1007/BF01581146

M3 - Article

AN - SCOPUS:34249769338

SN - 0025-5610

VL - 66

SP - 205

EP - 209

JO - Mathematical Programming

JF - Mathematical Programming

IS - 1-3

ER -

A bound-improving approach to discrete programming problems

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this