Recent Publications of John Mitchell

The more recent of these links point to files with more information about the paper. Most of the rest point to uncompressed postscript files or adobe acrobat pdf files. You can also access a reverse chronological list of papers. You can also download copies of the slides from some of my recent talks.


Topics:

Interior point methods for integer programming (survey papers)

  1. 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.
  2. Polynomial interior point cutting plane methods, Optimization Methods and Software, 18(5), pages 507-534, 2003.
  3. "Interior point methods for combinatorial optimization," 1997. With Panos Pardalos and Mauricio G. C. Resende. Handbook of Combinatorial Optimization, Volume 1, pages 189-297, Kluwer Academic Publishers, 1998.
  4. "Interior Point Methods for Combinatorial Optimization," 1995. A survey paper which appeared as Chapter 11 in "Interior Point Methods in Mathematical Programming", edited by Tamas Terlaky, published by Kluwer Academic Publishers, 1996.
  5. "Interior Point Algorithms for Integer Programming", 1994. This is a survey paper which appeared as Chapter 6 in "Recent Advances in Linear and Integer Programming," edited by John Beasley, and published by Oxford University Press in 1996.

Interior point cutting plane methods (computational results)

  1. A second-order cone cutting surface method: complexity and application, with Mohammad Oskoorouchi, August 7, 2006. Accepted for publication in Computational Optimization and Applications.
  2. Semidefinite cut-and-price approaches for the maxcut problem, with Kartik Krishnan, Computational Optimization and Applications, Volume 33(1), pages 51-71, 2006.
  3. "Semi-infinite linear programming approaches to semidefinite programming problems," with Kartik Krishnan, August 2001. Appeared in Fields Institute Communications Series, Volume 37, Novel approaches to hard discrete optimization problems, edited by P. Pardalos and H. Wolkowicz, AMS, pages 123-142, 2003.
  4. "A linear programming approach to semidefinite programming problems," with Kartik Krishnan, May 2001.
  5. "Branch-and-cut for the k-way equipartition problem,", January 2001.
  6. "Realignment in the National Football League," Naval Research Logistics, 50(7), pages 683-701, 2003.
  7. "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.
  8. "Solving linear ordering problems with a combined interior point/simplex cutting plane algorithm", with Brian Borchers, September 1997, revised December 1998. Appeared as Chapter 14, pages 349-366, of High Performance Optimization, edited by H. Frenk et al., Kluwer Academic Publishers, 2000.
    You can also download the generator to create the thirty instances described in this paper: linear ordering problem generator.
  9. "Computational experience with an interior point cutting plane algorithm", SIAM Journal on Optimization, volume 10(4), pages 1212-1227, 2000.
  10. "An interior point cutting plane algorithm for Ising spin glass problems", postscript file, 67503 bytes or pdf format, July 1997. 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.
  11. "Solving real world linear ordering problems using a primal-dual interior point cutting plane method," (with Brian Borchers). To see the abstract, click here . Annals of OR, 1996, Vol. 62, pp. 253-276. Here is the final draft of the paper.
  12. "Solving combinatorial optimization problems using Karmarkar's algorithm," (with Mike Todd) Mathematical Programming, 1992, Vol. 56, pp. 245-284.

Interior point cutting plane methods (theoretical results)

  1. Properties of a cutting plane method for semidefinite programming, with Kartik Krishnan Sivaramakrishnan, September 2007. Journal submission. (This is a dramatically rewritten update of an earlier technical report from 2003.)
  2. 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.
  3. An analytic center cutting plane approach for conic programming, with Luc Basescu, June 22, 2005. Accepted for publication in Mathematics of Operations Research.
  4. A second-order cone cutting surface method: complexity and application, with Mohammad Oskoorouchi, August 7, 2006. Accepted for publication in Computational Optimization and Applications.
  5. 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.
  6. 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.
  7. Polynomial interior point cutting plane methods, Optimization Methods and Software, 18(5), pages 507-534, 2003.
  8. "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.
  9. "A long step cutting plane algorithm that uses the volumetric barrier," (postscript file), with Srini Ramaswamy 1995. (248601 bytes.)
  10. "A Long-Step, Cutting Plane Algorithm for Linear and Convex Programming," (with Srini Ramaswamy), Annals of OR, Volume 99, 2000, pages 95-122.
  11. "Fixing Variables and Generating Classical Cutting Planes when using an Interior Point Branch and Cut Method to solve Integer Programming Problems," 1994. (167337 bytes.) "European Journal of Operational Research," Volume 97, pages 139-148, 1997.
  12. "An Interior Point Column Generation Method For Linear Programming Using Shifted Barriers," SIAM Journal On Optimization, 1994 Vol. 4, pp. 423-440.
  13. "Solving combinatorial optimization problems using Karmarkar's algorithm," (with Mike Todd) Mathematical Programming, 1992, Vol. 56, pp. 245-284.

