default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMohit Tawarmalani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j34]Zewei Chen, Mohit Tawarmalani
, Rakesh Agrawal:
Global minimization of power consumptions for multicomponent gas membrane cascades. Comput. Chem. Eng. 180: 108464 (2024)- [j33]Tony Joseph Mathew, Sundar Narayanan, Amrit Jalan, Logan R. Matthews, Himanshu Gupta, Rustom Billimoria, Carla Sofia Pereira, Chris Goheen, Mohit Tawarmalani, Rakesh Agrawal:
Optimization of distillation configurations for multicomponent-product distillations. Comput. Chem. Eng. 184: 108628 (2024) - [j32]Radhakrishna Tumbalam Gooty, Rakesh Agrawal, Mohit Tawarmalani:
Advances in MINLP to Identify Energy-Efficient Distillation Configurations. Oper. Res. 72(2): 639-659 (2024) - [j31]Taotao He, Mohit Tawarmalani:
MIP Relaxations in Factorable Programming. SIAM J. Optim. 34(3): 2856-2882 (2024) - [j30]Jongeun Kim, Jean-Philippe P. Richard, Mohit Tawarmalani:
Piecewise Polyhedral Relaxations of Multilinear Optimization. SIAM J. Optim. 34(4): 3167-3193 (2024) - [c12]Syed Usman Jafri, Sanjay G. Rao, Vishal Shrivastav, Mohit Tawarmalani:
Leo: Online ML-based Traffic Classification at Multi-Terabit Line Rate. NSDI 2024 - [c11]Abd AlRhman AlQiam, Yuanjun Yao, Zhaodong Wang, Satyajeet Singh Ahuja, Ying Zhang, Sanjay G. Rao, Bruno Ribeiro, Mohit Tawarmalani:
Transferable Neural WAN TE for Changing Topologies. SIGCOMM 2024: 86-102 - [i3]Riddhiman Bhattacharya, Thanh Nguyen, Will Wei Sun, Mohit Tawarmalani:
Active Learning for Fair and Stable Online Allocations. CoRR abs/2406.14784 (2024) - 2023
- [j29]Radhakrishna Tumbalam Gooty, Tony Joseph Mathew, Mohit Tawarmalani, Rakesh Agrawal:
An MINLP formulation to identify thermodynamically-efficient distillation configurations. Comput. Chem. Eng. 178: 108369 (2023) - 2022
- [j28]Taotao He, Mohit Tawarmalani:
Tractable Relaxations of Composite Functions. Math. Oper. Res. 47(2): 1110-1140 (2022) - [j27]Jinhak Kim, Mohit Tawarmalani, Jean-Philippe P. Richard:
Convexification of Permutation-Invariant Sets and an Application to Sparse Principal Component Analysis. Math. Oper. Res. 47(4): 2547-2584 (2022) - [j26]Ashish Chandra, Mohit Tawarmalani:
Probability estimation via policy restrictions, convexification, and approximate sampling. Math. Program. 196(1): 309-345 (2022) - [c10]Chuan Jiang, Zixuan Li, Sanjay G. Rao, Mohit Tawarmalani:
Flexile: meeting bandwidth objectives almost always. CoNEXT 2022: 110-125 - 2021
- [j25]Trang T. Nguyen, Jean-Philippe P. Richard, Mohit Tawarmalani:
Convexification techniques for linear complementarity constraints. J. Glob. Optim. 80(2): 249-286 (2021) - [j24]Taotao He, Mohit Tawarmalani:
A new framework to relax composite functions in nonlinear programs. Math. Program. 190(1): 427-466 (2021) - [i2]Chuan Jiang, Sanjay G. Rao, Mohit Tawarmalani:
FloMore: Meeting bandwidth requirements of flows. CoRR abs/2108.03221 (2021) - 2020
- [c9]Chuan Jiang, Sanjay G. Rao, Mohit Tawarmalani:
PCF: Provably Resilient Flexible Routing. SIGCOMM 2020: 139-153 - [c8]Yiyang Chang, Chuan Jiang, Ashish Chandra, Sanjay G. Rao, Mohit Tawarmalani:
Lancet: Better network resilience by designing for pruned failure sets. SIGMETRICS (Abstracts) 2020: 53-54
2010 – 2019
- 2019
- [j23]Radhakrishna Tumbalam Gooty, Rakesh Agrawal, Mohit Tawarmalani:
An MINLP formulation for the optimization of multicomponent distillation configurations. Comput. Chem. Eng. 125: 13-30 (2019) - [j22]Zheyu Jiang, Tony Joseph Mathew, Haibo Zhang, Joshua Huff, Ulaganathan Nallasivam, Mohit Tawarmalani, Rakesh Agrawal:
Global optimization of multicomponent distillation configurations: Global minimization of total cost for multicomponent mixture separations. Comput. Chem. Eng. 126: 249-262 (2019) - [j21]Jianqing, Mohit Tawarmalani, Karthik N. Kannan:
Cardinality Bundling with Spence-Mirrlees Reservation Prices. Manag. Sci. 65(4): 1891-1908 (2019) - [j20]Jinhak Kim, Mohit Tawarmalani, Jean-Philippe P. Richard:
On cutting planes for cardinality-constrained linear programs. Math. Program. 178(1-2): 417-448 (2019) - [j19]Yiyang Chang, Chuan Jiang, Ashish Chandra, Sanjay G. Rao, Mohit Tawarmalani:
Lancet: Better Network Resilience by Designing for Pruned Failure Sets. Proc. ACM Meas. Anal. Comput. Syst. 3(3): 49:1-49:26 (2019) - 2018
- [j18]Trang T. Nguyen, Jean-Philippe P. Richard, Mohit Tawarmalani:
Deriving convex hulls through lifting and projection. Math. Program. 169(2): 377-415 (2018) - 2017
- [j17]Danial Davarnia, Jean-Philippe P. Richard, Mohit Tawarmalani:
Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction. SIAM J. Optim. 27(3): 1801-1833 (2017) - [c7]Adarsh Barik, Jean Honorio, Mohit Tawarmalani:
Information theoretic limits for linear prediction with graph-structured sparsity. ISIT 2017: 2348-2352 - [c6]Yiyang Chang, Sanjay G. Rao, Mohit Tawarmalani:
Robust Validation of Network Designs under Uncertain Demands and Failures. NSDI 2017: 347-362 - [i1]Adarsh Barik, Jean Honorio, Mohit Tawarmalani:
Information Theoretic Limits for Linear Prediction with Graph-Structured Sparsity. CoRR abs/1701.07895 (2017) - 2016
- [j16]Karthik N. Kannan, Mohammad Saifur Rahman, Mohit Tawarmalani:
Economic and Policy Implications of Restricted Patch Distribution. Manag. Sci. 62(11): 3161-3182 (2016) - 2015
- [j15]Xiaowei Bao, Aida Khajavirad, Nikolaos V. Sahinidis, Mohit Tawarmalani:
Global optimization of nonconvex problems with multilinear intermediates. Math. Program. Comput. 7(1): 1-37 (2015) - 2014
- [j14]Kwanghun Chung, Jean-Philippe P. Richard, Mohit Tawarmalani:
Lifted inequalities for $$0\mathord {-}1$$ mixed-integer bilinear covering sets. Math. Program. 145(1-2): 403-450 (2014) - [c5]Shankaranarayanan P. N., Ashiwan Sivakumar, Sanjay G. Rao, Mohit Tawarmalani:
Performance Sensitive Replication in Geo-distributed Cloud Datastores. DSN 2014: 240-251 - 2013
- [j13]Mohit Tawarmalani, Jean-Philippe P. Richard, Chuanhui Xiong:
Explicit convex and concave envelopes through polyhedral subdivisions. Math. Program. 138(1-2): 531-577 (2013) - [c4]Shankaranarayanan P. N., Ashiwan Sivakumar, Sanjay G. Rao, Mohit Tawarmalani:
D-tunes: self tuning datastores for geo-distributed interactive applications. SIGCOMM 2013: 483-484 - 2011
- [j12]Xiaowei Bao, Nikolaos V. Sahinidis, Mohit Tawarmalani:
Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons. Math. Program. 129(1): 129-157 (2011) - [c3]Trang T. Nguyen, Mohit Tawarmalani, Jean-Philippe P. Richard:
Convexification Techniques for Linear Complementarity Constraints. IPCO 2011: 336-348 - 2010
- [j11]Jean-Philippe P. Richard, Mohit Tawarmalani:
Lifting inequalities: a framework for generating strong cuts for nonlinear programs. Math. Program. 121(1): 61-104 (2010) - [j10]Mohit Tawarmalani, Jean-Philippe P. Richard, Kwanghun Chung:
Strong valid inequalities for orthogonal disjunctions and bilinear covering sets. Math. Program. 124(1-2): 481-512 (2010) - [c2]Mohammad Y. Hajjat, Xin Sun, Yu-Wei Eric Sung, David A. Maltz, Sanjay G. Rao, Kunwadee Sripanidkulchai, Mohit Tawarmalani:
Cloudward bound: planning for beneficial migration of enterprise applications to the cloud. SIGCOMM 2010: 243-254
2000 – 2009
- 2009
- [j9]Mohit Tawarmalani, Karthik N. Kannan, Prabuddha De:
Allocating Objects in a Network of Caches: Centralized and Decentralized Analyses. Manag. Sci. 55(1): 132-147 (2009) - [j8]Xiaowei Bao, Nikolaos V. Sahinidis, Mohit Tawarmalani:
Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs. Optim. Methods Softw. 24(4-5): 485-504 (2009) - [r1]Mohit Tawarmalani, Nikolaos V. Sahinidis:
Time-Dependent Traveling Salesman Problem. Encyclopedia of Optimization 2009: 3902-3908 - 2007
- [c1]Mohammad Saifur Rahman, Karthik N. Kannan, Mohit Tawarmalani:
The Countervailing Incentive of Restricted Patch Distribution: Economic and Policy Implications. WEIS 2007 - 2005
- [j7]Nikolaos V. Sahinidis, Mohit Tawarmalani:
Accelerating Branch-and-Bound through a Modeling Language Construct for Relaxation-Specific Constraints. J. Glob. Optim. 32(2): 259-280 (2005) - [j6]Mohit Tawarmalani, Nikolaos V. Sahinidis:
A polyhedral branch-and-cut approach to global optimization. Math. Program. 103(2): 225-249 (2005) - 2004
- [j5]Mohit Tawarmalani, Nikolaos V. Sahinidis:
Global optimization of mixed-integer nonlinear programs: A theoretical and computational study. Math. Program. 99(3): 563-591 (2004) - [j4]Shabbir Ahmed, Mohit Tawarmalani, Nikolaos V. Sahinidis:
A finite branch-and-bound algorithm for two-stage stochastic integer programs. Math. Program. 100(2): 355-377 (2004) - 2002
- [j3]Mohit Tawarmalani, Shabbir Ahmed, Nikolaos V. Sahinidis:
Global Optimization of 0-1 Hyperbolic Programs. J. Glob. Optim. 24(4): 385-416 (2002) - [j2]Mohit Tawarmalani, Nikolaos V. Sahinidis:
Convex extensions and envelopes of lower semi-continuous functions. Math. Program. 93(2): 247-263 (2002) - 2001
- [j1]Mohit Tawarmalani, Nikolaos V. Sahinidis:
Semidefinite Relaxations of Fractional Programs via Novel Convexification Techniques. J. Glob. Optim. 20(2): 133-154 (2001)
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-11-07 21:29 CET 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:
