John E. Mitchell
Orcid: 0000-0001-5087-4679Affiliations:
- Rensselaer Polytechnic Institute, Department of Mathematical Sciences, Troy, NY, USA
According to our database1,
John E. Mitchell
authored at least 62 papers
between 1992 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Networks, April, 2024
Multi-period max flow network interdiction with restructuring for disrupting domestic sex trafficking networks.
Ann. Oper. Res., April, 2024
2023
Eur. J. Oper. Res., July, 2023
2022
Optimizing edge sets in networks to produce ground truth communities based on modularity.
Networks, 2022
Location of urban micro-consolidation centers to reduce the social cost of last-mile deliveries of cargo: A heuristic approach.
Networks, 2022
2021
CoRR, 2021
Comput. Optim. Appl., 2021
2020
An enhanced logical benders approach for linear programs with complementarity constraints.
J. Glob. Optim., 2020
Optimizing the recovery of disrupted single-sourced multi-echelon assembly supply chain networks.
IISE Trans., 2020
Proceedings of the International Conference on Rebooting Computing, 2020
2019
Math. Program. Comput., 2019
2018
Comput. Optim. Appl., 2018
A fair division approach to humanitarian logistics inspired by conditional value-at-risk.
Ann. Oper. Res., 2018
2017
Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems.
Discret. Optim., 2017
Proceedings of the Summer Simulation Multi-Conference, 2017
2016
A Dynamic Spatial Price Equilibrium Model of Integrated Urban Production-Transportation Operations Considering Freight Delivery Tours.
Transp. Sci., 2016
Applying ranking and selection procedures to long-term mitigation for improved network restoration.
EURO J. Comput. Optim., 2016
2015
An algorithm for global solution to bi-parametric linear complementarity constrained linear programs.
J. Glob. Optim., 2015
Eur. J. Oper. Res., 2015
Global resolution of the support vector machine regression parameters selection problem with LPCC.
EURO J. Comput. Optim., 2015
2014
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
2013
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
Eur. J. Oper. Res., 2013
Comput. Optim. Appl., 2013
Integrating restoration and scheduling decisions for disrupted interdependent infrastructure systems.
Ann. Oper. Res., 2013
2012
Restoring infrastructure systems: An integrated network design and scheduling (INDS) problem.
Eur. J. Oper. Res., 2012
2011
Proceedings of the 2011 IEEE International Conference on Intelligence and Security Informatics, 2011
2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
Comput. Optim. Appl., 2009
2008
SIAM J. Optim., 2008
Math. Oper. Res., 2008
Math. Methods Oper. Res., 2008
2007
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
2006
Optim. Methods Softw., 2006
A Semidefinite Programming Based Polyhedral Cut and Price Approach for the Maxcut Problem.
Comput. Optim. Appl., 2006
Proceedings of the Handbook of Optimization in Telecommunications, 2006
2005
A Semidefinite Programming Heuristic for Quadratic Programming Problems with Complementarity Constraints.
Comput. Optim. Appl., 2005
2004
Assessing Vulnerability of Proposed Designs for Interdependent Infrastructure Systems.
Proceedings of the 37th Hawaii International Conference on System Sciences (HICSS-37 2004), 2004
2003
2001
Restarting after Branching in the SDP Approach to MAX-CUT and Similar Combinatorial Optimization Problems.
J. Comb. Optim., 2001
2000
SIAM J. Optim., 2000
Comput. Oper. Res., 2000
Ann. Oper. Res., 2000
1997
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
1996
Solving real-world linear ordering problems using a primal-dual interior point cutting plane method.
Ann. Oper. Res., 1996
Proceedings of the Satisfiability Problem: Theory and Applications, 1996
1994
An Interior Point Column Generation Method for Linear Programming Using Shifted Barriers.
SIAM J. Optim., 1994
Comput. Oper. Res., 1994
1992
Math. Program., 1992