Solving combinatorial optimization problems using Karmarkar's algorithm. - John E. Mitchell 001; Michael J. Todd (Math. Program., 1992)

An improved branch and bound algorithm for mixed integer nonlinear programs. - Brian Borchers; John E. Mitchell 001 (Comput. Oper. Res., 1994)

An Interior Point Column Generation Method for Linear Programming Using Shifted Barriers. - John E. Mitchell 001 (SIAM J. Optim., 1994)

A branch and cut algorithm for MAX-SAT and weighted MAX-SAT. - Steve Joy; John E. Mitchell 001; Brian Borchers (Satisfiability Problem: Theory and Applications, 1996)

Solving real-world linear ordering problems using a primal-dual interior point cutting plane method. - John E. Mitchell 001; Brian Borchers (Ann. Oper. Res., 1996)

Computational Experience of an Interior-Point Algorithm in a Parallel Branch-and-Cut Framework. - Eva K. Lee; John E. Mitchell 001 (PP, 1997)

A computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs. - Brian Borchers; John E. Mitchell 001 (Comput. Oper. Res., 1997)

A Long-Step, Cutting Plane Algorithm for Linear and Convex Programming. - John E. Mitchell 001; Srinivasan Ramaswamy (Ann. Oper. Res., 2000)

An ellipsoid algorithm for equality-constrained nonlinear programs. - Sharmila Shah; John E. Mitchell 001; Michael Kupferschmid (Comput. Oper. Res., 2000)

Stratified filtered sampling in stochastic optimization. - Robert Rush; John M. Mulvey; John E. Mitchell 001; Thomas R. Willemain (Adv. Decis. Sci., 2000)

Computational Experience with an Interior Point Cutting Plane Algorithm. - John E. Mitchell 001 (SIAM J. Optim., 2000)

Restarting after Branching in the SDP Approach to MAX-CUT and Similar Combinatorial Optimization Problems. - John E. Mitchell 001 (J. Comb. Optim., 2001)

Polynomial interior point cutting plane methods. - John E. Mitchell 001 (Optim. Methods Softw., 2003)

Assessing Vulnerability of Proposed Designs for Interdependent Infrastructure Systems. - Earl E. Lee II; John E. Mitchell 001; William A. Wallace (HICSS, 2004)

A Semidefinite Programming Heuristic for Quadratic Programming Problems with Complementarity Constraints. - Stephen Braun; John E. Mitchell 001 (Comput. Optim. Appl., 2005)

Interior Point Methods for Large-Scale Linear Programming. - John E. Mitchell 001; Kris Farwell; Daryn Ramsden (Handbook of Optimization in Telecommunications, 2006)

A Semidefinite Programming Based Polyhedral Cut and Price Approach for the Maxcut Problem. - Kartik Krishnan; John E. Mitchell 001 (Comput. Optim. Appl., 2006)

A unifying framework for several cutting plane methods for semidefinite programming. - Kartik Krishnan; John E. Mitchell 001 (Optim. Methods Softw., 2006)

Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement. - Xiaoyun Ji; John E. Mitchell 001 (Discret. Optim., 2007)

Restoration of Services in Interdependent Infrastructure Systems: A Network Flows Approach. - Earl E. Lee II; John E. Mitchell 001; William A. Wallace (IEEE Trans. Syst. Man Cybern. Part C, 2007)

Selective Gram-Schmidt orthonormalization for conic cutting surface algorithms. - John E. Mitchell 001; Vasile L. Basescu (Math. Methods Oper. Res., 2008)

An Analytic Center Cutting Plane Approach for Conic Programming. - Vasile L. Basescu; John E. Mitchell 001 (Math. Oper. Res., 2008)

Optimal placement of stereo sensors. - Mohammad Al Hasan; Krishna K. Ramachandran; John E. Mitchell 001 (Optim. Lett., 2008)

On the Global Solution of Linear Programs with Linear Complementarity Constraints. - Jing Hu; John E. Mitchell 001; Jong-Shi Pang; Kristin P. Bennett; Gautam Kunapuli (SIAM J. Optim., 2008)

A second-order cone cutting surface method: complexity and application. - Mohammad R. Oskoorouchi; John E. Mitchell 001 (Comput. Optim. Appl., 2009)

Integer Programming: Branch and Bound Methods. - Eva K. Lee; John E. Mitchell 001 (Encyclopedia of Optimization, 2009)

Integer Programming: Branch and Cut Algorithms. - John E. Mitchell 001 (Encyclopedia of Optimization, 2009)

Integer Programming: Cutting Plane Algorithms. - John E. Mitchell 001 (Encyclopedia of Optimization, 2009)

Decision modeling for resilient infrastructures. - Jing Gong; William A. Wallace; John E. Mitchell 001 (ISI, 2011)

Restoring infrastructure systems: An integrated network design and scheduling (INDS) problem. - Sarah G. Nurre; Burak Çavdaroglu; John E. Mitchell 001; Thomas C. Sharkey; William A. Wallace (Eur. J. Oper. Res., 2012)

On linear programs with linear complementarity constraints. - Jing Hu; John E. Mitchell 001; Jong-Shi Pang; Bin Yu (J. Glob. Optim., 2012)

An LPCC approach to nonconvex quadratic programs. - Jing Hu; John E. Mitchell 001; Jong-Shi Pang (Math. Program., 2012)

Integrating restoration and scheduling decisions for disrupted interdependent infrastructure systems. - Burak Çavdaroglu; Erik Hammel; John E. Mitchell 001; Thomas C. Sharkey; William A. Wallace (Ann. Oper. Res., 2013)

On convex quadratic programs with linear complementarity constraints. - Lijie Bai; John E. Mitchell 001; Jong-Shi Pang (Comput. Optim. Appl., 2013)

p-Hub approach for the optimal park-and-ride facility location problem. - Felipe Aros-Vera; Vladimir Marianov; John E. Mitchell 001 (Eur. J. Oper. Res., 2013)

Rebalancing an investment portfolio in the presence of convex transaction costs, including market impact costs. - John E. Mitchell 001; Stephen Braun (Optim. Methods Softw., 2013)

A Globally Convergent Probability-One Homotopy for Linear Programs with Linear Complementarity Constraints. - Layne T. Watson; Stephen C. Billups; John E. Mitchell 001; David R. Easterling (SIAM J. Optim., 2013)

Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints. - Lijie Bai; John E. Mitchell 001; Jong-Shi Pang (Optim. Lett., 2014)

Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs. - John E. Mitchell 001; Jong-Shi Pang; Bin Yu (Optim. Methods Softw., 2014)

Global resolution of the support vector machine regression parameters selection problem with LPCC. - Yu-Ching Lee; Jong-Shi Pang; John E. Mitchell 001 (EURO J. Comput. Optim., 2015)

Interdependent network restoration: On the value of information-sharing. - Thomas C. Sharkey; Burak Çavdaroglu; Huy Nguyen 004; Jonathan Holman; John E. Mitchell 001; William A. Wallace (Eur. J. Oper. Res., 2015)

An algorithm for global solution to bi-parametric linear complementarity constrained linear programs. - Yu-Ching Lee; Jong-Shi Pang; John E. Mitchell 001 (J. Glob. Optim., 2015)

Applying ranking and selection procedures to long-term mitigation for improved network restoration. - Emily A. Heath; John E. Mitchell 001; Thomas C. Sharkey (EURO J. Comput. Optim., 2016)

On conic QPCCs, conic QCQPs and completely positive programs. - Lijie Bai; John E. Mitchell 001; Jong-Shi Pang (Math. Program., 2016)

A Dynamic Spatial Price Equilibrium Model of Integrated Urban Production-Transportation Operations Considering Freight Delivery Tours. - José Holguín-Veras; Ning Xu; Miguel Jaller; John E. Mitchell 001 (Transp. Sci., 2016)

Restoration decision making for a supply chain network under cyber attack. - Emily A. Heath; John E. Mitchell 001; Thomas C. Sharkey (SummerSim, 2017)

Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems. - Timothy Lee; John E. Mitchell 001 (Discret. Optim., 2017)

A fair division approach to humanitarian logistics inspired by conditional value-at-risk. - Amy Givler Chapman; John E. Mitchell 001 (Ann. Oper. Res., 2018)

A penalty method for rank minimization problems in symmetric matrices. - Xin Shen; John E. Mitchell 001 (Comput. Optim. Appl., 2018)

Solving linear programs with complementarity constraints using branch-and-cut. - Bin Yu; John E. Mitchell 001; Jong-Shi Pang (Math. Program. Comput., 2019)

Training Deep Neural Networks with Constrained Learning Parameters. - Prasanna Date; Christopher D. Carothers; John E. Mitchell 001; James A. Hendler; Malik Magdon-Ismail (ICRC, 2020)

Optimizing the recovery of disrupted single-sourced multi-echelon assembly supply chain networks. - Huy Nguyen 004; Thomas C. Sharkey; John E. Mitchell 001; William A. Wallace (IISE Trans., 2020)

An enhanced logical benders approach for linear programs with complementarity constraints. - Francisco Jara-Moroni; John E. Mitchell 001; Jong-Shi Pang; Andreas Wächter (J. Glob. Optim., 2020)

Two Relaxation Methods for Rank Minimization Problems. - April Sagan; Xin Shen; John E. Mitchell 001 (J. Optim. Theory Appl., 2020)

Scheduling of tasks with effectiveness precedence constraints. - Emily A. Heath; John E. Mitchell 001; Thomas C. Sharkey (Optim. Lett., 2020)

Low-rank factorization for rank minimization with nonconvex regularizers. - April Sagan; John E. Mitchell 001 (Comput. Optim. Appl., 2021)

Provable Low Rank Plus Sparse Matrix Separation Via Nonconvex Regularizers. - April Sagan; John E. Mitchell 001 (CoRR, 2021)

Location of urban micro-consolidation centers to reduce the social cost of last-mile deliveries of cargo: A heuristic approach. - Mario Arrieta-Prieto; Abdelrahman Ismael; Carlos Rivera-Gonzalez; John E. Mitchell 001 (Networks, 2022)

Optimizing edge sets in networks to produce ground truth communities based on modularity. - Daniel Kosmas; John E. Mitchell 001; Thomas C. Sharkey; Boleslaw K. Szymanski (Networks, 2022)

Interdicting restructuring networks with applications in illicit trafficking. - Daniel Kosmas; Thomas C. Sharkey; John E. Mitchell 001; Kayse Lee Maass; Lauren Martin (Eur. J. Oper. Res., 2023)

Multi-period max flow network interdiction with restructuring for disrupting domestic sex trafficking networks. - Daniel Kosmas; Thomas C. Sharkey; John E. Mitchell 001; Kayse Lee Maass; Lauren Martin (Ann. Oper. Res., 2024)

Shortest path network interdiction with asymmetric uncertainty. - She'ifa Z. Punla-Green; John E. Mitchell 001; Jared L. Gearhart; William E. Hart; Cynthia A. Phillips (Networks, 2024)