John E. Mitchell

According to our database1, John E. Mitchell authored at least 54 papers between 1992 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.



In proceedings 
PhD thesis 


Online presence:



Scheduling of tasks with effectiveness precedence constraints.
Optim. Lett., 2020

Two Relaxation Methods for Rank Minimization Problems.
J. Optim. Theory Appl., 2020

An enhanced logical benders approach for linear programs with complementarity constraints.
J. Glob. Optim., 2020

Training Deep Neural Networks with Constrained Learning Parameters.
CoRR, 2020

Low-Rank Factorization for Rank Minimization with Nonconvex Regularizers.
CoRR, 2020

Solving linear programs with complementarity constraints using branch-and-cut.
Math. Program. Comput., 2019

A penalty method for rank minimization problems in symmetric matrices.
Comput. Optim. Appl., 2018

A fair division approach to humanitarian logistics inspired by conditional value-at-risk.
Ann. Oper. Res., 2018

Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems.
Discret. Optim., 2017

Restoration decision making for a supply chain network under cyber attack.
Proceedings of the Summer Simulation Multi-Conference, 2017

On conic QPCCs, conic QCQPs and completely positive programs.
Math. Program., 2016

Applying ranking and selection procedures to long-term mitigation for improved network restoration.
EURO J. Comput. Optim., 2016

An algorithm for global solution to bi-parametric linear complementarity constrained linear programs.
J. Glob. Optim., 2015

Interdependent network restoration: On the value of information-sharing.
Eur. J. Oper. Res., 2015

Global resolution of the support vector machine regression parameters selection problem with LPCC.
EURO J. Comput. Optim., 2015

Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs.
Optim. Methods Softw., 2014

Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints.
Optim. Lett., 2014

A Globally Convergent Probability-One Homotopy for Linear Programs with Linear Complementarity Constraints.
SIAM J. Optim., 2013

Rebalancing an investment portfolio in the presence of convex transaction costs, including market impact costs.
Optim. Methods Softw., 2013

p-Hub approach for the optimal park-and-ride facility location problem.
Eur. J. Oper. Res., 2013

On convex quadratic programs with linear complementarity constraints.
Comput. Optim. Appl., 2013

Integrating restoration and scheduling decisions for disrupted interdependent infrastructure systems.
Ann. Oper. Res., 2013

An LPCC approach to nonconvex quadratic programs.
Math. Program., 2012

On linear programs with linear complementarity constraints.
J. Glob. Optim., 2012

Restoring infrastructure systems: An integrated network design and scheduling (INDS) problem.
Eur. J. Oper. Res., 2012

Decision modeling for resilient infrastructures.
Proceedings of the 2011 IEEE International Conference on Intelligence and Security Informatics, 2011

Integer Programming: Cutting Plane Algorithms.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Integer Programming: Branch and Cut Algorithms.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Integer Programming: Branch and Bound Methods.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

A second-order cone cutting surface method: complexity and application.
Comput. Optim. Appl., 2009

On the Global Solution of Linear Programs with Linear Complementarity Constraints.
SIAM J. Optim., 2008

Optimal placement of stereo sensors.
Optim. Lett., 2008

An Analytic Center Cutting Plane Approach for Conic Programming.
Math. Oper. Res., 2008

Selective Gram-Schmidt orthonormalization for conic cutting surface algorithms.
Math. Methods Oper. Res., 2008

Restoration of Services in Interdependent Infrastructure Systems: A Network Flows Approach.
IEEE Trans. Syst. Man Cybern. Part C, 2007

Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement.
Discret. Optim., 2007

A unifying framework for several cutting plane methods for semidefinite programming.
Optim. Methods Softw., 2006

A Semidefinite Programming Based Polyhedral Cut and Price Approach for the Maxcut Problem.
Comput. Optim. Appl., 2006

Interior Point Methods for Large-Scale Linear Programming.
Proceedings of the Handbook of Optimization in Telecommunications, 2006

A Semidefinite Programming Heuristic for Quadratic Programming Problems with Complementarity Constraints.
Comput. Optim. Appl., 2005

Assessing Vulnerability of Proposed Designs for Interdependent Infrastructure Systems.
Proceedings of the 37th Hawaii International Conference on System Sciences (HICSS-37 2004), 2004

Polynomial interior point cutting plane methods.
Optim. Methods Softw., 2003

Restarting after Branching in the SDP Approach to MAX-CUT and Similar Combinatorial Optimization Problems.
J. Comb. Optim., 2001

Computational Experience with an Interior Point Cutting Plane Algorithm.
SIAM J. Optim., 2000

Stratified filtered sampling in stochastic optimization.
Adv. Decis. Sci., 2000

An ellipsoid algorithm for equality-constrained nonlinear programs.
Comput. Oper. Res., 2000

A Long-Step, Cutting Plane Algorithm for Linear and Convex Programming.
Ann. Oper. Res., 2000

A computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs.
Comput. Oper. Res., 1997

Computational Experience of an Interior-Point Algorithm in a Parallel Branch-and-Cut Framework.
Proceedings of the Eighth SIAM Conference on Parallel Processing for Scientific Computing, 1997

Solving real-world linear ordering problems using a primal-dual interior point cutting plane method.
Ann. Oper. Res., 1996

A branch and cut algorithm for MAX-SAT and weighted MAX-SAT.
Proceedings of the Satisfiability Problem: Theory and Applications, 1996

An Interior Point Column Generation Method for Linear Programming Using Shifted Barriers.
SIAM J. Optim., 1994

An improved branch and bound algorithm for mixed integer nonlinear programs.
Comput. Oper. Res., 1994

Solving combinatorial optimization problems using Karmarkar's algorithm.
Math. Program., 1992