Mohit Tawarmalani

According to our database1, Mohit Tawarmalani authored at least 31 papers between 2001 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.



In proceedings 
PhD thesis 




On cutting planes for cardinality-constrained linear programs.
Math. Program., 2019

Cardinality Bundling with Spence-Mirrlees Reservation Prices.
Management Science, 2019

Global optimization of multicomponent distillation configurations: Global minimization of total cost for multicomponent mixture separations.
Computers & Chemical Engineering, 2019

An MINLP formulation for the optimization of multicomponent distillation configurations.
Computers & Chemical Engineering, 2019

Deriving convex hulls through lifting and projection.
Math. Program., 2018

Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction.
SIAM Journal on Optimization, 2017

Information Theoretic Limits for Linear Prediction with Graph-Structured Sparsity.
CoRR, 2017

Robust Validation of Network Designs under Uncertain Demands and Failures.
Proceedings of the 14th USENIX Symposium on Networked Systems Design and Implementation, 2017

Information theoretic limits for linear prediction with graph-structured sparsity.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Economic and Policy Implications of Restricted Patch Distribution.
Management Science, 2016

Global optimization of nonconvex problems with multilinear intermediates.
Math. Program. Comput., 2015

Lifted inequalities for $$0\mathord {-}1$$ mixed-integer bilinear covering sets.
Math. Program., 2014

Performance Sensitive Replication in Geo-distributed Cloud Datastores.
Proceedings of the 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, 2014

Explicit convex and concave envelopes through polyhedral subdivisions.
Math. Program., 2013

D-tunes: self tuning datastores for geo-distributed interactive applications.
Proceedings of the ACM SIGCOMM 2013 Conference, 2013

Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons.
Math. Program., 2011

Convexification Techniques for Linear Complementarity Constraints.
Proceedings of the Integer Programming and Combinatoral Optimization, 2011

Strong valid inequalities for orthogonal disjunctions and bilinear covering sets.
Math. Program., 2010

Lifting inequalities: a framework for generating strong cuts for nonlinear programs.
Math. Program., 2010

Cloudward bound: planning for beneficial migration of enterprise applications to the cloud.
Proceedings of the ACM SIGCOMM 2010 Conference on Applications, 2010

Time-Dependent Traveling Salesman Problem.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs.
Optimization Methods and Software, 2009

Allocating Objects in a Network of Caches: Centralized and Decentralized Analyses.
Management Science, 2009

The Countervailing Incentive of Restricted Patch Distribution: Economic and Policy Implications.
Proceedings of the 6th Annual Workshop on the Economics of Information Security, 2007

A polyhedral branch-and-cut approach to global optimization.
Math. Program., 2005

Accelerating Branch-and-Bound through a Modeling Language Construct for Relaxation-Specific Constraints.
J. Global Optimization, 2005

Global optimization of mixed-integer nonlinear programs: A theoretical and computational study.
Math. Program., 2004

A finite branch-and-bound algorithm for two-stage stochastic integer programs.
Math. Program., 2004

Convex extensions and envelopes of lower semi-continuous functions.
Math. Program., 2002

Global Optimization of 0-1 Hyperbolic Programs.
J. Global Optimization, 2002

Semidefinite Relaxations of Fractional Programs via Novel Convexification Techniques.
J. Global Optimization, 2001