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.
Many of these papers are also available from my Google Scholar page.
Some papers appear in more than one category below.


Topics:

Mathematical programs with complementarity constraints (MPECs)

  1. Two relaxation methods for rank minimization problems, with April Sagan and Xin Shen. Journal of Optimization Theory and Applications, 186, 806-825, 2020.
  2. An enhanced logical Benders approach for linear programs with complementarity constraints, with Francisco Jara-Moroni, Jong-Shi Pang, and Andreas Wächter. Journal of Global Optimization, 77, pages 687-714, 2020.
  3. A Penalty Method for Rank Minimization Problems in Symmetric Matrices with Xin Shen. DOI: 10.1007/s10589-018-0010-6. Computational Optimization and Applications, 71(2), pages 353-380, 2018. pdf reprint, (Online access to this article has been shared via Springer Nature SharedIt.)
  4. Solving Linear Programs with Complementarity Constraints using Branch-and-Cut with Bin Yu and Jong-Shi Pang. DOI: 10.1007/s12532-018-0149-2. Mathematical Programming Computation, 11(2), pages 267-310, 2019. (pdf reprint available as part of the Springer Nature SharedIt initiative.)
  5. Global resolution of the support vector machine regression parameters selection problem with LPCC, by Yu-Ching Lee, Jong-Shi Pang. and John E. Mitchell. EURO Journal on Computational Optimization, 3(3), pages 197-261, 2015. (Online access to this article has been shared via Springer Nature SharedIt.)
  6. An algorithm for global solution to bi-parametric linear complementarity constrained linear programs, with Yu-Ching Lee and Jong-Shi Pang. Journal of Global Optimization, 62(2), pages 263-297, 2015.
  7. On conic QPCCs, conic QCQPs and completely positive programs with Lijie Bai and Jong-Shi Pang, Mathematical Programming, 159(1), pages 109-136, 2016. (Online access to this article has been shared via Springer Nature SharedIt.)
  8. Complementarity Formulations of ℓ0-norm Optimization Problems with Mingbin Feng, Jong-Shi Pang, Xin Shen, and Andreas Wächter. Pacific Journal of Optimization, Volume 14, Number 2, 273-305, 2018.
  9. Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints with Lijie Bai and Jong-Shi Pang. Optimization Letters, 8(3), pages 811-822, 2014.
  10. On Convex Quadratic Programs with Linear Complementarity Constraints with Lijie Bai and Jong-Shi Pang. Computational Optimization and Applications, 54(3), pages 517-554, April 2013. (Online first, July 18, 2012.)
  11. A Globally Convergent Probability-One Homotopy for Linear Programs with Linear Complementarity Constraints with Layne T. Watson, Stephen C. Billups, and David R. Easterling. SIAM Journal on Optimization, 23(2), 1167-1188, 2013.
  12. Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints, with Jong-Shi Pang and Bin Yu. February 2011. Submitted.
  13. On Linear Programs with Linear Complementarity Constraints with Jing Hu, Jong-Shi Pang, and Bin Yu. Journal of Global Optimization, 53(1), pages 29-51, 2012.
  14. An LPCC Approach to Nonconvex Quadratic Programs with Jing Hu and Jong-Shi Pang. Mathematical Programming, 133(1-2), pages 243-277, 2012.
  15. 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.
  16. A semidefinite programming heuristic for quadratic programming problems with complementarity constraints with Steve Braun, Computational Optimization and Applications 31(1), 2005, pages 5-29.