Semidefinite programming

  1. Properties of a cutting plane method for semidefinite programming, with Kartik Krishnan Sivaramakrishnan, September 2007. Journal submission. (This is a dramatically rewritten update of an earlier technical report from 2003.)
  2. 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.
  3. An analytic center cutting plane approach for conic programming, with Luc Basescu, June 22, 2005. Accepted for publication in Mathematics of Operations Research.
  4. A second-order cone cutting surface method: complexity and application, with Mohammad Oskoorouchi, August 7, 2006. Accepted for publication in Computational Optimization and Applications.
  5. "Semidefinite cut-and-price approaches for the maxcut problem," with Kartik Krishnan, Computational Optimization and Applications, Volume 33(1), pages 51-71, 2006.
  6. A semidefinite programming heuristic for quadratic programming problems with complementarity constraints with Steve Braun, Computational Optimization and Applications 31(1), 2005, pages 5-29.
  7. 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.
  8. "Semi-infinite linear programming approaches to semidefinite programming problems," with Kartik Krishnan, August 2001. Appeared in Fields Institute Communications Series, Volume 37, Novel approaches to hard discrete optimization problems, edited by P. Pardalos and H. Wolkowicz, AMS, pages 123-142, 2003.
  9. "A linear programming approach to semidefinite programming problems," with Kartik Krishnan, May 2001.
  10. "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.

Branch and bound methods

  1. "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.
  2. "Computational Experience of an Interior-Point SQP Algorithm in a Parallel Branch-and-Bound Framework", with Eva K. Lee. September 1997, revised December 1998. Appeared as Chapter 13, pages 329-347, of High Performance Optimization, edited by H. Frenk et al., Kluwer Academic Publishers, 2000.
  3. "Computational experience of an interior point algorithm in a parallel branch-and-cut framework", (postscript or pdf), with Eva K. Lee. 1996, appeared in the Proceedings of the Eighth SIAM Conference on Parallel Processing for Scientific Computing (CD-ROM).
  4. "A comparison of branch and bound and outer approximation methods for 0-1 MINLPs," with Brian Borchers. Computers and Operations Research, 24 (1997) 699-701.
  5. "An Improved Branch And Bound Algorithm For Mixed Integer Nonlinear Programs," (with Brian Borchers) Computers and Operations Research, 1994, Vol. 21, pp. 359-367.
  6. "Using an Interior Point Method in a Branch and Bound Algorithm for Integer Programming," (with Brian Borchers) 1991, revised 1992.

Polyhedral theory and branch-and-cut

  1. 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.
  2. The Clique Partition Problem with Minimum Clique Size Requirement, with Xiaoyun Ji, May 5, 2005.
  3. 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.
  4. "Semidefinite cut-and-price approaches for the maxcut problem," with Kartik Krishnan, Computational Optimization and Applications, Volume 33(1), pages 51-71, 2006.
  5. "Branch-and-cut for the k-way equipartition problem,", January 2001.
  6. "Realignment in the National Football League," Naval Research Logistics, 50(7), pages 683-701, 2003.
  7. "Solving MAX-SAT and Weighted MAX-SAT Problems Using Branch-and-Cut", February 28, 1998. With Steve Joy and Brian Borchers.
  8. "A branch-and-cut algorithm for MAX-SAT and weighted MAX-SAT," (postscript or pdf), March 1996, with Steve Joy and Brian Borchers. The abstract is also available. Appeared in Satisfiability Problem: Theory and Applications, AMS/DIMACS Series in Discrete Mathematics and Applications, Volume 35, April 1997. There is a related paper on "A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems" (Journal of Combinatorial Optimization, 2(4):299--306, 1999) that uses the Davis-Putnam-Loveland algorithm, by Brian Borchers and Judith Furman. The DPL MAXSAT source code and some MAXSAT problems are available as tarred, gzipped files.
  9. "Analyzing and Exploiting the Structure of the Constraints in the ILP Approach to the Scheduling Problem," (pdf, ps) (with S. Chaudhuri and R. A. Walker), IEEE Transactions on VLSI, Vol. 2(4), 1994, pp. 456-471.
  10. "The Structure of Assignment, Precedence, and Resource Constraints in the ILP Approach to the Scheduling Problem," (pdf, ps) (with S. Chaudhuri and R. A. Walker), 1993 IEEE International Conference on Computer Design, ICCD '93, pp. 25-29.

