default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn E. Mitchell 0001
Person information
- affiliation: Rensselaer Polytechnic Institute, Department of Mathematical Sciences, Troy, NY, USA
Other persons with the same name
- John E. Mitchell 0002
![[0000-0002-0710-5580]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-0710-5580")
— University College London, Department of Electronic and Electrical Engineering, UK (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j51]Daniel Kosmas, Thomas C. Sharkey, John E. Mitchell, Kayse Lee Maass, Lauren Martin:
Multi-period max flow network interdiction with restructuring for disrupting domestic sex trafficking networks. Ann. Oper. Res. 335(2): 797-860 (2024)- [j50]She'ifa Z. Punla-Green, John E. Mitchell, Jared L. Gearhart, William E. Hart, Cynthia A. Phillips:
Shortest path network interdiction with asymmetric uncertainty. Networks 83(3): 605-623 (2024) - 2023
- [j49]Daniel Kosmas, Thomas C. Sharkey, John E. Mitchell, Kayse Lee Maass, Lauren Martin:
Interdicting restructuring networks with applications in illicit trafficking. Eur. J. Oper. Res. 308(2): 832-851 (2023) - 2022
- [j48]Mario Arrieta-Prieto, Abdelrahman Ismael, Carlos Rivera-Gonzalez, John E. Mitchell:
Location of urban micro-consolidation centers to reduce the social cost of last-mile deliveries of cargo: A heuristic approach. Networks 79(3): 292-313 (2022) - [j47]Daniel Kosmas, John E. Mitchell, Thomas C. Sharkey, Boleslaw K. Szymanski:
Optimizing edge sets in networks to produce ground truth communities based on modularity. Networks 80(2): 152-177 (2022) - 2021
- [j46]April Sagan, John E. Mitchell:
Low-rank factorization for rank minimization with nonconvex regularizers. Comput. Optim. Appl. 79(2): 273-300 (2021) - [i4]Daniel Kosmas, John E. Mitchell, Thomas C. Sharkey, Boleslaw K. Szymanski:
Optimizing Edge Sets in Networks to Produce Ground Truth Communities Based on Modularity. CoRR abs/2103.09351 (2021) - [i3]April Sagan, John E. Mitchell:
Provable Low Rank Plus Sparse Matrix Separation Via Nonconvex Regularizers. CoRR abs/2109.12713 (2021) - 2020
- [j45]Huy Nguyen, Thomas C. Sharkey, John E. Mitchell, William A. Wallace:
Optimizing the recovery of disrupted single-sourced multi-echelon assembly supply chain networks. IISE Trans. 52(7): 703-720 (2020) - [j44]Francisco Jara-Moroni, John E. Mitchell, Jong-Shi Pang, Andreas Wächter:
An enhanced logical benders approach for linear programs with complementarity constraints. J. Glob. Optim. 77(4): 687-714 (2020) - [j43]April Sagan, Xin Shen, John E. Mitchell:
Two Relaxation Methods for Rank Minimization Problems. J. Optim. Theory Appl. 186(3): 806-825 (2020) - [j42]Emily A. Heath, John E. Mitchell, Thomas C. Sharkey:
Scheduling of tasks with effectiveness precedence constraints. Optim. Lett. 14(1): 37-49 (2020) - [c6]Prasanna Date, Christopher D. Carothers, John E. Mitchell, James A. Hendler, Malik Magdon-Ismail:
Training Deep Neural Networks with Constrained Learning Parameters. ICRC 2020: 107-115 - [i2]April Sagan, John E. Mitchell:
Low-Rank Factorization for Rank Minimization with Nonconvex Regularizers. CoRR abs/2006.07702 (2020) - [i1]Prasanna Date, Christopher D. Carothers, John E. Mitchell, James A. Hendler, Malik Magdon-Ismail:
Training Deep Neural Networks with Constrained Learning Parameters. CoRR abs/2009.00540 (2020)
2010 – 2019
- 2019
- [j41]Bin Yu, John E. Mitchell, Jong-Shi Pang:
Solving linear programs with complementarity constraints using branch-and-cut. Math. Program. Comput. 11(2): 267-310 (2019) - 2018
- [j40]Amy Givler Chapman, John E. Mitchell:
A fair division approach to humanitarian logistics inspired by conditional value-at-risk. Ann. Oper. Res. 262(1): 133-151 (2018) - [j39]Xin Shen, John E. Mitchell:
A penalty method for rank minimization problems in symmetric matrices. Comput. Optim. Appl. 71(2): 353-380 (2018) - 2017
- [j38]Timothy Lee, John E. Mitchell:
Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems. Discret. Optim. 24: 152-169 (2017) - [c5]Emily A. Heath, John E. Mitchell, Thomas C. Sharkey:
Restoration decision making for a supply chain network under cyber attack. SummerSim 2017: 8:1-8:12 - 2016
- [j37]Emily A. Heath, John E. Mitchell, Thomas C. Sharkey:
Applying ranking and selection procedures to long-term mitigation for improved network restoration. EURO J. Comput. Optim. 4(3-4): 447-481 (2016) - [j36]Lijie Bai, John E. Mitchell, Jong-Shi Pang:
On conic QPCCs, conic QCQPs and completely positive programs. Math. Program. 159(1-2): 109-136 (2016) - [j35]José Holguín-Veras, Ning Xu, Miguel Jaller, John E. Mitchell:
A Dynamic Spatial Price Equilibrium Model of Integrated Urban Production-Transportation Operations Considering Freight Delivery Tours. Transp. Sci. 50(2): 489-519 (2016) - 2015
- [j34]Yu-Ching Lee, Jong-Shi Pang, John E. Mitchell:
Global resolution of the support vector machine regression parameters selection problem with LPCC. EURO J. Comput. Optim. 3(3): 197-261 (2015) - [j33]Thomas C. Sharkey, Burak Cavdaroglu, Huy Nguyen, Jonathan Holman, John E. Mitchell, William A. Wallace:
Interdependent network restoration: On the value of information-sharing. Eur. J. Oper. Res. 244(1): 309-321 (2015) - [j32]Yu-Ching Lee, Jong-Shi Pang, John E. Mitchell:
An algorithm for global solution to bi-parametric linear complementarity constrained linear programs. J. Glob. Optim. 62(2): 263-297 (2015) - 2014
- [j31]Lijie Bai, John E. Mitchell, Jong-Shi Pang:
Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints. Optim. Lett. 8(3): 811-822 (2014) - [j30]John E. Mitchell, Jong-Shi Pang, Bin Yu:
Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs. Optim. Methods Softw. 29(1): 120-136 (2014) - 2013
- [j29]Burak Cavdaroglu, Erik Hammel, John E. Mitchell, Thomas C. Sharkey, William A. Wallace:
Integrating restoration and scheduling decisions for disrupted interdependent infrastructure systems. Ann. Oper. Res. 203(1): 279-294 (2013) - [j28]Lijie Bai, John E. Mitchell, Jong-Shi Pang:
On convex quadratic programs with linear complementarity constraints. Comput. Optim. Appl. 54(3): 517-554 (2013) - [j27]Felipe Aros-Vera, Vladimir Marianov, John E. Mitchell:
p-Hub approach for the optimal park-and-ride facility location problem. Eur. J. Oper. Res. 226(2): 277-285 (2013) - [j26]John E. Mitchell, Stephen Braun:
Rebalancing an investment portfolio in the presence of convex transaction costs, including market impact costs. Optim. Methods Softw. 28(3): 523-542 (2013) - [j25]Layne T. Watson, Stephen C. Billups, John E. Mitchell, David R. Easterling:
A Globally Convergent Probability-One Homotopy for Linear Programs with Linear Complementarity Constraints. SIAM J. Optim. 23(2): 1167-1188 (2013) - 2012
- [j24]Sarah G. Nurre, Burak Cavdaroglu, John E. Mitchell, Thomas C. Sharkey, William A. Wallace:
Restoring infrastructure systems: An integrated network design and scheduling (INDS) problem. Eur. J. Oper. Res. 223(3): 794-806 (2012) - [j23]Jing Hu, John E. Mitchell, Jong-Shi Pang, Bin Yu:
On linear programs with linear complementarity constraints. J. Glob. Optim. 53(1): 29-51 (2012) - [j22]Jing Hu, John E. Mitchell, Jong-Shi Pang:
An LPCC approach to nonconvex quadratic programs. Math. Program. 133(1-2): 243-277 (2012) - 2011
- [c4]Jing Gong, William A. Wallace, John E. Mitchell:
Decision modeling for resilient infrastructures. ISI 2011: 210-212
2000 – 2009
- 2009
- [j21]Mohammad R. Oskoorouchi, John E. Mitchell:
A second-order cone cutting surface method: complexity and application. Comput. Optim. Appl. 43(3): 379-409 (2009) - [r3]Eva K. Lee, John E. Mitchell:
Integer Programming: Branch and Bound Methods. Encyclopedia of Optimization 2009: 1634-1643 - [r2]John E. Mitchell:
Integer Programming: Branch and Cut Algorithms. Encyclopedia of Optimization 2009: 1643-1650 - [r1]John E. Mitchell:
Integer Programming: Cutting Plane Algorithms. Encyclopedia of Optimization 2009: 1650-1657 - 2008
- [j20]John E. Mitchell, Vasile L. Basescu:
Selective Gram-Schmidt orthonormalization for conic cutting surface algorithms. Math. Methods Oper. Res. 67(1): 91-115 (2008) - [j19]Vasile L. Basescu, John E. Mitchell:
An Analytic Center Cutting Plane Approach for Conic Programming. Math. Oper. Res. 33(3): 529-551 (2008) - [j18]Mohammad Al Hasan, Krishna K. Ramachandran, John E. Mitchell:
Optimal placement of stereo sensors. Optim. Lett. 2(1): 99-111 (2008) - [j17]Jing Hu, John E. Mitchell, Jong-Shi Pang, Kristin P. Bennett, Gautam Kunapuli:
On the Global Solution of Linear Programs with Linear Complementarity Constraints. SIAM J. Optim. 19(1): 445-471 (2008) - 2007
- [j16]Xiaoyun Ji, John E. Mitchell:
Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement. Discret. Optim. 4(1): 87-102 (2007) - [j15]Earl E. Lee II, John E. Mitchell, William A. Wallace:
Restoration of Services in Interdependent Infrastructure Systems: A Network Flows Approach. IEEE Trans. Syst. Man Cybern. Part C 37(6): 1303-1317 (2007) - 2006
- [j14]Kartik Krishnan, John E. Mitchell:
A Semidefinite Programming Based Polyhedral Cut and Price Approach for the Maxcut Problem. Comput. Optim. Appl. 33(1): 51-71 (2006) - [j13]Kartik Krishnan, John E. Mitchell:
A unifying framework for several cutting plane methods for semidefinite programming. Optim. Methods Softw. 21(1): 57-74 (2006) - [p1]John E. Mitchell, Kris Farwell, Daryn Ramsden:
Interior Point Methods for Large-Scale Linear Programming. Handbook of Optimization in Telecommunications 2006: 3-25 - 2005
- [j12]Stephen Braun, John E. Mitchell:
A Semidefinite Programming Heuristic for Quadratic Programming Problems with Complementarity Constraints. Comput. Optim. Appl. 31(1): 5-29 (2005) - 2004
- [c3]Earl E. Lee II, John E. Mitchell, William A. Wallace:
Assessing Vulnerability of Proposed Designs for Interdependent Infrastructure Systems. HICSS 2004 - 2003
- [j11]John E. Mitchell:
Polynomial interior point cutting plane methods. Optim. Methods Softw. 18(5): 507-534 (2003) - 2001
- [j10]John E. Mitchell:
Restarting after Branching in the SDP Approach to MAX-CUT and Similar Combinatorial Optimization Problems. J. Comb. Optim. 5(2): 151-166 (2001) - 2000
- [j9]John E. Mitchell, Srinivasan Ramaswamy:
A Long-Step, Cutting Plane Algorithm for Linear and Convex Programming. Ann. Oper. Res. 99(1-4): 95-122 (2000) - [j8]Sharmila Shah, John E. Mitchell, Michael Kupferschmid:
An ellipsoid algorithm for equality-constrained nonlinear programs. Comput. Oper. Res. 28(1): 85-92 (2000) - [j7]Robert Rush, John M. Mulvey, John E. Mitchell, Thomas R. Willemain:
Stratified filtered sampling in stochastic optimization. Adv. Decis. Sci. 4(1): 17-38 (2000) - [j6]John E. Mitchell:
Computational Experience with an Interior Point Cutting Plane Algorithm. SIAM J. Optim. 10(4): 1212-1227 (2000)
1990 – 1999
- 1997
- [j5]Brian Borchers, John E. Mitchell:
A computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs. Comput. Oper. Res. 24(8): 699-701 (1997) - [c2]Eva K. Lee, John E. Mitchell:
Computational Experience of an Interior-Point Algorithm in a Parallel Branch-and-Cut Framework. PP 1997 - 1996
- [j4]John E. Mitchell, Brian Borchers:
Solving real-world linear ordering problems using a primal-dual interior point cutting plane method. Ann. Oper. Res. 62(1): 253-276 (1996) - [c1]Steve Joy, John E. Mitchell, Brian Borchers:
A branch and cut algorithm for MAX-SAT and weighted MAX-SAT. Satisfiability Problem: Theory and Applications 1996: 519-536 - 1994
- [j3]Brian Borchers, John E. Mitchell:
An improved branch and bound algorithm for mixed integer nonlinear programs. Comput. Oper. Res. 21(4): 359-367 (1994) - [j2]John E. Mitchell:
An Interior Point Column Generation Method for Linear Programming Using Shifted Barriers. SIAM J. Optim. 4(2): 423-440 (1994) - 1992
- [j1]John E. Mitchell, Michael J. Todd:
Solving combinatorial optimization problems using Karmarkar's algorithm. Math. Program. 56: 245-284 (1992)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
