Sensitivity analysis of a greedy heuristic for knapsack problems

European Journal of Operational Research

Volumn 169, Issue 1, 2006, Pages 340-350

  Ghosh, Diptesh ^a   Chakravarti, Nilotpal ^b   Sierksma, Gerard ^c  

^a INDIAN INSTITUTE OF MANAGEMENT   (India)

^b ORTEC Asia Pvt Ltd   (Singapore)

^c UNIVERSITY OF GRONINGEN   (Netherlands)

Author keywords

Combinatorial optimization; Heuristics; Knapsack problems; Sensitivity analysis

Indexed keywords

COMBINATORIAL MATHEMATICS; HEURISTIC METHODS; OPTIMIZATION; PARAMETER ESTIMATION; POLYNOMIALS; PROBLEM SOLVING;

COMBINATORIAL OPTIMIZATION; GREEDY HEURISTICS; HEURISTICS; KNAPSACK PROBLEMS;

SENSITIVITY ANALYSIS;

EID: 25144506216     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2004.09.025     Document Type: Article

References (7)

1. N. Chakravarti, and A.P.M. Wagelmans Calculation of stability radii for combinatorial optimization problems Operations Research Letters 23 1998 1 7
2. T. Gal H.J. Greenberg Advances in Sensitivity Analysis and Parametric Programming 1997 Kluwer Academic Publishers Boston
3. A.W.J. Kolen, A.H.G. Rinnooy Kan, C.P.M. van Hoesel, and A.P.M. Wagelmans Sensitivity analysis of list scheduling heuristics Discrete Applied Mathematics 55 1994 145 162
4. S. Martello, and P. Toth Knapsack Problems: Algorithms and Computer Implementations 1989 John Wiley & Sons Singapore
5. R.M. Nauss Parametric Integer Programming 1979 University of Missouri Press Columbia, MO
6. R. Ramaswamy, Sensitivity analysis in combinatorial optimization, Fellowship dissertation, IIM Calcutta, Calcutta, 1994.
7. A.P.M. Wagelmans, Sensitivity analysis in combinatorial optimization, Ph.D. Dissertation, Erasmus Universiteit, Rotterdam, 1990.