default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPrakash Mirchandani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j28]Joyaditya Laik
, Prakash Mirchandani:
Effect of seasonality, sales growth rate, and fiscal year end on cash conversion cycle. Decis. Sci. 54(1): 43-63 (2023)- 2022
- [j27]Anantaram Balakrishnan, Prakash Mirchandani, Sifeng Lin:
Crew Assignment with Duty Time Limits for Transport Services: Tight Multicommodity Models. Oper. Res. 70(2): 690-714 (2022)
2010 – 2019
- 2017
- [j26]Anantaram Balakrishnan, Gang Li, Prakash Mirchandani:
Optimal Network Design with End-to-End Service Requirements. Oper. Res. 65(3): 729-750 (2017) - 2013
- [j25]Anantaram Balakrishnan, Mihai Banciu, Karolina J. Glowacka, Prakash Mirchandani:
Hierarchical approach for survivable network design. Eur. J. Oper. Res. 225(2): 223-235 (2013) - [j24]Mihai Banciu, Prakash Mirchandani:
Technical Note - New Results Concerning Probability Distributions with Increasing Generalized Failure Rates. Oper. Res. 61(4): 925-931 (2013) - [j23]Prakash Mirchandani, Tobias (Tim) Ehlich:
Case Article - Acusis: Medical Transcription Outsourcing. INFORMS Trans. Educ. 13(3): 162-164 (2013) - [j22]Prakash Mirchandani, Tobias (Tim) Ehlich:
Case - Acusis: Medical Transcription Outsourcing. INFORMS Trans. Educ. 13(3): 165-171 (2013) - 2010
- [j21]Prakash Mirchandani:
Case Article - Process Control and Design of Experiments/ANOVA. INFORMS Trans. Educ. 10(2): 74-78 (2010) - [j20]Prakash Mirchandani:
Case - The MotoTech Manufacturing Company: Process Control and Improvement. INFORMS Trans. Educ. 10(2): 79-84 (2010) - [j19]Prakash Mirchandani:
Case - The MotoTech Manufacturing Company: Design of Experiments/ANOVA. INFORMS Trans. Educ. 10(2): 85-89 (2010) - [j18]Prakash Mirchandani:
Teaching Note - The MotoTech Manufacturing Company: Process Control and Improvement. INFORMS Trans. Educ. 10(2): 90-94 (2010) - [j17]Prakash Mirchandani:
Teaching Note - The MotoTech Manufacturing Company: Design of Experiments/ANOVA. INFORMS Trans. Educ. 10(2): 95-97 (2010) - [j16]Mihai Banciu, Esther Gal-Or, Prakash Mirchandani:
Bundling Strategies When Products Are Vertically Differentiated and Capacities Are Limited. Manag. Sci. 56(12): 2207-2223 (2010)
2000 – 2009
- 2009
- [j15]Anantaram Balakrishnan, Prakash Mirchandani, Harihara Prasad Natarajan:
Connectivity Upgrade Models for Survivable Network Design. Oper. Res. 57(1): 170-186 (2009) - 2004
- [j14]Rajeev Kohli, Ramesh Krishnamurti, Prakash Mirchandani:
Average performance of greedy heuristics for the integer knapsack problem. Eur. J. Oper. Res. 154(1): 36-45 (2004) - [j13]Anantaram Balakrishnan, Thomas L. Magnanti, Prakash Mirchandani:
Connectivity-splitting models for survivable network design. Networks 43(1): 10-27 (2004) - 2003
- [p1]Clifford Stein, Lisa Fleischer, Douglas R. Shier, Prakash Mirchandani, David Simchi-Levi:
Networks and Flows. Handbook of Graph Theory 2003: 1074-1142 - 2001
- [j12]Prakash Mirchandani, G. G. Hegde, Richard E. Wendell:
Enhancing Competitiveness of the Customer Loan Center at Promistar Financial Corporation. Interfaces 31(3): 28-43 (2001) - [j11]Anantaram Balakrishnan, Thomas L. Magnanti, Prakash Mirchandani:
Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems. Oper. Res. Lett. 29(3): 99-106 (2001) - 2000
- [j10]Prakash Mirchandani:
Projections of the capacitated network loading problem. Eur. J. Oper. Res. 122(3): 534-560 (2000)
1990 – 1999
- 1998
- [j9]Anantaram Balakrishnan, Thomas L. Magnanti, Prakash Mirchandani:
Designing Hierarchical Survivable Networks. Oper. Res. 46(1): 116-136 (1998) - 1996
- [j8]Prakash Mirchandani:
The Multi-Tier Tree Problem. INFORMS J. Comput. 8(3): 202-218 (1996) - [j7]Anantaram Balakrishnan, Thomas L. Magnanti, Prakash Mirchandani:
Heuristics, LPs, and Trees on Trees: Network Design Analyses. Oper. Res. 44(3): 478-496 (1996) - [j6]Prakash Mirchandani:
A simple O(n2) algorithm for the all-pairs shortest path problem on an interval graph. Networks 27(4): 215-217 (1996) - [j5]Prakash Mirchandani, Rajeev Kohli, Arie Tamir:
Capacitated Location Problems on a Line. Transp. Sci. 30(1): 75-80 (1996) - 1995
- [j4]Thomas L. Magnanti, Prakash Mirchandani, Rita Vachani:
Modeling and Solving the Two-Facility Capacitated Network Loading Problem. Oper. Res. 43(1): 142-157 (1995) - 1994
- [j3]Rajeev Kohli, Ramesh Krishnamurti, Prakash Mirchandani:
The Minimum Satisfiability Problem. SIAM J. Discret. Math. 7(2): 275-283 (1994) - 1993
- [j2]Thomas L. Magnanti, Prakash Mirchandani, Rita Vachani:
The convex hull of two core capacitated network design problems. Math. Program. 60: 233-250 (1993) - [j1]Thomas L. Magnanti, Prakash Mirchandani:
Shortest paths, single origin-destination network design, and associated polyhedra. Networks 23(2): 103-121 (1993)
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-10-07 21:06 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:
