default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSanjay Mehrotra
Person information
- affiliation: Northwestern University, Illinois, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j71]Shibshankar Dey, Cheolmin Kim, Sanjay Mehrotra
:
An algorithm for stochastic convex-concave fractional programs with applications to production efficiency and equitable resource allocation. Eur. J. Oper. Res. 315(3): 980-990 (2024)- [j70]Hamed Rahimian, Sanjay Mehrotra:
A Disjunctive Cutting Plane Algorithm for Bilinear Programming. SIAM J. Optim. 34(4): 3286-3313 (2024) - [i4]Haoyan Shi, Sanjay Mehrotra:
On Approximation of Robust Max-Cut and Related Problems using Randomized Rounding Algorithms. CoRR abs/2406.01856 (2024) - 2022
- [j69]Shanshan Wang, Jinlin Li, Sanjay Mehrotra:
A Solution Approach to Distributionally Robust Joint-Chance-Constrained Assignment Problems. INFORMS J. Optim. 4(2): 125-147 (2022) - [j68]Fengqiao Luo, Sanjay Mehrotra:
A decomposition method for distributionally-robust two-stage stochastic mixed-integer conic programs. Math. Program. 196(1): 673-717 (2022) - [j67]Hamed Rahimian, Sanjay Mehrotra:
Frameworks and Results in Distributionally Robust Optimization. Open J. Math. Optim. 3: 1-85 (2022) - [j66]Daniel Duque, Sanjay Mehrotra, David P. Morton:
Distributionally Robust Two-Stage Stochastic Programming. SIAM J. Optim. 32(3): 1499-1522 (2022) - [j65]Shukai Li, Sanjay Mehrotra:
Numerical Methods for Integral Equations of the Second Kind with NonSmooth Solutions of Bounded Variation. SIAM J. Numer. Anal. 60(5): 2751-2780 (2022) - 2021
- [j64]Shanshan Wang, Jinlin Li, Sanjay Mehrotra:
Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning. INFORMS J. Comput. 33(4): 1661-1677 (2021) - [j63]Fengqiao Luo, Sanjay Mehrotra:
A geometric branch and bound method for robust maximization of convex functions. J. Glob. Optim. 81(4): 835-859 (2021) - [j62]Cheolmin Kim, Sanjay Mehrotra:
Solution Approaches to Linear Fractional Programming and Its Stochastic Generalizations Using Second Order Cone Approximations. SIAM J. Optim. 31(1): 945-971 (2021) - [i3]Shukai Li, Sanjay Mehrotra:
A Near-Optimal Finite Approximation Approach for Computing Stationary Distribution and Performance Measures of Continuous-State Markov Chains. CoRR abs/2112.14315 (2021) - 2020
- [j61]Mehmet Basdere, Karen R. Smilowitz, Sanjay Mehrotra:
A study of the lock-free tour problem and path-based reformulations. IISE Trans. 52(6): 603-616 (2020) - [j60]Fengqiao Luo, Sanjay Mehrotra:
Distributionally robust optimization with decision dependent ambiguity sets. Optim. Lett. 14(8): 2565-2594 (2020)
2010 – 2019
- 2019
- [j59]Fengqiao Luo, Sanjay Mehrotra:
Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models. Eur. J. Oper. Res. 278(1): 20-35 (2019) - [j58]Manish Bansal, Sanjay Mehrotra:
On solving two-stage distributionally robust disjunctive programs with a general ambiguity set. Eur. J. Oper. Res. 279(2): 296-307 (2019) - [j57]Jian Hu, Junxuan Li, Sanjay Mehrotra:
A Data-Driven Functionally Robust Approach for Simultaneous Pricing and Order Quantity Decisions with Unknown Demand Function. Oper. Res. 67(6): 1564-1585 (2019) - [i2]Hamed Rahimian, Sanjay Mehrotra:
Distributionally Robust Optimization: A Review. CoRR abs/1908.05659 (2019) - 2018
- [j56]Jian Hu, Manish Bansal, Sanjay Mehrotra:
Robust decision making using a general utility set. Eur. J. Oper. Res. 269(2): 699-714 (2018) - [j55]Manish Bansal, Kuo-Ling Huang, Sanjay Mehrotra:
Tight Second Stage Formulations in Two-Stage Stochastic Mixed Integer Programs. SIAM J. Optim. 28(1): 788-819 (2018) - [j54]Manish Bansal, Kuo-Ling Huang, Sanjay Mehrotra:
Decomposition Algorithms for Two-Stage Distributionally Robust Mixed Binary Programs. SIAM J. Optim. 28(3): 2360-2383 (2018) - 2017
- [j53]Kuo-Ling Huang, Sanjay Mehrotra:
Solution of Monotone Complementarity and General Convex Programming Problems Using a Modified Potential Reduction Interior Point Method. INFORMS J. Comput. 29(1): 36-53 (2017) - [j52]Utku Koç, Sanjay Mehrotra:
Generation of feasible integer solutions on a massively parallel computer using the feasibility pump. Oper. Res. Lett. 45(6): 652-658 (2017) - [j51]Liwen Ouyang, Daniel W. Apley, Sanjay Mehrotra:
Batch Sample Design from Databases for Logistic Regression. Qual. Reliab. Eng. Int. 33(1): 87-101 (2017) - [c10]Liang Liu, Sanjay Mehrotra:
Patient Associated Motion Detection with Optical Flow Using Microsoft Kinect V2. CHASE 2017: 274-275 - 2016
- [j50]Brittany M. Bogle, Sanjay Mehrotra:
A Moment Matching Approach for Generating Synthetic Data. Big Data 4(3): 160-178 (2016) - [j49]Liwen Ouyang, Daniel W. Apley, Sanjay Mehrotra:
A design of experiments approach to validation sampling for logistic regression modeling with error-prone medical records. J. Am. Medical Informatics Assoc. 23(e1): e71-e78 (2016) - [c9]Liang Liu, Sanjay Mehrotra:
Bed angle detection in hospital room using Microsoft Kinect V2. BSN 2016: 277-280 - [c8]Liang Liu, Sanjay Mehrotra:
Detecting Out-of-Bed Activities to Prevent Pneumonia for Hospitalized Patient Using Microsoft Kinect V2. CHASE 2016: 364-365 - [c7]Liang Liu, Sanjay Mehrotra:
Patient walk detection in hospital room using Microsoft Kinect V2. EMBC 2016: 4395-4398 - 2015
- [j48]Kuo-Ling Huang, Sanjay Mehrotra:
An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs. Comput. Optim. Appl. 60(3): 559-585 (2015) - [j47]Michael Chen, Sanjay Mehrotra, Dávid Papp:
Scenario generation for stochastic optimization problems via the sparse grid method. Comput. Optim. Appl. 62(3): 669-692 (2015) - [j46]Kibaek Kim, Sanjay Mehrotra:
A Two-Stage Stochastic Integer Programming Approach to Integrated Staffing and Scheduling with Application to Nurse Management. Oper. Res. 63(6): 1431-1451 (2015) - [j45]Changhyeok Lee, Cong Liu, Sanjay Mehrotra, Zhaohong Bie:
Robust Distribution Network Reconfiguration. IEEE Trans. Smart Grid 6(2): 836-842 (2015) - [c6]You Chen, Wei Xie, Carl A. Gunter, David M. Liebovitz, Sanjay Mehrotra, He Zhang, Bradley A. Malin:
Inferring Clinical Workflow Efficiency via Electronic Medical Record Utilization. AMIA 2015 - [c5]Liang Liu, Melody Yin, Sanjay Mehrotra:
Preventing venous thromboembolism in patients admitted by hospital using Microsoft Kinect V2. BioCAS 2015: 1-4 - 2014
- [j44]Ashley Davis, Sanjay Mehrotra, Jane Holl, Mark S. Daskin:
Nurse Staffing under demand Uncertainty to Reduce Costs and Enhance Patient Safety. Asia Pac. J. Oper. Res. 31(1) (2014) - [j43]Jian Hu, Tito Homem-de-Mello, Sanjay Mehrotra:
Stochastically weighted stochastic dominance concepts with an application in capital budgeting. Eur. J. Oper. Res. 232(3): 572-583 (2014) - [j42]Sanjay Mehrotra, He Zhang:
Models and algorithms for distributionally robust least squares problems. Math. Program. 146(1-2): 123-141 (2014) - [j41]Sanjay Mehrotra, Dávid Papp:
A Cutting Surface Algorithm for Semi-Infinite Convex Programming with an Application to Moment Robust Optimization. SIAM J. Optim. 24(4): 1670-1697 (2014) - [c4]Yun Li, Lyle Berkowitz, Gary Noskin, Sanjay Mehrotra:
Detection of patient's bed statuses in 3D using a Microsoft Kinect. EMBC 2014: 5900-5903 - 2013
- [j40]Kuo-Ling Huang, Sanjay Mehrotra:
An empirical evaluation of walk-and-round heuristics for mixed integer linear programs. Comput. Optim. Appl. 55(3): 545-570 (2013) - [j39]Jonathan P. Turner, Heron E. Rodriguez, Debra A. DaRosa, Mark S. Daskin, Amanda Hayman, Sanjay Mehrotra:
Northwestern University Feinberg School of Medicine Uses Operations Research Tools to Improve Surgeon Training. Interfaces 43(4): 341-351 (2013) - [j38]Sanjay Mehrotra, Dávid Papp:
Generating Moment Matching Scenarios Using Optimization Techniques. SIAM J. Optim. 23(2): 963-999 (2013) - [j37]He Zhang, Sanjay Mehrotra, David M. Liebovitz, Carl A. Gunter, Bradley A. Malin:
Mining Deviations from Patient Care Pathways via Electronic Medical Record System Audits. ACM Trans. Manag. Inf. Syst. 4(4): 17:1-17:20 (2013) - [c3]Ashley Davis, Sanjay Mehrotra, John Friedewald, Daniela P. Ladner:
Characteristics of a simulation model of the national kidney transplantation system. WSC 2013: 2320-2329 - 2012
- [j36]Jian Hu, Sanjay Mehrotra:
Robust and Stochastically Weighted Multiobjective Optimization Models and Reformulations. Oper. Res. 60(4): 936-953 (2012) - [j35]Jian Hu, Tito Homem-de-Mello, Sanjay Mehrotra:
Sample average approximation of stochastic dominance constrained programs. Math. Program. 133(1-2): 171-201 (2012) - [j34]Sanjay Mehrotra, Kuo-Ling Huang:
Computational experience with a modified potential reduction algorithm for linear programming. Optim. Methods Softw. 27(4-5): 865-891 (2012) - [i1]Sanjay Mehrotra, Dávid Papp:
Generating nested quadrature formulas for general weight functions with known moments. CoRR abs/1203.1554 (2012) - 2011
- [j33]Sanjay Mehrotra, Zhifeng Li:
Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices. J. Glob. Optim. 49(4): 623-649 (2011) - [j32]Michael Chen, Sanjay Mehrotra:
Self-concordance and Decomposition-based Interior Point Methods for the Two-stage Stochastic Convex Optimization Problem. SIAM J. Optim. 21(4): 1667-1687 (2011) - 2010
- [j31]Sanjay Mehrotra, Zhifeng Li:
Segment LLL Reduction of Lattice Bases Using Modular Arithmetic. Algorithms 3(3): 224-243 (2010) - [j30]Reuben Thomas, Luis de la Torre, Xiaoqing Chang, Sanjay Mehrotra:
Validation and characterization of DNA microarray gene expression data distribution and associated moments. BMC Bioinform. 11: 576 (2010) - [j29]Sanjay Mehrotra, M. Gökhan Özevin:
Convergence of a Weighted Barrier Decomposition Algorithm for Two-Stage Stochastic Programming with Discrete Support. SIAM J. Optim. 20(5): 2474-2486 (2010) - [c2]Brian Leung, Chih-Hung Wu, Seda Ogrenci Memik, Sanjay Mehrotra:
An Interior Point Optimization Solver for Real Time Inter-frame Collision Detection: Exploring Resource-Accuracy-Platform Tradeoffs. FPL 2010: 113-118
2000 – 2009
- 2009
- [j28]Sanjay Mehrotra, M. Gökhan Özevin:
Decomposition Based Interior Point Methods for Two-Stage Stochastic Convex Quadratic Programs with Recourse. Oper. Res. 57(4): 964-974 (2009) - [j27]Sanjay Mehrotra, M. Gökhan Özevin:
On the Implementation of Interior Point Decomposition Algorithms for Two-Stage Stochastic Conic Programs. SIAM J. Optim. 19(4): 1846-1880 (2009) - [j26]Tito Homem-de-Mello, Sanjay Mehrotra:
A Cutting-Surface Method for Uncertain Linear Programs with Polyhedral Stochastic Dominance Constraints. SIAM J. Optim. 20(3): 1250-1273 (2009) - [c1]Chih-Hung Wu, Seda Ogrenci Memik, Sanjay Mehrotra:
FPGA Implementation of the Interior-Point Algorithm with Applications to Collision Detection. FCCM 2009: 295-298 - 2007
- [j25]Reuben Thomas, Carlos J. Paredes, Sanjay Mehrotra, Vassily Hatzimanikatis, Eleftherios T. Papoutsakis:
A model-based optimization framework for the inference of regulatory interactions using time-course DNA microarray expression data. BMC Bioinform. 8 (2007) - [j24]Sanjay Mehrotra, M. Gökhan Özevin:
Decomposition-Based Interior Point Methods for Two-Stage Stochastic Semidefinite Programming. SIAM J. Optim. 18(1): 206-222 (2007) - 2005
- [j23]Ali Akgunduz, Prashant Banerjee, Sanjay Mehrotra:
A Linear Programming Solution for Exact Collision Detection. J. Comput. Inf. Sci. Eng. 5(1): 48-55 (2005) - [j22]Sanjay Mehrotra, Zhifeng Li:
Convergence Conditions and Krylov Subspace--Based Corrections for Primal-Dual Interior-Point Method. SIAM J. Optim. 15(3): 635-653 (2005) - 2004
- [j21]Reuben Thomas, Sanjay Mehrotra, Eleftherios T. Papoutsakis, Vassily Hatzimanikatis:
A model-based optimization framework for the inference on gene regulatory networks from DNA array data. Bioinform. 20(17): 3221-3235 (2004) - 2002
- [j20]Jonathan H. Owen, Sanjay Mehrotra:
On the Value of Binary Expansions for General Mixed-Integer Linear Programs. Oper. Res. 50(5): 810-819 (2002) - [j19]Robert A. Stubbs, Sanjay Mehrotra:
Generating Convex Polynomial Inequalities for Mixed 0-1 Programs. J. Glob. Optim. 24(3): 311-332 (2002) - 2001
- [j18]Cristian Luciano, Pat P. Banerjee, Sanjay Mehrotra:
3D Animation of Telecollaborative Anthropomorphic Avatars. Commun. ACM 44(12): 64-67 (2001) - [j17]Jonathan H. Owen, Sanjay Mehrotra:
Experimental Results on Using General Disjunctions in Branch-and-Bound for General-Integer Linear Programs. Comput. Optim. Appl. 20(2): 159-170 (2001) - [j16]Jonathan H. Owen, Sanjay Mehrotra:
A disjunctive cutting plane procedure for general mixed-integer linear programs. Math. Program. 89(3): 437-448 (2001)
1990 – 1999
- 1999
- [j15]Robert A. Stubbs, Sanjay Mehrotra:
A branch-and-cut method for 0-1 mixed convex programming. Math. Program. 86(3): 515-532 (1999) - 1998
- [j14]Joseph Czyzyk, Robert Fourer, Sanjay Mehrotra:
Using a Massively Parallel Processor to Solve Large Sparse Linear Programs by an Interior-Point Method. SIAM J. Sci. Comput. 19(2): 553-565 (1998) - 1996
- [j13]Renato D. C. Monteiro, Sanjay Mehrotra:
A general parametric analysis approach and its implication to sensitivity analysis in interior point methods. Math. Program. 72: 65-82 (1996) - [j12]Sanjay Mehrotra:
Asymptotic convergence in a generalized predictor-corrector method. Math. Program. 74: 11-28 (1996) - 1995
- [j11]Joseph Czyzyk, Robert Fourer, Sanjay Mehrotra:
A Study of the Augmented System and Column-Splitting Approaches for Solving Two-Stage Stochastic Linear Programs by Interior-Point Methods. INFORMS J. Comput. 7(4): 474-490 (1995) - 1994
- [j10]Sanjay Mehrotra, Robert A. Stubbs:
Predictor-corrector Methods for a Class of Linear Complementarity Problems. SIAM J. Optim. 4(2): 441-453 (1994) - 1993
- [j9]Sanjay Mehrotra:
Quadratic Convergence in a Primal-Dual Method. Math. Oper. Res. 18(3): 741-751 (1993) - [j8]Robert Fourer, Sanjay Mehrotra:
Solving symmetric indefinite systems in an interior-point method for linear programming. Math. Program. 62: 15-39 (1993) - [j7]Sanjay Mehrotra, Yinyu Ye:
Finding an interior point in the optimal face of linear programs. Math. Program. 62: 497-515 (1993) - 1992
- [j6]Sanjay Mehrotra:
Implementations of Affine Scaling Methods: Approximate Solutions of Systems of Linear Equations Using Preconditioned Conjugate Gradient Methods. INFORMS J. Comput. 4(2): 103-118 (1992) - [j5]Sanjay Mehrotra:
On the Implementation of a Primal-Dual Interior Point Method. SIAM J. Optim. 2(4): 575-601 (1992) - 1991
- [j4]Sanjay Mehrotra, Jie Sun:
On computing the center of a convex quadratically constrained set. Math. Program. 50: 81-89 (1991) - 1990
- [j3]Sanjay Mehrotra, Jie Sun:
An Algorithm for Convex Quadratic Programming That Requires O(n3.5L) Arithmetic Operations. Math. Oper. Res. 15(2): 342-363 (1990)
1980 – 1989
- 1988
- [j2]Donald Goldfarb, Sanjay Mehrotra:
Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value. Math. Program. 40(1-3): 183-195 (1988) - [j1]Donald Goldfarb, Sanjay Mehrotra:
A relaxed version of Karmarkar's method. Math. Program. 40(1-3): 289-315 (1988)
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-10-22 20:17 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:
