Publications (reverse chronological order)
You can also access a list of
papers arranged by topic.
You can also download copies of the slides from some recent
talks.
Many of these papers are also available from my
Google
Scholar page.
Technical reports 
Appeared in print 
Old technical reports

A
Penalty Method for Rank Minimization Problems in Symmetric Matrices
with
Xin Shen.
January 11, 2017.
Journal submission.

Scheduling
of tasks with effectiveness precedence constraints
with
Emily Heath
and
Thomas C. Sharkey.
November 21, 2016.
Journal submission.

Optimal access restoration for disaster relief logistics
with
Felipe ArosVera
and
Jose HolguinVeras.
November 2016.
Journal submission.

Optimal districting of disaster areas
with
Johanna
Amaya Leal
and
Jose HolguinVeras.
November 2016.
Journal submission.

Solving Linear Programs with Complementarity
Constraints using BranchandCut
with
Bin Yu
and
JongShi Pang.
October 28, 2016.
Journal submission.

Complementarity Formulations of ℓ_{0}norm Optimization Problems
with
Mingbin Feng,
JongShi Pang,
Xin Shen,
and
Andreas Wächter.
May 17, 2016.
Journal submission.

Improving Network Durability using
Approximate Dynamic Programming,
with
Erik Hammel,
Thomas C. Sharkey.
and
William A. Wallace.
April 2016.
Journal submission.

Improving the Recovery of Interdependent
Social Infrastructure Systems after an Extreme Event: Model and Application
with
Ryan Loggins,
Thomas C. Sharkey.
and
William A. Wallace.
September 2015.
Journal submission.
Online first

A Fair Division Approach to
Humanitarian Logistics Incorporating Conditional ValueatRisk
with
Amy Givler Chapman.
Online first in
Annals
of OR, 22 September 2016.

Approximation Algorithms from Inexact
Solutions to Semidefinite Programming Relaxations of
Combinatorial Optimization Problems
with
Timothy Lee.
Online first, 13 May 2016,
in
Discrete
Optimization.
2016

Applying Ranking and Selection Procedures
to LongTerm Mitigation for Improved Network Restoration
with
Emily Heath
and
Thomas C. Sharkey.
EURO
Journal on Computational Optimization,
4(3), pages 447481, 2016.

A
dynamic spatial price equilibrium model of integrated urban
productiontransportation operations considering freight delivery
tours,
with José HolguinVeras, Ning Xu,
and Miguel Jaller.
Transportation
Science,
50(2), pages 489519, 2016.

On conic QPCCs,
conic QCQPs and completely positive programs
with
Lijie Bai and
JongShi
Pang.
Mathematical
Programming,
159(1), pages 109136, 2016.

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 A. Wallace.
ASCE's
Journal of Infrastructure Systems, 22(1): 04015007, 2016.
2015

Global resolution of the support vector machine regression parameters
selection problem with LPCC,
by YuChing Lee,
JongShi Pang.
and John E. Mitchell.
EURO
Journal on Computational Optimization, 3(3), pages 197261, 2015.

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.
 An
algorithm for global solution to biparametric linear complementarity
constrained linear programs,
with YuChing Lee and
JongShi Pang.
Journal of
Global Optimization 62(2), pages 263297, 2015.

Interdependent Network Restoration:
On the Value of InformationSharing
with
Thomas C. Sharkey,
Burak Cavdaroglu,
Huy Nguyen,
Jonathan Holman,
and
William A. Wallace.
European
Journal of Operational Research,
244(1), pages 309321, 2015.
2014

An Interdependent
Layered Network Model for a Resilient Supply Chain
with
Jing Gong,
Ananth
Krishnamurthy,
and
William
A. Wallace.
Omega,
46, pages 104116, 2014.

Convex Quadratic Relaxations of
Nonconvex Quadratically Constrained Quadratic Programs
with
JongShi
Pang
and Bin Yu.
Optimization
Methods and Software, 29(1), pages 120136, 2014.

Using quadratic convex reformulation to tighten the
convex relaxation of a quadratic program with complementarity constraints
with
Lijie Bai and
JongShi
Pang.
Optimization
Letters, 8(3), pages 811822, 2014.
2013

