Search the dblp DataBase
Prakash Mirchandani :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Thomas L. Magnanti , Prakash Mirchandani , Rita Vachani The convex hull of two core capacitated network design problems. [Citation Graph (0, 0)][DBLP ] Math. Program., 1993, v:60, n:, pp:233-250 [Journal ] Anantaram Balakrishnan , Thomas L. Magnanti , Prakash Mirchandani Connectivity-splitting models for survivable network design. [Citation Graph (0, 0)][DBLP ] Networks, 2004, v:43, n:1, pp:10-27 [Journal ] Prakash Mirchandani A simple O(n^{2} ) algorithm for the all-pairs shortest path problem on an interval graph. [Citation Graph (0, 0)][DBLP ] Networks, 1996, v:27, n:4, pp:215-217 [Journal ] Anantaram Balakrishnan , Thomas L. Magnanti , Prakash Mirchandani Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems. [Citation Graph (0, 0)][DBLP ] Oper. Res. Lett., 2001, v:29, n:3, pp:99-106 [Journal ] Rajeev Kohli , Ramesh Krishnamurti , Prakash Mirchandani The Minimum Satisfiability Problem. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1994, v:7, n:2, pp:275-283 [Journal ] Rajeev Kohli , Ramesh Krishnamurti , Prakash Mirchandani Average performance of greedy heuristics for the integer knapsack problem. [Citation Graph (0, 0)][DBLP ] European Journal of Operational Research, 2004, v:154, n:1, pp:36-45 [Journal ] Search in 0.002secs, Finished in 0.002secs