( en | de | ru )

 

Disambiguation of "Mehrotra, Sanjay"

Author of the publication

copydeleteadd this publication to your clipboard
Nurse Staffing under demand Uncertainty to Reduce Costs and Enhance Patient Safety.

, , , and . Asia Pac. J. Oper. Res., (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Vikas Mehrotra

Sanjay Kashikar

Sanjay Shahi

Sanjay Kumar

Benod Mehrotra

 

Other publications of authors with the same name

An Algorithm for Convex Quadratic Programming That Requires O(n3.5L) Arithmetic Operations., and . Math. Oper. Res., 15 (2): 342-363 (1990)A Moment Matching Approach for Generating Synthetic Data., and . Big Data, 4 (3): 160-178 (2016)Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models., and . Eur. J. Oper. Res., 278 (1): 20-35 (2019)Preventing venous thromboembolism in patients admitted by hospital using Microsoft Kinect V2., , and . BioCAS, page 1-4. IEEE, (2015)A Study of the Augmented System and Column-Splitting Approaches for Solving Two-Stage Stochastic Linear Programs by Interior-Point Methods., , and . INFORMS J. Comput., 7 (4): 474-490 (1995)A Cutting Surface Algorithm for Semi-Infinite Convex Programming with an Application to Moment Robust Optimization., and . SIAM J. Optimization, 24 (4): 1670-1697 (2014)On the Implementation of a Primal-Dual Interior Point Method.. SIAM J. Optimization, 2 (4): 575-601 (1992)Convergence of a Weighted Barrier Decomposition Algorithm for Two-Stage Stochastic Programming with Discrete Support., and . SIAM J. Optimization, 20 (5): 2474-2486 (2010)Scenario generation for stochastic optimization problems via the sparse grid method., , and . Comput. Optim. Appl., 62 (3): 669-692 (2015)Experimental Results on Using General Disjunctions in Branch-and-Bound for General-Integer Linear Programs., and . Comput. Optim. Appl., 20 (2): 159-170 (2001)