A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty

Taehan Lee; Changhyun Kwon

doi:10.1007/s10288-014-0270-7

A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty

Taehan Lee
, Changhyun Kwon^*

^*Corresponding author for this work

Department of Industrial and Information Systems Engineering

SUNY Buffalo

Research output: Contribution to journal › Journal article › peer-review

23 Scopus citations

Abstract

Robust combinatorial optimization problems with cardinality constrained uncertainty may be solved by a finite number of nominal problems. In this paper, we show that the number of nominal problems to be solved can be reduced significantly.

Original language	English
Pages (from-to)	373-378
Number of pages	6
Journal	4OR
Volume	12
Issue number	4
DOIs	https://doi.org/10.1007/s10288-014-0270-7
State	Published - 2014.11.27

Keywords

Discrete optimization
Robust combinatorial optimization

Quacquarelli Symonds(QS) Subject Topics

Business & Management Studies
Computer Science & Information Systems
Statistics & Operational Research

Access to Document

10.1007/s10288-014-0270-7

Cite this

@article{20d0e629081f4666abd9f8cebe64f149,

title = "A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty",

abstract = "Robust combinatorial optimization problems with cardinality constrained uncertainty may be solved by a finite number of nominal problems. In this paper, we show that the number of nominal problems to be solved can be reduced significantly.",

keywords = "Discrete optimization, Robust combinatorial optimization",

author = "Taehan Lee and Changhyun Kwon",

note = "Publisher Copyright: {\textcopyright} 2014, Springer-Verlag Berlin Heidelberg.",

year = "2014",

month = nov,

day = "27",

doi = "10.1007/s10288-014-0270-7",

language = "English",

volume = "12",

pages = "373--378",

journal = "4OR",

issn = "1619-4500",

number = "4",

}

TY - JOUR

T1 - A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty

AU - Lee, Taehan

AU - Kwon, Changhyun

PY - 2014/11/27

Y1 - 2014/11/27

N2 - Robust combinatorial optimization problems with cardinality constrained uncertainty may be solved by a finite number of nominal problems. In this paper, we show that the number of nominal problems to be solved can be reduced significantly.

AB - Robust combinatorial optimization problems with cardinality constrained uncertainty may be solved by a finite number of nominal problems. In this paper, we show that the number of nominal problems to be solved can be reduced significantly.

KW - Discrete optimization

KW - Robust combinatorial optimization

UR - https://www.scopus.com/pages/publications/84912574235

U2 - 10.1007/s10288-014-0270-7

DO - 10.1007/s10288-014-0270-7

M3 - Journal article

AN - SCOPUS:84912574235

SN - 1619-4500

VL - 12

SP - 373

EP - 378

JO - 4OR

JF - 4OR

IS - 4

ER -

A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty

Abstract

Keywords

Quacquarelli Symonds(QS) Subject Topics

Access to Document

Other files and links

Fingerprint

Cite this