A Globally Convergent ProbabilityOne
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), 11671188, 2013.

"Urban freight tour models: state of the art and practice"
with José HolguinVeras, Ellen
Thorson, Qian Wang, Ning
Xu, Carlos GonzalezCalderon, and Ivan SanchezDiaz.
Freight Transport Modelling,
edited by Moshe BenAkiva,
Hilde Meersman and
Eddy Van de Voorde,
Chapter 17, 2013.

Rebalancing
an Investment Portfolio in the Presence of
Convex Transaction Costs and Market Impact Costs
with
Stephen Braun,
Optimization
Methods and Software, 28(3), 523542, 2013.
(Online first, September 3, 2012.)

Phub approach for the optimal parkandride facility
location problem,
with
Felipe ArosVera
and
Vladimir Marianov.
European Journal of Operational Research, 226(2), pages 277285, 16 April 2013.
(Online first, November 17, 2012.)

On Convex Quadratic Programs with
Linear Complementarity Constraints
with
Lijie Bai and
JongShi
Pang.
Computational
Optimization and Applications, 54(3), pages 517554, April 2013.
(Online first, July 18, 2012.)

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 279294, March 2013.
(Online first, September 5, 2011.)
2012

Properties of a cutting plane method for semidefinite programming,
with Kartik Krishnan
Sivaramakrishnan,
Pacific Journal
of Optimization,
Volume 8(4), pages 779802, 2012.

Obtaining Tighter Relaxations of
Mathematical Programs with Complementarity Constraints,
with
JongShi
Pang
and Bin Yu.
Chapter 1 in
Springer
Proceedings in Mathematics and Statistics, Volume 21,
August 2012.

Restoring Infrastructure Systems:
An Integrated Network Design and Scheduling Problem,
with Sarah G. Nurre,
Burak Cavdaroglu,
Thomas C. Sharkey,
and
William
A. Wallace,
European Journal of Operational Research,
Volume 223(3), pages 794806, 16 December 2012.

An LPCC Approach to Nonconvex
Quadratic Programs
with Jing Hu and
JongShi
Pang.
Mathematical
Programming
133(12), pages 243277, 2012.
(Online first, November 8, 2010.)

On Linear Programs with
Linear Complementarity Constraints
with Jing Hu,
JongShi
Pang,
and Bin Yu.
Journal of Global Optimization,
53(1), pages 2951,
2012.
(Online first on January 7, 2011.)
2011

"Decision modeling for resilient infrastructures",
with
Jing Gong
and
William
A. Wallace,
July 2011.
Proceedings of
ISI 2011.

"Decomposition methods for restoring infrastructure systems",
with
Burak Cavdaroglu,
Sarah G. Nurre,
Thomas C. Sharkey,
and
William
A. Wallace,
Proceedings of
ICVRAM,
April 2011.

Branch and Cut.
In the
Encyclopedia
of Operations Research and Management Science.
February 2011.
2009

Cutting plane methods and
subgradient methods.
Chapter 2, pages 3461, in
"TutORials in Operations Research, INFORMS 2009",
edited by M. Oskoorouchi,
October 2009.

Logicbased MultiObjective 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.

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 14191428.
(Also accessible
here.)

A secondorder cone cutting
surface method: complexity and application,
with Mohammad Oskoorouchi,
Computational
Optimization and Applications 43(3), pages 379409, 2009.
2008

An analytic center cutting plane approach
for conic programming,
with Luc Basescu.
Mathematics of Operations Research,
Volume 33(3), pages 529551, 2008.

On the Global Solution of Linear Programs
with Linear Complementarity Constraints
with Jing Hu,
JongShi
Pang,
Kristin P. Bennett,
and Gautam Kunapuli,
SIAM Journal on Optimization
19 (1), 2008, pages 445471.

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 211220.

Selective GramSchmidt orthonormalization
for conic cutting surface algorithms,
with Luc Basescu,
Mathematical Methods
of Operations Research,
Volume 67, Number 1,
pages 91115, 2008.

Optimal Placement of Stereo Sensors,
with
Mohammad Al Hasan and Krishna K. Ramachandran.
Optimization Letters,
Volume 2, Number 1,
pages 99111,
January 2008.
2007

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 13031317, 2007.

BranchandPriceandCut on the Clique Partition
Problem with Minimum Clique Size Requirement,
with Xiaoyun Ji,
Discrete Optimization, 4 (1), 2007, pages 87102.
2006

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.

Interior point methods for
largescale 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 325.

Semidefinite cutandprice
approaches for the maxcut problem,
with Kartik Krishnan,
Computational
Optimization and Applications,
Volume 33(1),
pages 5171, 2006.

A unifying framework for several
cutting plane methods for semidefinite programming,
with Kartik Krishnan,
Optimization
Methods and Software,
21(1), February 2006, pages 5774.
2005

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.

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 431451.

Finding optimal realignments in sports
leagues using a branchandcutandprice approach,
with Xiaoyun Ji,
International
Journal of Operational Research (IJOR),
Volume 1, Numbers 12,
pages 101122,
2005.

A semidefinite programming heuristic
for quadratic programming problems with complementarity constraints
with Steve Braun,
Computational
Optimization and Applications 31(1), 2005, pages 529.
2004

Extreme Events
and the Sustainability of Civil Infrastructure Systems,
with Earl (Rusty) Lee and Al Wallace.
Proceedings of the
International Workshop on Integrated LifeCycle Management
of Infrastructures,
Hong Kong,
December 2004.

An approach for solving the integrative
freight market simulation,
with Ellen Thorson and Jose HolguínVeras,
May 2004.
Proceedings of the
PanAmerican Conference
of Traffic and Transportation Engineering (PANAM XIII),
CDROM.

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.

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 58, 2004.
2003

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 postdisaster 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 165198, 2003.

Polynomial interior point cutting plane methods,
Optimization
Methods and Software,
18(5), pages 507534, 2003.

"Realignment in the National Football League,"
Naval
Research Logistics, 50(7), pages 683701, 2003.

"Semiinfinite linear programming
approaches to semidefinite programming problems,"
with Kartik Krishnan,
Fields Institute Communications
Series, Volume 37, Novel approaches to hard discrete optimization
problems, edited by P. Pardalos and H. Wolkowicz, pages 123142, 2003.
2002

Branchandcut methods for
combinatorial optimization problems,
in the
Handbook
of Applied Optimization, Oxford University Press, 2002.
2001

Branchandbound methods for
integer programming,
with
Eva K. Lee,
in the
Encyclopedia
of Optimization,
Volume II, pages 509519,
Kluwer Academic Publishers, August 2001.

Cutting plane algorithms
for integer programming,
in the
Encyclopedia
of Optimization,
Volume II, pages 525533,
Kluwer Academic Publishers, August 2001.

Branchandcut algorithms
for integer programming,
in the
Encyclopedia
of Optimization,
Volume II, pages 519525,
Kluwer Academic Publishers, August 2001.

"Restarting
after branching in the SDP approach to MAXCUT
and similar combinatorial optimization problems",
Journal of
Combinatorial Optimization, 5(2), 2001, pages 151166.

"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.

An ellipsoid algorithm for
equalityconstrained nonlinear programs,
with Sharmila Shah and Mike Kupferschmid.
Computers
and Operations Research, 28(1), 2001, pages 8592.
2000

"A LongStep, Cutting Plane Algorithm for Linear and Convex
Programming,"
(with Srini Ramaswamy),
Annals of OR,
Volume 99, 2000, pages 95122.

"Computational experience with
an interior point cutting plane algorithm",
SIAM
Journal on Optimization, volume 10(4), pages 12121227, 2000.

"Stratified
filtered sampling in stochastic optimization,"
(with
John
Mulvey,
Bob Rush, and
Tom
Willemain),
Journal
of Applied Mathematics and Decision Sciences, 4(1), 2000, pp. 1738.

"Solving linear ordering problems with
a combined interior point/simplex cutting plane algorithm",
with Brian Borchers.
Appeared as Chapter 14, pages 349366, of
High
Performance Optimization,
edited by H. Frenk et al., Kluwer Academic Publishers, 2000.

