Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Nilotpal Chakravarti
Information about the author Nilotpal Chakravarti will soon be added to the site.
Found
9 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Sensitivity analysis of a greedy heuristic for knapsack problems
2006
In this paper, we carry out parametric analysis as well as a tolerance limit based...
Hard knapsack problems that are easy for local search
1999
Chvátal describes a class of zero–one knapsack problems provably...
A new look at a greedy algorithm for solving a class of convex programming problems
1999
Morton et al. describe a greedy algorithm for solving a class of convex programming...
A competitive local search heuristic for the subset sum problem
1999
Subset sum problems are a special class of difficult singly constrained zero–one...
LP relaxation of the two dimensional knapsack problem with box and GUB constraints
1996
In the present paper we derive an O( n 2 log n ) algorithm for the linear programming...
Some results concerning post-infeasibility analysis
1994
Linear constraints are used to model diverse phenomena. The number of constraints is...
Isotonic median regression for orders representable by rooted trees
1992
The isotonic median regression problem arising in statistics is as follows. We are...
Active set algorithms for isotonic regression; A unifying framework
1990
In this and subsequent papers the authors will show that several algorithms for the...
Isotonic median regression: A linear programming approach
1989
The isotonic median regression problem arises in statistics. It is known that the...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers