Sanjay Mehrotra

From MaRDI portal
Person:173876

Available identifiers

zbMath Open mehrotra.sanjayMaRDI QIDQ173876

List of research outcomes





PublicationDate of PublicationType
Optimization modeling for pandemic vaccine supply chain management: a review and future research opportunities2024-11-05Paper
A disjunctive cutting plane algorithm for bilinear programming2024-10-22Paper
An algorithm for stochastic convex-concave fractional programs with applications to production efficiency and equitable resource allocation2024-08-13Paper
Service center location problems with decision dependent utilities and a pandemic case study2024-03-06Paper
Elevating Industries with Unmanned Aerial Vehicles: Integrating Sustainability and Operational Innovation2023-12-20Paper
A model of <scp>supply‐chain</scp> decisions for resource sharing with an application to ventilator allocation to combat <scp>COVID</scp>‐192023-10-12Paper
Optimizing Equitable Resource Allocation in Parallel Any-Scale Queues with Service Abandonment and its Application to Liver Transplant2023-09-16Paper
Optimization Modeling for Pandemic Vaccine Supply Chain Management: A Review and Future Research Opportunities2023-05-18Paper
A decomposition method for distributionally-robust two-stage stochastic mixed-integer conic programs2022-11-14Paper
Numerical Methods for Integral Equations of the Second Kind with NonSmooth Solutions of Bounded Variation2022-10-06Paper
Frameworks and results in distributionally robust optimization2022-08-20Paper
Distributionally Robust Two-Stage Stochastic Programming2022-07-29Paper
Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning2022-06-28Paper
A New Method for Computing Stationary Distribution and Steady-State Performance Measures of a Continuous-State Markov Chain with a Queuing Application2021-12-28Paper
A geometric branch and bound method for robust maximization of convex functions2021-11-26Paper
Solution Approaches to Linear Fractional Programming and Its Stochastic Generalizations Using Second Order Cone Approximations2021-03-31Paper
Distributionally robust optimization with decision dependent ambiguity sets2021-02-17Paper
A Data-Driven Functionally Robust Approach for Simultaneous Pricing and Order Quantity Decisions with Unknown Demand Function2020-10-26Paper
Service Center Location with Decision Dependent Utilities with an Application to Early Stage Testing and Vaccination in Epidemic Planning2019-10-22Paper
On solving two-stage distributionally robust disjunctive programs with a general ambiguity set2019-07-05Paper
Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models2019-06-25Paper
Generation of feasible integer solutions on a massively parallel computer using the feasibility pump2019-02-22Paper
Decomposition Algorithms for Two-Stage Distributionally Robust Mixed Binary Programs2018-09-12Paper
Segment LLL reduction of lattice bases using modular arithmetic2018-08-20Paper
Robust decision making using a general utility set2018-05-22Paper
Tight Second Stage Formulations in Two-Stage Stochastic Mixed Integer Programs2018-04-03Paper
A Concentration Result of Estimating Phi-Divergence using Data Dependent Partition2018-01-02Paper
Solution of Monotone Complementarity and General Convex Programming Problems Using a Modified Potential Reduction Interior Point Method2017-06-02Paper
Decomposition Algorithm for Distributionally Robust Optimization using Wasserstein Metric2017-04-12Paper
A two-stage stochastic integer programming approach to integrated staffing and scheduling with application to nurse management2016-04-05Paper
An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs2015-07-01Paper
A Cutting Surface Algorithm for Semi-Infinite Convex Programming with an Application to Moment Robust Optimization2015-04-08Paper
Stochastically weighted stochastic dominance concepts with an application in capital budgeting2015-02-18Paper
Models and algorithms for distributionally robust least squares problems2014-08-29Paper
NURSE STAFFING UNDER DEMAND UNCERTAINTY TO REDUCE COSTS AND ENHANCE PATIENT SAFETY2014-04-25Paper
Generating moment matching scenarios using optimization techniques2013-09-25Paper
An empirical evaluation of walk-and-round heuristics for mixed integer linear programs2013-08-08Paper
Robust and Stochastically Weighted Multiobjective Optimization Models and Reformulations2012-12-07Paper
Computational experience with a modified potential reduction algorithm for linear programming2012-11-06Paper
Sample average approximation of stochastic dominance constrained programs2012-06-26Paper
Generating nested quadrature formulas for general weight functions with known moments2012-03-07Paper
Decomposition Based Interior Point Methods for Two-Stage Stochastic Convex Quadratic Programs with Recourse2011-11-24Paper
Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices2011-05-23Paper
Convergence of a Weighted Barrier Decomposition Algorithm for Two-Stage Stochastic Programming with Discrete Support2011-03-21Paper
A Cutting-Surface Method for Uncertain Linear Programs with Polyhedral Stochastic Dominance Constraints2010-09-06Paper
On the Implementation of Interior Point Decomposition Algorithms for Two-Stage Stochastic Conic Programs2009-11-27Paper
On the Value of Binary Expansions for General Mixed-Integer Linear Programs2009-07-03Paper
https://portal.mardi4nfdi.de/entity/Q36324552009-06-11Paper
Decomposition‐Based Interior Point Methods for Two‐Stage Stochastic Semidefinite Programming2008-02-25Paper
Convergence Conditions and Krylov Subspace--Based Corrections for Primal-Dual Interior-Point Method2005-09-16Paper
Generating convex polynomial inequalities for mixed 0-1 programs2003-06-09Paper
Experimental results on using general disjunctions in branch-and-bound for general-integer linear programming2002-04-07Paper
A disjunctive cutting plane procedure for general mixed-integer linear programs2001-10-03Paper
A branch-and-cut method for 0-1 mixed convex programming2000-10-29Paper
Using a Massively Parallel Processor to Solve Large Sparse Linear Programs by an Interior-Point Method1998-05-12Paper
Asymptotic convergence in a generalized predictor-corrector method1997-08-18Paper
https://portal.mardi4nfdi.de/entity/Q31255231997-03-18Paper
A Study of the Augmented System and Column-Splitting Approaches for Solving Two-Stage Stochastic Linear Programs by Interior-Point Methods1996-08-19Paper
A general parametric analysis approach and its implication to sensitivity analysis in interior point methods1996-07-28Paper
Finding an interior point in the optimal face of linear programs1995-01-03Paper
Solving symmetric indefinite systems in an interior-point method for linear programming1994-12-21Paper
Predictor-corrector Methods for a Class of Linear Complementarity Problems1994-08-14Paper
Quadratic Convergence in a Primal-Dual Method1993-11-28Paper
DEFERRED RANK ONE UPDATES IN O(n_3L) INTERIOR POINT ALGORITHM1993-08-17Paper
Implementations of Affine Scaling Methods: Approximate Solutions of Systems of Linear Equations Using Preconditioned Conjugate Gradient Methods1993-04-01Paper
On the Implementation of a Primal-Dual Interior Point Method1993-01-13Paper
A method of Analytic Centers for Quadratically Constrained Convex Quadratic Programs1992-06-25Paper
On finding a vertex solution using interior point methods1992-06-25Paper
On computing the center of a convex quadratically constrained set1991-01-01Paper
A computational comparison of the network simplex method with the dual affine scaling method1991-01-01Paper
An Algorithm for Convex Quadratic Programming That Requires O(n3.5L) Arithmetic Operations1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q52028511990-01-01Paper
A Self-Correcting Version of Karmarkar’s Algorithm1989-01-01Paper
A relaxed version of Karmarkar's method1988-01-01Paper
Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value1988-01-01Paper
A Finitely Convergent Cutting Plane, and a Bender's Decomposition Algorithm for Mixed-Integer Convex and Two-Stage Convex Programs using Cutting PlanesN/APaper

Research outcomes over time

This page was built for person: Sanjay Mehrotra