On the complexity of the continuous unbounded knapsack problem with uncertain coefficients

Operations Research Letters

Volumn 33, Issue 5, 2005, Pages 481-485

  Conde, Eduardo ^a  

^a UNIVERSITY OF SEVILLE   (Spain)

Author keywords

Complexity; Minmax regret optimization; Polynomial algorithm

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; FUNCTIONS; LINEAR PROGRAMMING; MATHEMATICAL MODELS; OPTIMIZATION; PIECEWISE LINEAR TECHNIQUES; POLYNOMIALS; THEOREM PROVING;

COMPLEXITY; CONTINUOUS UNBOUNDED KNAPSACK PROBLEM; MINMAX REGRET OPTIMIZATION; POLYNOMIAL ALGORITHMS;

BOUNDARY VALUE PROBLEMS;

EID: 19944420489     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2004.11.003     Document Type: Article

References (4)

1. I. Averbakh Minmax regret linear resource allocation problems Oper. Res. Lett. 32 2004 174 180
2. E. Balas, and E. Zemel An algorithm for large zero-one knapsack problems Oper. Res. 28 1980 1130 1154
3. P. Hansen, M.V. Poggi de Aragão, and C.C. Ribeiro Hyperbolic 0-1 programming and query optimization in information retrieval Math. Program. 52 1991 255 263
4. S. Martello, and P. Toth Knapsack Problems, Algorithms and Computer Implementations 1990 Wiley New York