An improved algorithm for selecting p items with uncertain returns according to the minmax-regret criterion

Mathematical Programming

Volumn 100, Issue 2, 2004, Pages 345-353

  Conde, Eduardo ^a  

^a UNIVERSITY OF SEVILLE   (Spain)

Author keywords

Complexity; Knapsack problem; Polynomial algorithm; Robust optimization

Indexed keywords

COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; OPTIMIZATION; PARAMETER ESTIMATION; POLYNOMIALS; PROBLEM SOLVING; ROBUSTNESS (CONTROL SYSTEMS);

COMPLEXITY; KNAPSACK PROBLEM; POLYNOMIAL ALGORITHM; ROBUST OPTIMIZATION;

ALGORITHMS;

EID: 21144437562     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10107-003-0474-7     Document Type: Article

References (8)

1. Aho, A.V., Hopcroft, J.E., Ullman J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA., 1974
2. Aho, A.V., Hopcroft, J.E., Ullman J.D.: Data Structures and Algorithms. Addison-Wesley, Reading, MA., 1983
3. Averbakh, I.: On the complexity of a class of combinatorial optimization problems with uncertainty. Math. Program. 90, 263-272 (2001)
4. Daniels, R.L., Kouvelis, P.: Robust scheduling to hedge against processing time uncertainty in single-stage production. Manage. Sci. 41(2), 363-376 (1995)
5. French, S.: Decision Theory. Ellis Norwood Limited, 1986
6. Vairaktarakis, G., Kouvelis, P.: Incorporating dynamic aspects and uncertainty in 1-median location problems. Naval Res. Logistics 46, 147-168 (1999)
7. Vairaktarakis, G.L.: Robust multi-item newsboy models with a budget constraint. Inter. J. Production Econ. 66(3), 213-226 (2000)
8. Yu, G.: Robust economic order quantity models. Eur. J. Oper. Res. 100(3), 482-493 (1997)