Interior point methods for integer programming (survey papers)

  1. Cutting plane methods and subgradient methods. Chapter 2, pages 34-61, in "TutORials in Operations Research, INFORMS 2009", edited by M. Oskoorouchi, October 2009.
  2. 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.
  3. Polynomial interior point cutting plane methods, Optimization Methods and Software, 18(5), pages 507-534, 2003.
  4. "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.
  5. "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.
  6. "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. Computational Optimization and Applications 43(3), pages 379-409, 2009.
  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, Pacific Journal of Optimization,Volume 8(4), pages 779-802, 2012.
  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. Mathematics of Operations Research, Volume 33(3), pages 529-551, 2008.
  4. A second-order cone cutting surface method: complexity and application, with Mohammad Oskoorouchi, Computational Optimization and Applications 43(3), pages 379-409, 2009.
  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 and rank minimization

  1. Provable low rank plus sparse matrix separation via nonconvex regularizers, with April Sagan. Journal submission, September 2021.
  2. Low-Rank Factorization for Rank Minimization with Nonconvex Regularizers, with April Sagan. Computational Optimization and Applications, 79, pages 273-300, 2021.
  3. Two relaxation methods for rank minimization problems, with April Sagan and Xin Shen. Journal of Optimization Theory and Applications, 186, 806-825, 2020.
  4. A Penalty Method for Rank Minimization Problems in Symmetric Matrices with Xin Shen. DOI: 10.1007/s10589-018-0010-6. Computational Optimization and Applications, 71(2), pages 353-380, 2018. pdf reprint, (Online access to this article has been shared via Springer Nature SharedIt.)
  5. Approximation Algorithms from Inexact Solutions to Semidefinite Programming Relaxations of Combinatorial Optimization Problems with Timothy Lee. Online first, 13 May 2016, in Discrete Optimization.
  6. Properties of a cutting plane method for semidefinite programming, with Kartik Krishnan Sivaramakrishnan, Pacific Journal of Optimization,Volume 8(4), pages 779-802, 2012.
  7. Cutting plane methods and subgradient methods. Chapter 2, pages 34-61, in "TutORials in Operations Research, INFORMS 2009", edited by M. Oskoorouchi, October 2009.
  8. 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.
  9. An analytic center cutting plane approach for conic programming, with Luc Basescu. Mathematics of Operations Research, Volume 33(3), pages 529-551, 2008.
  10. A second-order cone cutting surface method: complexity and application, with Mohammad Oskoorouchi, Computational Optimization and Applications 43(3), pages 379-409, 2009.
  11. "Semidefinite cut-and-price approaches for the maxcut problem," with Kartik Krishnan, Computational Optimization and Applications, Volume 33(1), pages 51-71, 2006.
  12. A semidefinite programming heuristic for quadratic programming problems with complementarity constraints with Steve Braun, Computational Optimization and Applications 31(1), 2005, pages 5-29.
  13. 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.
  14. "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.
  15. "A linear programming approach to semidefinite programming problems," with Kartik Krishnan, May 2001.
  16. "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. Increasing Driver Flexibility through Personalized Menus and Incentives in Ridesharing and Crowdsourced Delivery Platforms, with Hannah Horner and Jennifer Pazour. Journal submission, July 2021.
  2. Optimizing driver menus under stochastic selection behaviour for ridesharing and crowdsourced delivery, with Hannah Horner and Jennifer Pazour. Transportation Research Part E, Volume 153, 102419, September 2021.
  3. Improving Network Durability using Approximate Dynamic Programming, with Erik Hammel, Thomas C. Sharkey. and William A. Wallace. April 2016. Journal submission.
  4. "A tabu search procedure for target-matching in financial scenario generation," (with Adam J. Berger, John Mulvey, and Bob Rush), Dec 5, 1997. (Abstract.)
  5. "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. Provable low rank plus sparse matrix separation via nonconvex regularizers, with April Sagan. Journal submission, September 2021.
  2. Low-Rank Factorization for Rank Minimization with Nonconvex Regularizers, with April Sagan. Computational Optimization and Applications, 79, pages 273-300, 2021.
  3. Two relaxation methods for rank minimization problems, with April Sagan and Xin Shen. Journal of Optimization Theory and Applications, 186, 806-825, 2020.
  4. A Penalty Method for Rank Minimization Problems in Symmetric Matrices with Xin Shen. DOI: 10.1007/s10589-018-0010-6. Computational Optimization and Applications, 71(2), pages 353-380, 2018. pdf reprint, (Online access to this article has been shared via Springer Nature SharedIt.)
  5. On conic QPCCs, conic QCQPs and completely positive programs with Lijie Bai and Jong-Shi Pang, Mathematical Programming, 159(1), pages 109-136, 2016. (Online access to this article has been shared via Springer Nature SharedIt.)
  6. Complementarity Formulations of ℓ0-norm Optimization Problems with Mingbin Feng, Jong-Shi Pang, Xin Shen, and Andreas Wächter. Pacific Journal of Optimization, Volume 14, Number 2, 273-305, 2018.
  7. Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints with Lijie Bai and Jong-Shi Pang. Optimization Letters, 8(3), pages 811-822, 2014.
  8. Convex Quadratic Relaxations of Nonconvex Quadratically Constrained Quadratic Programs with Jong-Shi Pang and Bin Yu. Optimization Methods and Software, 29(1), pages 120-136, 2014.
  9. An LPCC Approach to Nonconvex Quadratic Programs with Jing Hu and Jong-Shi Pang. Mathematical Programming, 133(1-2), pages 243-277, 2012.
  10. 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.
  11. Rebalancing an Investment Portfolio in the Presence of Convex Transaction Costs and Market Impact Costs with Stephen Braun, Optimization Methods and Software, 28(3), 523-542, 2013.
  12. Rebalancing an Investment Portfolio in the Presence of Convex Transaction Costs, with Steve Braun, December 17, 2004.
  13. A semidefinite programming heuristic for quadratic programming problems with complementarity constraints with Steve Braun, Computational Optimization and Applications 31(1), 2005, pages 5-29.
  14. Rebalancing an Investment Portfolio in the Presence of Transaction Costs, with Steve Braun, November 28, 2002. Revised December 16, 2003.
  15. 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.

Infrastructure Systems

  1. Shortest path network interdiction with asymmetric uncertainty, with She'ifa Punla-Green, Jared Gearhart, William Hart, and Cynthia Phillips. Journal submission, March 2022.
  2. Optimizing edge sets in networks to produce ground truth communities based on modularity, with Daniel Kosmas, Thomas C. Sharkey, and Boleslaw K. Szymanski. Networks 80(2), pages 152-177, 2022.
  3. Interdicting restructuring networks with applications in illicit trafficking, with Daniel Kosmas, Thomas C. Sharkey, Kayse Lee Maass, and Lauren Martin. European Journal of Operational Research, online first, 29 November 2022.
  4. Multi-Period Max Flow Network Interdiction with Restructuring for Disrupting Domestic Sex Trafficking Networks with Daniel Kosmas, Thomas C. Sharkey, Kayse Lee Maass, and Lauren Martin. Annals of Operations Research, online first, 2 December 2022.
  5. Towards the development of quantitative resilience indices for Multi-Echelon Assembly Supply Chains, with Huy Nguyen, Thomas C. Sharkey, Shamus Wheeler, and William (Al) Wallace. Omega, Volume 99, 102199, 2021.
  6. Optimizing the recovery of disrupted single-source multi-echelon assembly supply chain networks, civil and social infrastructure systems during an extreme event, with Huy Nguyen, Thomas C. Sharkey, and William (Al) Wallace. IISE Transactions, 52(7), pages 703-720, 2020.
  7. CLARC: An artifical community for modeling the effects of extreme events on interdependent civil and social infrastructure systems, with Richard G. Little, Ryan Loggins, Thomas C. Sharkey, and William (Al) Wallace. Journal of Infrastructure Systems, 26(1), 04019041, 2020.
  8. Scheduling of tasks with effectiveness precedence constraints with Emily A. Heath and Thomas C. Sharkey. DOI: 10.1007/s11590-019-01440-x. Optimization Letters. 14(1), pages 37-49, 2020.
  9. CRISIS: Modeling the restoration of interdependent civil and social infrastructure systems following an extreme event, with Richard G. Little, Ryan Loggins, Thomas C. Sharkey, and William (Al) Wallace. DOI: 10.1061/(ASCE)NH.1527-6996.0000326 Natural Hazards Review, 20(3), August 2019.
  10. Improving Network Durability using Approximate Dynamic Programming, with Erik Hammel, Thomas C. Sharkey. and William (Al) Wallace. April 2016. Journal submission.
  11. Applying Ranking and Selection Procedures to Long-Term Mitigation for Improved Network Restoration with Emily Heath and Thomas C. Sharkey. EURO Journal on Computational Optimization, 4(3), pages 447-481, 2016. (Online access to this article has been shared via Springer Nature SharedIt.)
  12. A dynamic spatial price equilibrium model of integrated urban production-transportation operations considering freight delivery tours, with José Holguin-Veras, Ning Xu, and Miguel Jaller. Transportation Science, 50(2), pages 489-519, 2016.
  13. Interdependent Network Restoration: On the Value of Information-Sharing with Thomas C. Sharkey, Burak Cavdaroglu, Huy Nguyen, Jonathan Holman, and William (Al) Wallace. European Journal of Operational Research, 244(1), pages 309-321, 2015.
  14. Identification and Classification of Restoration Interdependencies in the Wake of Hurricane Sandy with Thomas C. Sharkey, Sarah Nurre, Huy Nguyen, Joe H. Chow, and William (Al) Wallace. ASCE's Journal of Infrastructure Systems, 22(1): 04015007, 2016.
  15. Increasing the Resiliency of Local Supply Chain Distribution Networks against Multiple Hazards, with Sarah Nurre and Thomas C. Sharkey. Supply Chain Management and Logistics: Innovative Strategies and Practical Solutions, edited by Zhe Liang, Wanpracha Art Chaovalitwongse, and Leyuan Shi. Published by CRC Press, Taylor & Francis Group, November 2015.
  16. Restoring Infrastructure Systems: An Integrated Network Design and Scheduling Problem, with Sarah G. Nurre, Burak Cavdaroglu, Thomas C. Sharkey, and William (Al) Wallace. European Journal of Operational Research, Volume 223(3), pages 794-806, 16 December 2012.
  17. An Interdependent Layered Network Model for a Resilient Supply Chain with Jing Gong, Ananth Krishnamurthy, and William A. Wallace, May 2011. Omega, 46, pages 104-116, 2014.
  18. "Decision modeling for resilient infrastructures", with Jing Gong and William A. Wallace, February 2011. Accepted for publication in the Proceedings of ISI 2011.
  19. "Decomposition methods for restoring infrastructure systems", with Burak Cavdaroglu, Sarah G. Nurre, Thomas C. Sharkey, and William A. Wallace, Proceedings of ICVRAM, April 2011.
  20. Integrating Restoration and Scheduling Decisions for Disrupted Interdependent Infrastructure Systems with Burak Cavdaroglu, Erik Hammel, Thomas C. Sharkey, and William A. Wallace. Annals of Operations Research, 203, pages 279-294, March 2013. (Online first, September 5, 2011.)
  21. Logic-based Multi-Objective Optimization for Restoration Planning with Jing Gong, Rusty Lee, and Al Wallace. Chapter 11, Optimization and Logistics Challenges in the Enterprise, Springer, New York, 2009, edited by W. Chaovalitwongse, K.C. Furman, and P.M. Pardalos.
  22. Network Flow Approaches for Analyzing and Managing Disruptions to Interdependent Infrastructure Systems (pdf draft), with Rusty Lee and Al Wallace. In the "Wiley Handbook of Science and Technology for Homeland Security", edited by John G. Voeller, Volume 2. John Wiley & Sons, Inc, Hoboken, NJ. 2009, pp 1419-1428. (Also accessible here.)
  23. 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.
  24. 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.
  25. 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.
  26. 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.
  27. 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.
  28. Restoration of services in interdependent infrastructure systems: a network flows approach, with Earl (Rusty) Lee, David Mendonça, and Al Wallace. June 2003.
  29. 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.

