 | 2008 |
|---|
| 8 |       | Luis Gouveia,
Ana Paias,
Dushyant Sharma:
Modeling and solving the rooted distance-constrained minimum spanning tree problem.
Computers & OR 35(2): 600-613 (2008) |
| 2007 |
|---|
| 7 | | Ravindra K. Ahuja,
Jon Goodstein,
Amit Mukherjee,
James B. Orlin,
Dushyant Sharma:
A Very Large-Scale Neighborhood Search Algorithm for the Combined Through-Fleet-Assignment Model.
INFORMS Journal on Computing 19(3): 416-428 (2007) |
| 6 | | Ravindra K. Ahuja,
Krishna C. Jha,
James B. Orlin,
Dushyant Sharma:
Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem.
INFORMS Journal on Computing 19(4): 646-657 (2007) |
| 2006 |
|---|
| 5 | | H. Edwin Romeijn,
Dushyant Sharma,
Robert L. Smith:
Extreme point characterizations for infinite network flow problems.
Networks 48(4): 209-222 (2006) |
| 2005 |
|---|
| 4 |  | Saumil Shah,
Ashish Srivastava,
Dushyant Sharma,
Dennis Sylvester,
David Blaauw,
Vladimir Zolotov:
Discrete Vt assignment and gate sizing using a self-snapping continuous formulation.
ICCAD 2005: 705-712 |
| 3 | | Ravindra K. Ahuja,
Jian Liu,
James B. Orlin,
Dushyant Sharma,
Larry A. Shughart:
Solving Real-Life Locomotive-Scheduling Problems.
Transportation Science 39(4): 503-517 (2005) |
| 2004 |
|---|
| 2 | | James B. Orlin,
Dushyant Sharma:
Extended neighborhood: Definition and characterization.
Math. Program. 101(3): 537-559 (2004) |
| 2003 |
|---|
| 1 | | Ravindra K. Ahuja,
James B. Orlin,
Dushyant Sharma:
A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.
Oper. Res. Lett. 31(3): 185-194 (2003) |