"Computational Experience of an
InteriorPoint SQP Algorithm in a
Parallel BranchandBound Framework",
with
Eva K. Lee.
Appeared as Chapter 13, pages 329347, of
High
Performance Optimization,
edited by H. Frenk et al., Kluwer Academic Publishers, 2000.
1998

"Interior point methods
for combinatorial optimization,".
With Panos Pardalos
and Mauricio G. C. Resende.
Handbook
of Combinatorial Optimization,
Volume 1, pages 189297,
Kluwer Academic Publishers, 1998.

"An interior point cutting plane
algorithm for Ising spin glass problems",
postscript file, 67503 bytes or
pdf format.
Appeared in "Operations Research Proceedings, SOR 1997, Jena, Germany",
SpringerVerlag, edited by P. Kischka and H.W. Lorenz, 1998, pages 114119.
(Also available as a
dvi file, 24328 bytes.)
(Abstract.)
The generator for some Ising spin glass
instances is available.
1997

"Computational experience of an interior point
algorithm in a parallel branchandcut framework",
with Eva K. Lee,
Proceedings of the Eighth SIAM Conference on Parallel
Processing for Scientific Computing, Minneapolis, March 1997,
CDROM.

"A branchandcut algorithm for MAXSAT and weighted MAXSAT",
with S. Joy and B. Borchers,
in "Satisfiability Problem: Theory and Applications",
edited by D. Du, J. Gu, and P. Pardalos,
1997, DIMACS Series in Discrete Mathematics and Theoretical Computer
Science, Volume 35, pages 519536.

"Fixing variables and generating classical cutting planes when
using an interior point branch and cut method
to solve integer programming problems",
European Journal of Operational Research,
volume 97, 1997, pages 139148.

"A computational comparison of Branch and Bound and
Outer Approximation Methods for 01 mixed integer nonlinear programs",
with Brian Borchers,
Computers and Operations Research, 24, 1997, pages 699701.

"Computational experience in nonlinear mixed integer programming",
with Eva K. Lee,
Proceedings of the Symposium on Operations Research 1996 (SOR96),
August 1996, Braunschweig, Germany,
published by SpringerVerlag, 1997, pages 95100.
1996

"Interior point algorithms for combinatorial optimization",
appeared in
"Interior Point Methods in Mathematical Programming",
edited by Tamas Terlaky,
Kluwer Academic Publishers, 1996, chapter 11, pages 417466.

"Interior point algorithms for integer programming",
appeared in
"Advances in Linear and Integer Programming",
edited by John E. Beasley,
Oxford University Press, 1996, chapter 6, pages 223248.

"Solving realworld linear ordering problems using
a primaldual interior point cutting plane method",
with Brian Borchers,
Annals of Operations Research, volume 62, 1996, pages 253276.
1995

"A PrimalDual Interior Point Method for Linear Programming
Based on a Weighted Barrier Function",
with Z.Y. Cheng,
Journal of Optimization Theory and Applications, 87, 1995, pages 301321.

"The nonlinear
effects of teaching and consulting on academic
research and productivity",
with Douglas S. Rebne,
SocioEconomic Planning Sciences,
volume 29, 1995, pages 4757.
1994

"An Alternative Derivation of the Projective Interior Point
Method for Linear Programming Through the Least Squares Approach",
with Z.Y. Cheng,
Optimization, 31, 1994, pages 95106.

"An improved branch and bound algorithm for
mixed integer nonlinear programming",
with Brian Borchers,
Computers and Operations Research, 21(4), 1994, pages 359367.

"Analyzing and Exploiting the Structure of the
Constraints in the ILP Approach to the Scheduling Problem",
with S. Chaudhuri and R. A. Walker,
IEEE Transactions on VLSI, Volume 2, December 1994, pages 456471.

"An interior point column generation method for linear
programming using shifted barriers",
SIAM Journal on Optimization,
4, 1994, pages 423440.
1993

"The structure of assignment, precedence, and resource
constraints in the ILP approach to the scheduling problem",
with S. Chaudhuri and R. A. Walker,
Proceedings of the 1993 IEEE International Conference on Computer Design.

