Mohit Tawarmalani

Orcid: 0000-0003-3085-0084

According to our database1, Mohit Tawarmalani authored at least 47 papers between 2001 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Global minimization of power consumptions for multicomponent gas membrane cascades.
Comput. Chem. Eng., January, 2024

Piecewise Polyhedral Relaxations of Multilinear Optimization.
SIAM J. Optim., 2024

MIP Relaxations in Factorable Programming.
SIAM J. Optim., 2024

Advances in MINLP to Identify Energy-Efficient Distillation Configurations.
Oper. Res., 2024

Optimization of distillation configurations for multicomponent-product distillations.
Comput. Chem. Eng., 2024

Active Learning for Fair and Stable Online Allocations.
Proceedings of the 25th ACM Conference on Economics and Computation, 2024

Transferable Neural WAN TE for Changing Topologies.
Proceedings of the ACM SIGCOMM 2024 Conference, 2024

Leo: Online ML-based Traffic Classification at Multi-Terabit Line Rate.
Proceedings of the 21st USENIX Symposium on Networked Systems Design and Implementation, 2024

2023
An MINLP formulation to identify thermodynamically-efficient distillation configurations.
Comput. Chem. Eng., October, 2023

2022
Convexification of Permutation-Invariant Sets and an Application to Sparse Principal Component Analysis.
Math. Oper. Res., November, 2022

Probability estimation via policy restrictions, convexification, and approximate sampling.
Math. Program., 2022

Tractable Relaxations of Composite Functions.
Math. Oper. Res., 2022

Flexile: meeting bandwidth objectives almost always.
Proceedings of the 18th International Conference on emerging Networking EXperiments and Technologies, 2022

2021
A new framework to relax composite functions in nonlinear programs.
Math. Program., 2021

Convexification techniques for linear complementarity constraints.
J. Glob. Optim., 2021

FloMore: Meeting bandwidth requirements of flows.
CoRR, 2021

2020
PCF: Provably Resilient Flexible Routing.
Proceedings of the SIGCOMM '20: Proceedings of the 2020 Annual conference of the ACM Special Interest Group on Data Communication on the applications, 2020

2019
Lancet: Better Network Resilience by Designing for Pruned Failure Sets.
Proc. ACM Meas. Anal. Comput. Syst., 2019

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

Cardinality Bundling with Spence-Mirrlees Reservation Prices.
Manag. Sci., 2019

Global optimization of multicomponent distillation configurations: Global minimization of total cost for multicomponent mixture separations.
Comput. Chem. Eng., 2019

An MINLP formulation for the optimization of multicomponent distillation configurations.
Comput. Chem. Eng., 2019

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

2017
Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction.
SIAM J. Optim., 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

2016
Economic and Policy Implications of Restricted Patch Distribution.
Manag. Sci., 2016

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

2014
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

2013
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

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

2010
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

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

Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs.
Optim. Methods Softw., 2009

Allocating Objects in a Network of Caches: Centralized and Decentralized Analyses.
Manag. Sci., 2009

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

2005
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. Glob. Optim., 2005

2004
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

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

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

2001
Semidefinite Relaxations of Fractional Programs via Novel Convexification Techniques.
J. Glob. Optim., 2001


  Loading...