default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJitamitra Desai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j13]Jitamitra Desai
, Sandeep Srivathsan, Woen Yon Lai, Liqun Li, Chuhang Yu:
An optimization-based decision support tool for air cargo loading. Comput. Ind. Eng. 175: 108816 (2023)- 2022
- [j12]Rakesh Prakash, Jitamitra Desai, Rajesh Piplani:
An optimal data-splitting algorithm for aircraft sequencing on a single runway. Ann. Oper. Res. 309(2): 587-610 (2022) - 2020
- [c3]Jitamitra Desai, Ashish Singh Bhandari:
A 0-1 Mixed-Integer Program Approach towards Solving the Stochastic Aircraft Sequencing Problem with Constant Deceleration Rate. IEEM 2020: 781-785
2010 – 2019
- 2019
- [j11]Kai Wang, Jitamitra Desai:
On the convergence rate of the augmented Lagrangian-based parallel splitting method. Optim. Methods Softw. 34(2): 278-304 (2019) - 2018
- [c2]Massinissa Merabet, Jitamitra Desai, Miklós Molnár:
A Generalization of the Minimum Branch Vertices Spanning Tree Problem. ISCO 2018: 338-351 - 2017
- [j10]Jitamitra Desai, Shalinee Kishore:
A global optimization framework for distributed antenna location in CDMA cellular networks. Ann. Oper. Res. 253(1): 169-191 (2017) - [j9]Kai Wang, Jitamitra Desai, Hongjin He:
A proximal partially parallel splitting method for separable convex programs. Optim. Methods Softw. 32(1): 39-68 (2017) - 2016
- [j8]Hongjin He, Jitamitra Desai, Kai Wang:
A primal-dual prediction-correction algorithm for saddle point optimization. J. Glob. Optim. 66(3): 573-583 (2016) - [j7]Rupaj Kumar Nayak, Jitamitra Desai:
A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem. Optim. Lett. 10(7): 1417-1448 (2016) - [c1]Jitamitra Desai, Rakesh Prakash:
An Optimization Framework for Terminal Sequencing and Scheduling: The Single Runway Case. CSDM Asia 2016: 195-207 - 2015
- [j6]Kai Wang, Jitamitra Desai, Hongjin He:
A note on augmented Lagrangian-based parallel splitting method. Optim. Lett. 9(6): 1199-1212 (2015) - 2012
- [j5]Hanif D. Sherali, Evrim Dalkiran, Jitamitra Desai:
Enhancing RLT-based relaxations for polynomial programming problems via a new class of v-semidefinite cuts. Comput. Optim. Appl. 52(2): 483-506 (2012) - 2010
- [j4]Jitamitra Desai, Suvrajeet Sen:
A global optimization algorithm for reliable network design. Eur. J. Oper. Res. 200(1): 1-8 (2010)
2000 – 2009
- 2008
- [j3]Hanif D. Sherali, Jitamitra Desai, Theodore S. Glickman:
Optimal Allocation of Risk-Reduction Resources in Event Trees. Manag. Sci. 54(7): 1313-1321 (2008) - 2005
- [j2]Hanif D. Sherali, Jitamitra Desai:
A Global Optimization RLT-based Approach for Solving the Hard Clustering Problem. J. Glob. Optim. 32(2): 281-306 (2005) - [j1]Hanif D. Sherali, Jitamitra Desai:
A Global Optimization RLT-based Approach for Solving the Fuzzy Clustering Problem. J. Glob. Optim. 33(4): 597-615 (2005)
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-04-25 05:45 CEST 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:
