![]() | Up a level |
Dash, S., Gunluk, O., Lodi, A., & Tramontani, A. (2012). A time bucket formulation for the traveling salesman problem with time windows. INFORMS Journal on Computing, 24(1), 132-147. External link
Dash, S., Gunluk, O., & Lodi, A. (2010). Erratum: MIR closures of polyhedral sets. Mathematical Programming, 123(2), 485-486. External link
Dash, S., Gunluk, O., & Lodi, A. (2010). MIR closures of polyhedral sets. Mathematical Programming, 121(1), 33-60. External link
Dash, S., Gunluk, O., & Lodi, A. (2007, June). On the MIR closure of polyhedra [Paper]. 12th International Conference on Integer Programming and Combinatorial Optimization (IPCO 2007), Ithaca, NY, United states. External link