Publications (reverse chronological order)

John Mitchell

You can also access a list of recent papers arranged by topic. You can also download copies of the slides from some recent talks.

Technical reports | Appeared in print | Old technical reports

Technical reports

• An LPCC Approach to Nonconvex Quadratic Programs with Jing Hu and Jong-Shi Pang. May 2008. Journal submission.
• Properties of a cutting plane method for semidefinite programming, with Kartik Krishnan Sivaramakrishnan, September 2007. Journal submission.
• Logic-based Multi-Objective Optimization for Restoration Planning with Jing Gong, Rusty Lee, and Al Wallace, December 11, 2006. Accepted for publication in Optimization and Logistics Challenges in the Enterprise, Springer, New York, 2009, edited by W. Chaovalitwongse, K.C. Furman, and P.M. Pardalos.
• Multivehicle routing with profits and competition, with Ellen Thorson and Jose Holguín-Veras, October 2005. Journal submission.
• An analytic center cutting plane approach for conic programming, with Luc Basescu, June 22, 2005. Accepted for publication in Mathematics of Operations Research.
• A second-order cone cutting surface method: complexity and application, with Mohammad Oskoorouchi, August 7, 2006. Accepted for publication in Computational Optimization and Applications.
• The Clique Partition Problem with Minimum Clique Size Requirement, with Xiaoyun Ji, May 5, 2005. Journal submission.
• Rebalancing an Investment Portfolio in the Presence of Convex Transaction Costs, with Steve Braun, December 17, 2004. Journal submission.
• Branch-and-cut for the k-way equipartition problem, January 2001. Journal submission.

Appeared in print

2008

1. On the Global Solution of Linear Programs with Linear Complementarity Constraints with Jing Hu, Jong-Shi Pang, Kristin P. Bennett, and Gautam Kunapuli, SIAM Journal on Optimization 19 (1), 2008, pages 445-471.
2. Proximity Queries between Convex Objects: An Interior Point Approach for Implicit Surfaces, with Srinivas Akella, Nilanjan Chakraborty, and Jufeng Peng. IEEE Transactions on Robotics 24(1), 2008, pages 211-220.
3. Selective Gram-Schmidt orthonormalization for conic cutting surface algorithms, with Luc Basescu, Mathematical Methods of Operations Research, Volume 67, Number 1, pages 91-115, 2008.
4. Optimal Placement of Stereo Sensors, with Mohammad Al Hasan and Krishna K. Ramachandran. Optimization Letters, Volume 2, Number 1, pages 99-111, January 2008.

   2007

5. Restoration of services in interdependent infrastructure systems: a network flows approach with Earl (Rusty) Lee and Al Wallace. IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, Volume 37(6), pages 1303-1317, 2007.
6. Branch-and-Price-and-Cut on the Clique Partition Problem with Minimum Clique Size Requirement, with Xiaoyun Ji, Discrete Optimization, 4 (1), 2007, pages 87-102.

   2006

7. Proximity Queries between Convex Objects: An Interior Point Approach for Implicit Surfaces, with Srinivas Akella, Nilanjan Chakraborty, and Jufeng Peng, September 2005. Proceedings of ICRA2006, the 2006 IEEE International Conference on Robotics and Automation.
8. Interior point methods for large-scale linear programming, with Kris Farwell and Daryn Ramsden, Handbook of Optimization in Telecommunications. Edited by Mauricio G. C. Resende and Panos M. Pardalos. Springer Science + Business Media, 2006. Pages 3-25.
9. Semidefinite cut-and-price approaches for the maxcut problem, with Kartik Krishnan, Computational Optimization and Applications, Volume 33(1), pages 51-71, 2006.
10. A unifying framework for several cutting plane methods for semidefinite programming, with Kartik Krishnan, Optimization Methods and Software, 21(1), February 2006, pages 57-74.

    2005