Interior point methods for linear programming

  1. 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.
  2. "A Primal-Dual Interior Point Method for Linear Programming Based on a Weighted Barrier Function," (with Zhao-Yang Cheng), Journal of Optimization Theory and Applications, 87 (1995), pp. 301-321.
  3. "Updating Lower Bounds When Using Karmarkar Projective Algorithm For Linear Programming," Journal Of Optimization Theory And Applications, 1993, Vol. 78, pp. 127-142.

Stochastic programming

  1. "A tabu search procedure for target-matching in financial scenario generation," (with Adam J. Berger, John Mulvey, and Bob Rush), Dec 5, 1997. (Abstract.)
  2. "Stratified filtered sampling in stochastic optimization," (with John Mulvey, Bob Rush, and Tom Willemain), May 23, 1997, revised January 1999. Journal of Applied Mathematics and Decision Sciences, 4(1), 2000, pp. 17-38.

Nonlinear programming

  1. An LPCC Approach to Nonconvex Quadratic Programs with Jing Hu and Jong-Shi Pang. May 2008. Journal submission.
  2. 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.
  3. Rebalancing an Investment Portfolio in the Presence of Convex Transaction Costs, with Steve Braun, December 17, 2004.
  4. A semidefinite programming heuristic for quadratic programming problems with complementarity constraints with Steve Braun, Computational Optimization and Applications 31(1), 2005, pages 5-29.
  5. Rebalancing an Investment Portfolio in the Presence of Transaction Costs, with Steve Braun, November 28, 2002. Revised December 16, 2003.
  6. An ellipsoid algorithm for equality-constrained nonlinear programs, with Sharmila Shah and Mike Kupferschmid. January 1, 1999, revised August 18, 1999. Computers and Operations Research, 28(1), 2001, pages 85-92.

Applications

  1. 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.
  2. Optimal Placement of Stereo Sensors, with Mohammad Al Hasan and Krishna K. Ramachandran. Optimization Letters, Volume 2, Number 1, pages 99-111, January 2008.
  3. 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.
  4. 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.
  5. Multivehicle routing with profits and competition, with Ellen Thorson and Jose Holguín-Veras, October 2005. Journal submission.
  6. 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.
  7. 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.
  8. 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.
  9. 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.
  10. Rebalancing an Investment Portfolio in the Presence of Convex Transaction Costs, with Steve Braun, December 17, 2004.
  11. 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.
  12. 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.
  13. 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.
  14. Restoration of services in interdependent infrastructure systems: a network flows approach, with Earl (Rusty) Lee, David Mendonça, and Al Wallace. June 2003.
  15. Rebalancing an Investment Portfolio in the Presence of Transaction Costs, with Steve Braun, November 28, 2002. Revised December 16, 2003.
  16. 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.
  17. "Realignment in the National Football League," Naval Research Logistics, 50(7), pages 683-701, 2003.
  18. "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.

Integer programming: surveys of classical approaches

  1. Branch-and-cut methods for combinatorial optimization problems, in the Handbook of Applied Optimization, Oxford University Press, 2002.
  2. 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.
  3. Cutting plane algorithms for integer programming, in the Encyclopedia of Optimization, Volume II, pages 525-533, Kluwer Academic Publishers, August 2001.
  4. Branch-and-cut algorithms for integer programming, in the Encyclopedia of Optimization, Volume II, pages 519-525, Kluwer Academic Publishers, August 2001.

My MathSciNet references.

RPI Math
Back to John Mitchell's homepage