| 2004 |
|---|
| 6 | EE | Rajeev Kohli,
Ramesh Krishnamurti,
Prakash Mirchandani:
Average performance of greedy heuristics for the integer knapsack problem.
European Journal of Operational Research 154(1): 36-45 (2004) |
| 5 | EE | Anantaram Balakrishnan,
Thomas L. Magnanti,
Prakash Mirchandani:
Connectivity-splitting models for survivable network design.
Networks 43(1): 10-27 (2004) |
| 2001 |
|---|
| 4 | EE | 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) |
| 1996 |
|---|
| 3 | EE | Prakash Mirchandani:
A simple O(n2) algorithm for the all-pairs shortest path problem on an interval graph.
Networks 27(4): 215-217 (1996) |
| 1994 |
|---|
| 2 | EE | Rajeev Kohli,
Ramesh Krishnamurti,
Prakash Mirchandani:
The Minimum Satisfiability Problem.
SIAM J. Discrete Math. 7(2): 275-283 (1994) |
| 1993 |
|---|
| 1 | | Thomas L. Magnanti,
Prakash Mirchandani,
Rita Vachani:
The convex hull of two core capacitated network design problems.
Math. Program. 60: 233-250 (1993) |
