- m) Bound on Number of Iterations in Sphere Methods for LPaor, 7(1):30-40, 2012. [doi]

- Sphere Methods for LPaor, 5(1):21-33, 2010. [doi]

- Nonlinear Programming Theory and Algorithmstechnometrics, 49(1):105, 2007. [doi]

- A decision support system for operations in a container terminaldss, 39(3):309-332, 2005. [doi]

- Rubber tired gantry crane deployment for container yard operationcandie, 45(3):429-442, 2003. [doi]

- Matchings in colored bipartite networksDAM, 121(1-3):261-277, 2002.

- Cone of recession and unboundedness of convex functionseor, 133(2):409-415, 2001. [doi]

- Facets of an Assignment Problem with 0-1 Side Constraintjco, 4(3):365-388, 2000.

- Adjacency on the Constrained Assignment ProblemDAM, 87(1-3):269-274, 1998. [doi]

- Segments in enumerating facesmp, 70:27-45, 1995. [doi]

- Studies of lexicography in the generalized network simplex methodanor, 46-47(2):235-248, 1993. [doi]
- Note on Combinatorial Optimization with Max-Linear Objective FunctionsDAM, 42(2):139-145, 1993. [doi]
- On the Complexity of a Special Basis Problem in LPDAM, 47(2):181-185, 1993. [doi]
- Book reviewsjgo, 3(4):523-526, 1993. [doi]

- Exterior point algorithms for nearest points and convex quadratic programsmp, 57:145-161, 1992.

- CP-Rays in Simplicial Conesmp, 48:387-414, 1990.

- The steepest descent gravitational method for linear programmingDAM, 25(3):211-239, 1989. [doi]

- A correction to a result in linear programmingDAM, 20(2):177-180, 1988. [doi]

- Some NP-complete problems in quadratic and nonlinear programmingmp, 39(2):117-129, 1987. [doi]

- K-matrices in dimensions less than fourmp, 35(1):17-31, 1986. [doi]

- Some NP-complete problems in linear programmingorl, 1(3):101-104, 1982. [doi]
- A 1-matching blossom-type algorithm for edge covering problemsnetworks, 12(4):379-391, 1982. [doi]
- A critical index algorithm for nearest point problems on simplicial conesmp, 23(1):206-215, 1982. [doi]

- Computational complexity of parametric linear programmingmp, 19(1):213-219, 1980. [doi]

- The graph of an abstract polytopemp, 4(1):336-346, 1973. [doi]

- Letter to the Editor - An Algorithm for Ranking all the Assignments in Order of Increasing Costior, 16(3):682-687, 1968. [doi]
- Solving the Fixed Charge Problem by Ranking the Extreme Pointsior, 16(2):268-279, 1968. [doi]