Prakash Mirchandani - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 29 from 29

2023

Effect of seasonality, sales growth rate, and fiscal year end on cash conversion cycleJoyaditya Laik, Prakash Mirchandani. dsj, 54(1):43-63, February 2023. [doi]

2022

Crew Assignment with Duty Time Limits for Transport Services: Tight Multicommodity ModelsAnantaram Balakrishnan, Prakash Mirchandani, Sifeng Lin. ior, 70(2):690-714, 2022. [doi]

2017

Optimal Network Design with End-to-End Service RequirementsAnantaram Balakrishnan, Gang Li, Prakash Mirchandani. ior, 65(3):729-750, 2017. [doi]

2013

2010

2009

Connectivity Upgrade Models for Survivable Network DesignAnantaram Balakrishnan, Prakash Mirchandani, Harihara Prasad Natarajan. ior, 57(1):170-186, 2009. [doi]

2004

Connectivity-splitting models for survivable network designAnantaram Balakrishnan, Thomas L. Magnanti, Prakash Mirchandani. networks, 43(1):10-27, 2004. [doi]

Average performance of greedy heuristics for the integer knapsack problemRajeev Kohli, Ramesh Krishnamurti, Prakash Mirchandani. eor, 154(1):36-45, 2004. [doi]

2003

Networks and FlowsClifford Stein, Lisa Fleischer, Douglas R. Shier, Prakash Mirchandani, David Simchi-Levi. In Jonathan L. Gross, Jay Yellen, editors, Handbook of Graph Theory. Discrete Mathematics and Its Applications, pages 1074-1142, Chapman & Hall / Taylor & Francis, 2003. [doi]

2001

Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problemsAnantaram Balakrishnan, Thomas L. Magnanti, Prakash Mirchandani. orl, 29(3):99-106, 2001. [doi]

Enhancing Competitiveness of the Customer Loan Center at Promistar Financial CorporationPrakash Mirchandani, G. G. Hegde, Richard E. Wendell. interfaces, 31(3):28-43, 2001. [doi]

2000

Projections of the capacitated network loading problemPrakash Mirchandani. eor, 122(3):534-560, 2000. [doi]

1998

Designing Hierarchical Survivable NetworksAnantaram Balakrishnan, Thomas L. Magnanti, Prakash Mirchandani. ior, 46(1):116-136, 1998. [doi]

1996

Heuristics, LPs, and Trees on Trees: Network Design AnalysesAnantaram Balakrishnan, Thomas L. Magnanti, Prakash Mirchandani. ior, 44(3):478-496, 1996. [doi]

A simple O(n:::2:::) algorithm for the all-pairs shortest path problem on an interval graphPrakash Mirchandani. networks, 27(4):215-217, 1996. [doi]

The Multi-Tier Tree ProblemPrakash Mirchandani. informs, 8(3):202-218, 1996. [doi]

Capacitated Location Problems on a LinePrakash Mirchandani, Rajeev Kohli, Arie Tamir. transci, 30(1):75-80, 1996. [doi]

1995

Modeling and Solving the Two-Facility Capacitated Network Loading ProblemThomas L. Magnanti, Prakash Mirchandani, Rita Vachani. ior, 43(1):142-157, 1995. [doi]

1994

The Minimum Satisfiability ProblemRajeev Kohli, Ramesh Krishnamurti, Prakash Mirchandani. siamdm, 7(2):275-283, 1994. [doi]

1993

The convex hull of two core capacitated network design problemsThomas L. Magnanti, Prakash Mirchandani, Rita Vachani. mp, 60:233-250, 1993.

Shortest paths, single origin-destination network design, and associated polyhedraThomas L. Magnanti, Prakash Mirchandani. networks, 23(2):103-121, 1993. [doi]

Sign in or sign up to see more results.

runs on WebDSL