11. Decision technologies for protection of critical infrastructures, with Earl (Rusty) Lee, Al Wallace, and David Mendonça. May 2005. Proceedings of "Working Together: R&D Partnerships in Homeland Security", Boston.
12. Using selective orthonormalization to update the analytic center after the addition of multiple cuts, with Srini Ramaswamy, Journal of Optimization Theory and Applications, Volume 125, Number 2, May 2005, pages 431-451.
13. Finding optimal realignments in sports leagues using a branch-and-cut-and-price approach, with Xiaoyun Ji, International Journal of Operational Research (IJOR), Volume 1, Numbers 1-2, pages 101-122, 2005.
14. A semidefinite programming heuristic for quadratic programming problems with complementarity constraints with Steve Braun, Computational Optimization and Applications 31(1), 2005, pages 5-29.

    2004

15. Extreme Events and the Sustainability of Civil Infrastructure Systems, with Earl (Rusty) Lee and Al Wallace. Proceedings of the International Workshop on Integrated Life-Cycle Management of Infrastructures, Hong Kong, December 2004.
16. An approach for solving the integrative freight market simulation, with Ellen Thorson and Jose Holguín-Veras, May 2004. Proceedings of the Pan-American Conference of Traffic and Transportation Engineering (PANAM XIII), CD-ROM.
17. Assessing Vulnerability of Proposed Designs for Interdependent Infrastructure Systems with Earl (Rusty) Lee and Al Wallace. Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04), January 05 - 08, 2004, Big Island, Hawaii.
18. Disruptions in interdependent infrastructure systems: a network flows approach with Earl (Rusty) Lee and Al Wallace. Proceedings of the 2004 NSF Design, Service and Manufacturing Grantees and Research Conference, Dallas, January 5-8, 2004.

    2003

19. Managing disruptions to critical interdependent infrastructures in the context of the 2001 WorldTrade Center attack with Al Wallace, David Mendonça, Earl (Rusty) Lee, and Joe Chow. In Beyond September 11: An account of post-disaster research M. F. Myers, Ed. Boulder, CO: Natural Hazards Research and Applications Information Center, University of Colorado, Program on Environment and Behavior, Special Publication #39, pages 165-198, 2003.
20. Polynomial interior point cutting plane methods, Optimization Methods and Software, 18(5), pages 507-534, 2003.
21. "Realignment in the National Football League," Naval Research Logistics, 50(7), pages 683-701, 2003.
22. "Semi-infinite linear programming approaches to semidefinite programming problems," with Kartik Krishnan, Fields Institute Communications Series, Volume 37, Novel approaches to hard discrete optimization problems, edited by P. Pardalos and H. Wolkowicz, pages 123--142, 2003.

    2002

23. Branch-and-cut methods for combinatorial optimization problems, in the Handbook of Applied Optimization, Oxford University Press, 2002.

    2001

24. Branch-and-bound methods for integer programming, with Eva K. Lee, in the Encyclopedia of Optimization, Volume II, pages 509-519, Kluwer Academic Publishers, August 2001.
25. Cutting plane algorithms for integer programming, in the Encyclopedia of Optimization, Volume II, pages 525-533, Kluwer Academic Publishers, August 2001.
26. Branch-and-cut algorithms for integer programming, in the Encyclopedia of Optimization, Volume II, pages 519-525, Kluwer Academic Publishers, August 2001.
27. "Restarting after branching in the SDP approach to MAX-CUT and similar combinatorial optimization problems", Journal of Combinatorial Optimization, 5(2), 2001, pages 151-166.
28. "A homogenized cutting plane method to solve the convex feasibility problem," with Erling Andersen, Kees Roos, and Tamas Terlaky, Chapter 10 in Optimization Methods and Applications, edited by X. Q. Yang et al., Kluwer Academic Publishers, April 2001.
29. An ellipsoid algorithm for equality-constrained nonlinear programs, with Sharmila Shah and Mike Kupferschmid. Computers and Operations Research, 28(1), 2001, pages 85-92.

    2000

30. "A Long-Step, Cutting Plane Algorithm for Linear and Convex Programming," (with Srini Ramaswamy), Annals of OR, Volume 99, 2000, pages 95-122.
31. "Computational experience with an interior point cutting plane algorithm", SIAM Journal on Optimization, volume 10(4), pages 1212-1227, 2000.
32. "Stratified filtered sampling in stochastic optimization," (with John Mulvey, Bob Rush, and Tom Willemain), Journal of Applied Mathematics and Decision Sciences, 4(1), 2000, pp. 17-38.
33. "Solving linear ordering problems with a combined interior point/simplex cutting plane algorithm", with Brian Borchers. Appeared as Chapter 14, pages 349-366, of High Performance Optimization, edited by H. Frenk et al., Kluwer Academic Publishers, 2000.
34. "Computational Experience of an Interior-Point SQP Algorithm in a Parallel Branch-and-Bound Framework", with Eva K. Lee. Appeared as Chapter 13, pages 329-347, of High Performance Optimization, edited by H. Frenk et al., Kluwer Academic Publishers, 2000.

    1998

35. "Interior point methods for combinatorial optimization,". With Panos Pardalos and Mauricio G. C. Resende. Handbook of Combinatorial Optimization, Volume 1, pages 189-297, Kluwer Academic Publishers, 1998.
36. "An interior point cutting plane algorithm for Ising spin glass problems", postscript file, 67503 bytes or pdf format. Appeared in "Operations Research Proceedings, SOR 1997, Jena, Germany", Springer-Verlag, edited by P. Kischka and H.-W. Lorenz, 1998, pages 114-119. (Also available as a dvi file, 24328 bytes.) (Abstract.) The generator for some Ising spin glass instances is available.

    1997

37. "Computational experience of an interior point algorithm in a parallel branch-and-cut framework", with Eva K. Lee, Proceedings of the Eighth SIAM Conference on Parallel Processing for Scientific Computing, Minneapolis, March 1997, CD-ROM.
38. "A branch-and-cut algorithm for MAX-SAT and weighted MAX-SAT", with S. Joy and B. Borchers, in "Satisfiability Problem: Theory and Applications", edited by D. Du, J. Gu, and P. Pardalos, 1997, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Volume 35, pages 519-536.
39. "Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems", European Journal of Operational Research, volume 97, 1997, pages 139-148.
40. "A computational comparison of Branch and Bound and Outer Approximation Methods for 0-1 mixed integer nonlinear programs", with Brian Borchers, Computers and Operations Research, 24, 1997, pages 699-701.
41. "Computational experience in nonlinear mixed integer programming", with Eva K. Lee, Proceedings of the Symposium on Operations Research 1996 (SOR96), August 1996, Braunschweig, Germany, published by Springer-Verlag, 1997, pages 95-100.

    1996

42. "Interior point algorithms for combinatorial optimization", appeared in "Interior Point Methods in Mathematical Programming", edited by Tamas Terlaky, Kluwer Academic Publishers, 1996, chapter 11, pages 417-466.
43. "Interior point algorithms for integer programming", appeared in "Advances in Linear and Integer Programming", edited by John E. Beasley, Oxford University Press, 1996, chapter 6, pages 223-248.
44. "Solving real-world linear ordering problems using a primal-dual interior point cutting plane method", with Brian Borchers, Annals of Operations Research, volume 62, 1996, pages 253-276.

    1995

45. "A Primal-Dual Interior Point Method for Linear Programming Based on a Weighted Barrier Function", with Z.-Y. Cheng, Journal of Optimization Theory and Applications, 87, 1995, pages 301-321.
46. "The nonlinear effects of teaching and consulting on academic research and productivity", with Douglas S. Rebne, Socio-Economic Planning Sciences, volume 29, 1995, pages 47-57.

    1994

47. "An Alternative Derivation of the Projective Interior Point Method for Linear Programming Through the Least Squares Approach", with Z.-Y. Cheng, Optimization, 31, 1994, pages 95-106.
48. "An improved branch and bound algorithm for mixed integer nonlinear programming", with Brian Borchers, Computers and Operations Research, 21(4), 1994, pages 359-367.
49. "Analyzing and Exploiting the Structure of the Constraints in the ILP Approach to the Scheduling Problem", with S. Chaudhuri and R. A. Walker, IEEE Transactions on VLSI, Volume 2, December 1994, pages 456-471.
50. "An interior point column generation method for linear programming using shifted barriers", SIAM Journal on Optimization, 4, 1994, pages 423-440.

    1993

51. "The structure of assignment, precedence, and resource constraints in the ILP approach to the scheduling problem", with S. Chaudhuri and R. A. Walker, Proceedings of the 1993 IEEE International Conference on Computer Design.
52. "Updating lower bounds when using Karmarkar's projective algorithm for linear programming", Journal of Optimization Theory and Applications, 78, 1993, pages 127-142.

    1992

53. "A primal-dual interior point cutting plane method for the linear ordering problem", with Brian Borchers, COAL Bulletin, Volume 21, November 1992, pages 13-18.
54. "Solving combinatorial optimization problems using Karmarkar's algorithm", with M. J. Todd, Mathematical Programming 56, 1992, pages 245-284.

    1991

55. "Solving matching problems using Karmarkar's algorithm", with M. J. Todd, appeared in "Mathematical Developments Arising from Linear Programming (Contemporary Mathematics, Volume 114)", edited by J. C. Lagarias and M. J. Todd, AMS, 1991, pages 309-318.

    1990

56. "Nonlinear decision variables in work design: faculty roles and research productivity", with Douglas S. Rebne, Proceedings of the Decision Sciences Institute, San Diego, California, November 1990, pages 1426-1428.

    1989

57. "A variant of Karmarkar's linear programming algorithm for problems with some unrestricted variables", with M. J. Todd, SIAM Journal on Matrix Analysis and Applications, volume 10(1), 1989, pages 30-38.
58. "On the Relationship Between the Search Directions in the Affine and Projective Variants of Karmarkar's Linear Programming Algorithm", with M. J. Todd, appeared in "Contributions to Operations Research and Economics: The Twentieth Anniversary of CORE", edited by Bernard Cornet and Henry Tulkens, MIT Press, Cambridge, Massachusetts, 1989, pages 237-250.

    1988

59. "Karmarkar's Algorithm and Combinatorial Optimization Problems", PhD thesis, School of Operations Research and Industrial Engineering, Cornell University, Ithaca NY, 1988.

Old technical reports

• Rebalancing an Investment Portfolio in the Presence of Transaction Costs, with Steve Braun, November 28, 2002. Revised December 16, 2003.
• Restoration of services in interdependent infrastructure systems: a network flows approach, with Earl (Rusty) Lee, David Mendonça, and Al Wallace. June 2003.
• "A linear programming approach to semidefinite programming problems," with Kartik Krishnan, May 2001.
• "Solving MAX-SAT and Weighted MAX-SAT Problems Using Branch-and-Cut", February 28, 1998. With Steve Joy and Brian Borchers. Accepted for publication in the Journal of Combinatorial Optimization.
• "A tabu search procedure for target-matching in financial scenario generation," (with Adam J. Berger, John Mulvey, and Bob Rush), Dec 5, 1997. (Abstract.)
• "A long step cutting plane algorithm that uses the volumetric barrier", with Srini Ramaswamy, June 1995, DSES Tech Report, RPI.
• "On Updating the Analytic Center After the Addition of Multiple Cuts," with Srini Ramaswamy, substantially revised April 28, 1998, original version October 27, 1994.
• "Occupational contingencies of academic work design", with Douglas S. Rebne, Technical Report, Management Sciences Dept, RPI, 1993.
• "Using an interior point method in a branch and bound algorithm for integer programming", with Brian Borchers Mathematical Sciences Report 195, Rensselaer Polytechnic Institute, March 1991, revised July 1992.

My MathSciNet references.

RPI Math