"Updating lower bounds when using Karmarkar's
projective algorithm for linear programming",
Journal of Optimization Theory and Applications,
78, 1993, pages 127142.
1992

"A primaldual interior point cutting plane method for the
linear ordering problem",
with Brian Borchers,
COAL Bulletin, Volume 21, November 1992, pages 1318.

"Solving combinatorial optimization problems using Karmarkar's algorithm",
with M. J. Todd,
Mathematical Programming 56, 1992, pages 245284.
1991

"Solving matching problems using Karmarkar's algorithm",
with M. J. Todd,
appeared in
"Mathematical Developments Arising from Linear Programming
(Contemporary Mathematics, Volume 114)",
edited by J. C. Lagarias and M. J. Todd,
AMS, 1991, pages 309318.
1990

"Nonlinear decision variables in work design:
faculty roles and research productivity",
with Douglas S. Rebne,
Proceedings of the Decision Sciences Institute,
San Diego, California, November 1990, pages 14261428.
1989

"A variant of Karmarkar's linear programming algorithm for
problems with some unrestricted variables",
with M. J. Todd,
SIAM Journal on Matrix Analysis and Applications,
volume 10(1), 1989, pages 3038.

"On the Relationship Between the Search Directions in the
Affine and Projective Variants of Karmarkar's
Linear Programming Algorithm",
with M. J. Todd,
appeared in "Contributions to Operations Research and Economics:
The Twentieth Anniversary of CORE",
edited by Bernard Cornet and Henry Tulkens,
MIT Press, Cambridge, Massachusetts, 1989, pages 237250.
1988

"Karmarkar's Algorithm and Combinatorial Optimization Problems",
PhD thesis,
School of Operations Research and Industrial Engineering,
Cornell University, Ithaca NY, 1988.

"Designing a Research and Development Portfolio for
Combating Extreme Events",
with
Paul Salasznyk
and
William
A. Wallace,
June 2011.
Journal submission.

"Integrated vehicle routing problem with explicit consideration
of social costs in humanitarian logistics",
with Noel Perez,
Jose HolguinVeras,
and Thomas C. Sharkey,
August 2010.
Submitted.

Multivehicle routing with profits and competition,
with Ellen Thorson and Jose HolguínVeras,
October 2005.

The Clique Partition Problem with Minimum
Clique Size Requirement,
with Xiaoyun Ji,
May 5, 2005.
Journal submission.

Rebalancing an Investment Portfolio
in the Presence of Convex Transaction Costs,
with Steve Braun,
December 17, 2004.

Rebalancing an Investment Portfolio
in the Presence of Transaction Costs,
with Steve Braun,
November 28, 2002. Revised December 16, 2003.

Restoration of services in interdependent
infrastructure systems: a network flows approach,
with Earl (Rusty) Lee, David Mendonça, and Al Wallace.
June 2003.

Branchandcut for the kway equipartition
problem, January 2001.

"A linear programming
approach to semidefinite programming problems,"
with Kartik Krishnan,
May 2001.

"Solving MAXSAT and Weighted MAXSAT
Problems Using BranchandCut",
February 28, 1998.
With Steve Joy
and Brian Borchers.
Accepted for publication in the
Journal of Combinatorial Optimization.

"A tabu search procedure for targetmatching in financial scenario
generation,"
(with
Adam J. Berger,
John
Mulvey, and Bob Rush),
Dec 5, 1997.
(Abstract.)

"A long step cutting plane algorithm that uses the volumetric barrier",
with Srini Ramaswamy,
June 1995, DSES Tech Report, RPI.

"On Updating the Analytic Center After the Addition of Multiple
Cuts,"
with Srini Ramaswamy,
substantially revised April 28, 1998, original version October 27, 1994.

"Occupational contingencies of academic work design",
with Douglas S. Rebne,
Technical Report, Management Sciences Dept, RPI, 1993.

"Using
an interior point method in a branch and bound
algorithm for integer programming",
with Brian Borchers
Mathematical Sciences Report 195, Rensselaer Polytechnic Institute,
March 1991, revised July 1992.
RPI Math
Back to John Mitchell's homepage