Narrow search
Showing 1 - 10 of 14
Cover Image
Calculation of Stability Radii for Combinatorial Optimization Problems
Chakravarti, Nilotpal; Wagelmans, Albert P.M. - Tinbergen Instituut - 1997
We present algorithms to calculate the stability radius of optimal or approximate solutions of binary programming problems with a min-sum or min-max objective function. Our algorithms run in polynomial time if the optimization problem itself is polynomially solvable. We also extend our results...
Persistent link: https://www.econbiz.de/10011256535
Cover Image
Sensitivity analysis of a greedy heuristic for knapsack problems
Ghosh, Diptesh; Chakravarti, Nilotpal; Sierksma, Gerard - In: European journal of operational research : EJOR 169 (2006) 1, pp. 340
Persistent link: https://www.econbiz.de/10006641149
Cover Image
Features - International OR: - India: Tea Company Steeped in OR - A model of efficiency: Researchers in India seek to minimize freight cost while satisfying demand, supply and operational constraints
Chakravarti, Nilotpal - In: OR MS today : operations research - management science 27 (2000) 2, pp. 32-35
Persistent link: https://www.econbiz.de/10006727592
Cover Image
Calculation of stability radii for combinatorial optimization problems
Chakravarti, Nilotpal; Wagelmans, Albert P.M. - In: Operations research letters 23 (1998) 1, pp. 1-8
Persistent link: https://www.econbiz.de/10006845400
Cover Image
Bounded isotonic median regression
Chakravarti, Nilotpal - In: Computational Statistics & Data Analysis 8 (1989) 2, pp. 135-142
Persistent link: https://www.econbiz.de/10005020883
Cover Image
LP relaxation of the two dimensional knapsack problem with box and GUB constraints
Bagchi, Ansuman; Bhattacharyya, Nalinaksha; … - In: European Journal of Operational Research 89 (1996) 3, pp. 609-617
Persistent link: https://www.econbiz.de/10005257157
Cover Image
Sensitivity analysis of a greedy heuristic for knapsack problems
Ghosh, Diptesh; Chakravarti, Nilotpal; Sierksma, Gerard - In: European Journal of Operational Research 169 (2006) 1, pp. 340-350
Persistent link: https://www.econbiz.de/10005277631
Cover Image
Calculation of Stability Radii for Combinatorial Optimization Problems
Chakravarti, Nilotpal; Wagelmans, Albert P.M. - Tinbergen Institute - 1997
We present algorithms to calculate the stability radius of optimal or approximate solutions of binary programming problems with a min-sum or min-max objective function. Our algorithms run in polynomial time if the optimization problem itself is polynomially solvable. We also extend our results...
Persistent link: https://www.econbiz.de/10005281875
Cover Image
Some results concerning post-infeasibility analysis
Chakravarti, Nilotpal - In: European Journal of Operational Research 73 (1994) 1, pp. 139-143
Persistent link: https://www.econbiz.de/10005329711
Cover Image
Calculation of Stability Radii for Combinatorial Optimization Problems
Chakravarti, Nilotpal; Wagelmans, Albert P.M. - 1997
We present algorithms to calculate the stability radius of optimal or approximate solutions of binary programming problems with a min-sum or min-max objective function. Our algorithms run in polynomial time if the optimization problem itself is polynomially solvable. We also extend our results...
Persistent link: https://www.econbiz.de/10010324490