Sanjay Mehrotra
Orcid: 0000-0003-1106-1901Affiliations:
- Northwestern University, Illinois, USA
According to our database1,
Sanjay Mehrotra
authored at least 82 papers
between 1988 and 2022.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2022
Numerical Methods for Integral Equations of the Second Kind with NonSmooth Solutions of Bounded Variation.
SIAM J. Numer. Anal., October, 2022
A Solution Approach to Distributionally Robust Joint-Chance-Constrained Assignment Problems.
INFORMS J. Optim., April, 2022
Open J. Math. Optim., March, 2022
A decomposition method for distributionally-robust two-stage stochastic mixed-integer conic programs.
Math. Program., 2022
2021
Solution Approaches to Linear Fractional Programming and Its Stochastic Generalizations Using Second Order Cone Approximations.
SIAM J. Optim., 2021
J. Glob. Optim., 2021
Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning.
INFORMS J. Comput., 2021
A Near-Optimal Finite Approximation Approach for Computing Stationary Distribution and Performance Measures of Continuous-State Markov Chains.
CoRR, 2021
2020
Optim. Lett., 2020
IISE Trans., 2020
2019
A Data-Driven Functionally Robust Approach for Simultaneous Pricing and Order Quantity Decisions with Unknown Demand Function.
Oper. Res., 2019
Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models.
Eur. J. Oper. Res., 2019
On solving two-stage distributionally robust disjunctive programs with a general ambiguity set.
Eur. J. Oper. Res., 2019
2018
Decomposition Algorithms for Two-Stage Distributionally Robust Mixed Binary Programs.
SIAM J. Optim., 2018
SIAM J. Optim., 2018
2017
Qual. Reliab. Eng. Int., 2017
Generation of feasible integer solutions on a massively parallel computer using the feasibility pump.
Oper. Res. Lett., 2017
Solution of Monotone Complementarity and General Convex Programming Problems Using a Modified Potential Reduction Interior Point Method.
INFORMS J. Comput., 2017
Proceedings of the Second IEEE/ACM International Conference on Connected Health: Applications, 2017
2016
A design of experiments approach to validation sampling for logistic regression modeling with error-prone medical records.
J. Am. Medical Informatics Assoc., 2016
Proceedings of the 38th Annual International Conference of the IEEE Engineering in Medicine and Biology Society, 2016
Detecting Out-of-Bed Activities to Prevent Pneumonia for Hospitalized Patient Using Microsoft Kinect V2.
Proceedings of the First IEEE International Conference on Connected Health: Applications, 2016
Proceedings of the 13th IEEE International Conference on Wearable and Implantable Body Sensor Networks, 2016
2015
A Two-Stage Stochastic Integer Programming Approach to Integrated Staffing and Scheduling with Application to Nurse Management.
Oper. Res., 2015
An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs.
Comput. Optim. Appl., 2015
Comput. Optim. Appl., 2015
Preventing venous thromboembolism in patients admitted by hospital using Microsoft Kinect V2.
Proceedings of the IEEE Biomedical Circuits and Systems Conference, 2015
Proceedings of the AMIA 2015, 2015
2014
A Cutting Surface Algorithm for Semi-Infinite Convex Programming with an Application to Moment Robust Optimization.
SIAM J. Optim., 2014
Math. Program., 2014
Stochastically weighted stochastic dominance concepts with an application in capital budgeting.
Eur. J. Oper. Res., 2014
Asia Pac. J. Oper. Res., 2014
Proceedings of the 36th Annual International Conference of the IEEE Engineering in Medicine and Biology Society, 2014
2013
Mining Deviations from Patient Care Pathways via Electronic Medical Record System Audits.
ACM Trans. Manag. Inf. Syst., 2013
SIAM J. Optim., 2013
Northwestern University Feinberg School of Medicine Uses Operations Research Tools to Improve Surgeon Training.
Interfaces, 2013
An empirical evaluation of walk-and-round heuristics for mixed integer linear programs.
Comput. Optim. Appl., 2013
Proceedings of the Winter Simulations Conference: Simulation Making Decisions in a Complex World, 2013
2012
Computational experience with a modified potential reduction algorithm for linear programming.
Optim. Methods Softw., 2012
Math. Program., 2012
Robust and Stochastically Weighted Multiobjective Optimization Models and Reformulations.
Oper. Res., 2012
Generating nested quadrature formulas for general weight functions with known moments
CoRR, 2012
2011
Self-concordance and Decomposition-based Interior Point Methods for the Two-stage Stochastic Convex Optimization Problem.
SIAM J. Optim., 2011
Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices.
J. Glob. Optim., 2011
2010
Convergence of a Weighted Barrier Decomposition Algorithm for Two-Stage Stochastic Programming with Discrete Support.
SIAM J. Optim., 2010
Validation and characterization of DNA microarray gene expression data distribution and associated moments.
BMC Bioinform., 2010
An Interior Point Optimization Solver for Real Time Inter-frame Collision Detection: Exploring Resource-Accuracy-Platform Tradeoffs.
Proceedings of the International Conference on Field Programmable Logic and Applications, 2010
2009
On the Implementation of Interior Point Decomposition Algorithms for Two-Stage Stochastic Conic Programs.
SIAM J. Optim., 2009
A Cutting-Surface Method for Uncertain Linear Programs with Polyhedral Stochastic Dominance Constraints.
SIAM J. Optim., 2009
Decomposition Based Interior Point Methods for Two-Stage Stochastic Convex Quadratic Programs with Recourse.
Oper. Res., 2009
FPGA Implementation of the Interior-Point Algorithm with Applications to Collision Detection.
Proceedings of the FCCM 2009, 2009
2007
Decomposition-Based Interior Point Methods for Two-Stage Stochastic Semidefinite Programming.
SIAM J. Optim., 2007
A model-based optimization framework for the inference of regulatory interactions using time-course DNA microarray expression data.
BMC Bioinform., 2007
2005
Convergence Conditions and Krylov Subspace--Based Corrections for Primal-Dual Interior-Point Method.
SIAM J. Optim., 2005
J. Comput. Inf. Sci. Eng., 2005
2004
A model-based optimization framework for the inference on gene regulatory networks from DNA array data.
Bioinform., 2004
2002
J. Glob. Optim., 2002
Oper. Res., 2002
2001
Math. Program., 2001
Experimental Results on Using General Disjunctions in Branch-and-Bound for General-Integer Linear Programs.
Comput. Optim. Appl., 2001
1999
1998
Using a Massively Parallel Processor to Solve Large Sparse Linear Programs by an Interior-Point Method.
SIAM J. Sci. Comput., 1998
1996
A general parametric analysis approach and its implication to sensitivity analysis in interior point methods.
Math. Program., 1996
Math. Program., 1996
1995
A Study of the Augmented System and Column-Splitting Approaches for Solving Two-Stage Stochastic Linear Programs by Interior-Point Methods.
INFORMS J. Comput., 1995
1994
SIAM J. Optim., 1994
1993
Math. Program., 1993
Solving symmetric indefinite systems in an interior-point method for linear programming.
Math. Program., 1993
1992
Implementations of Affine Scaling Methods: Approximate Solutions of Systems of Linear Equations Using Preconditioned Conjugate Gradient Methods.
INFORMS J. Comput., 1992
1991
Math. Program., 1991
1990
An Algorithm for Convex Quadratic Programming That Requires <i>O</i>(<i>n</i><sup>3.5</sup><i>L</i>) Arithmetic Operations.
Math. Oper. Res., 1990
1988
Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value.
Math. Program., 1988