| Organizing National Elections in India to Elect the 543 Members of the Lok Sabha. | 0 | 0.34 | 2012 |
| Fast Descent Methods for LPs With No Matrix Inversions. | 0 | 0.34 | 2012 |
| O(m) Bound on Number of Iterations in Sphere Methods for LP. | 0 | 0.34 | 2012 |
| Sphere Methods for LP | 2 | 0.46 | 2010 |
| Developing A Dss For Allocating Gates To Flights At An International Airport | 0 | 0.34 | 2009 |
| Note on implementing the new sphere method for LP using matrix inversions sparingly | 3 | 0.54 | 2009 |
| A problem in enumerating extreme points, and an efficient algorithm for one class of polytopes | 3 | 0.46 | 2009 |
| Effect of block length and yard crane deployment systems on overall performance at a seaport container transshipment terminal | 34 | 1.59 | 2009 |
| Nonlinear Programming Theory and Algorithms | 0 | 0.34 | 2007 |
| A New Practically Efficient Interior Point Method for LP | 8 | 0.80 | 2006 |
| A decision support system for operations in a container terminal | 69 | 4.32 | 2005 |
| Hongkong International Terminals Gains Elastic Capacity Using a Data-Intensive Decision-Support System | 24 | 1.19 | 2005 |
| Rubber tired gantry crane deployment for container yard operation | 21 | 1.72 | 2003 |
| Matchings in colored bipartite networks | 16 | 1.13 | 2002 |
| Cone of recession and unboundedness of convex functions | 4 | 0.68 | 2001 |
| Facets of an Assignment Problem with 0–1 Side Constraint | 3 | 0.58 | 2000 |
| The U.S. Army National Guard's Mobile Training Simulators Location and Routing Problem | 1 | 0.44 | 1999 |
| Adjacency on the constrained assignment problem | 0 | 0.34 | 1998 |
| Segments in enumerating faces | 5 | 0.96 | 1995 |
| On the complexity of a special basis problem in LP | 0 | 0.34 | 1993 |
| Note on combinatorial optimization with max-linear objective functions | 5 | 1.99 | 1993 |
| CP-Rays in Simplicial Cones | 2 | 0.55 | 1990 |
| A correction to a result in linear programming | 0 | 0.34 | 1988 |
| Some NP-complete problems in quadratic and nonlinear programming. | 329 | 58.24 | 1987 |
| A finite characterization ofK-matrices in dimensions less than four. | 0 | 0.34 | 1986 |
| A 1-Matching Blossom-Type Algorithm For Edge Covering Problems | 11 | 1.32 | 1982 |
| A critical index algorithm for nearest point problems on simplicial cones. | 7 | 1.37 | 1982 |
| Computational complexity of parametric linear programming | 44 | 9.66 | 1980 |
| The graph of an abstract polytope | 6 | 1.45 | 1973 |
| A fundamental problem in linear inequalities with applications to the travelling salesman problem | 5 | 2.65 | 1972 |