Applications

  1. Training deep neural networks with constrained learning parameters, with Prasanna Date, Christopher D. Carothers, James A. Hendler, and Malik Magdon-Ismail. 2020 International Conference on Rebooting Computing (ICRC), pages 107-115, 2020.
  2. Location of urban micro-consolidation centers to reduce social cost of last-mile deliveries of cargo: a heuristic approach, with Mario Arrieta-Prieto, Abdelrahman Ismael, and Carlos Rivera-Gonzalez. Networks, 79(3), pages 292-313, 2022.
  3. Models for restoration decision making for a supply chain network after a cyber attack with Emily A. Heath and Thomas C. Sharkey. DOI: 10.1177/1548512918808410 The Journal of Defense Modeling and Simulation, 17(1), pages 5-19, 2020.
  4. Modeling multimodal transportation network emergency evacuation considering evacuees' cooperative behavior, with Xia Yang and Xuegang (Jeff) Ban. Transportation Research Part A: Policy and Practice. 114, pages 380-397, 2018. Available for free download until September 12, 2018, via this link from Elsevier Share Link.
  5. Optimal districting of disaster areas with Johanna Amaya Leal and Jose Holguin-Veras. November 2016. Journal submission.
  6. A Fair Division Approach to Humanitarian Logistics Incorporating Conditional Value-at-Risk with Amy Givler Chapman. Online first in Annals of OR, 22 September 2016. (Online access to this article has been shared via Springer Nature SharedIt.)
  7. "Urban freight tour models: state of the art and practice" with José Holguin-Veras, Ellen Thorson, Qian Wang, Ning Xu, Carlos Gonzalez-Calderon, and Ivan Sanchez-Diaz.Freight Transport Modelling, edited by Moshe Ben-Akiva, Hilde Meersman and Eddy Van de Voorde, Chapter 17, 2013.
  8. P-hub approach for the optimal park-and-ride facility location problem, with Felipe Aros-Vera and Vladimir Marianov. European Journal of Operational Research, 226(2), pages 277-285, 16 April 2013. (Online first, November 17, 2012.)
  9. Integrated vehicle routing problem with explicit consideration of social costs in humanitarian logistics, with Noel Perez, Jose Holguin-Veras, and Thomas C. Sharkey, August 2010. Submitted.
  10. Optimal Placement of Stereo Sensors, with Mohammad Al Hasan and Krishna K. Ramachandran. Optimization Letters, Volume 2, Number 1, pages 99-111, January 2008.
  11. 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.
  12. Multivehicle routing with profits and competition, with Ellen Thorson and Jose Holguín-Veras, October 2005. Journal submission.
  13. 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.
  14. 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.
  15. Rebalancing an Investment Portfolio in the Presence of Convex Transaction Costs and Market Impact Costs with Stephen Braun, Optimization Methods and Software, 28(3), 523-542, 2013.
  16. Rebalancing an Investment Portfolio in the Presence of Convex Transaction Costs, with Steve Braun, December 17, 2004.
  17. 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.
  18. Rebalancing an Investment Portfolio in the Presence of Transaction Costs, with Steve Braun, November 28, 2002. Revised December 16, 2003.
  19. "Realignment in the National Football League," Naval Research Logistics, 50(7), pages 683-701, 2003.
  20. "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

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