Deepak Rajan, Ph.D.
Affiliations: | 2004 | University of California, Berkeley, Berkeley, CA, United States |
Area:
Operations ResearchGoogle:
"Deepak Rajan"Parents
Sign in to add mentor| Alper Atamturk | grad student | 2004 | UC Berkeley | |
| (Designing capacitated survivable networks: Polyhedral analysis and algorithms.) | ||||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Ryan K, Ahmed S, Dey SS, et al. (2020) Optimization-Driven Scenario Grouping Informs Journal On Computing. 32: 805-821 |
| Patsakis G, Rajan D, Aravena I, et al. (2019) Strong Mixed-Integer Formulations for Power System Islanding and Restoration Ieee Transactions On Power Systems. 34: 4880-4888 |
| Munguia LM, Oxberry G, Rajan D, et al. (2019) Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programs Computational Optimization and Applications. 73: 575-601 |
| Patsakis G, Rajan D, Aravena I, et al. (2018) Optimal Black Start Allocation for Power System Restoration Ieee Transactions On Power Systems. 33: 6766-6776 |
| Damcı-Kurt P, Küçükyavuz S, Rajan D, et al. (2016) A polyhedral study of production ramping Mathematical Programming. 158: 175-205 |
| Wolf J, Balmin A, Rajan D, et al. (2012) CIRCUMFLEX: a scheduling optimizer for MapReduce workloads with shared scans Operating Systems Review. 46: 26-32 |
| Atamtürk A, Rajan D. (2008) Partition inequalities for capacitated survivable network design based on directed p-cycles Discrete Optimization. 5: 415-433 |
| Rajan D, Atamtürk A. (2004) A directed cycle-based column-and-cut generation method for capacitated survivable network design Networks. 43: 201-211 |
| Atamtürk A, Rajan D. (2002) On splittable and unsplittable flow capacitated network design arc-set polyhedra Mathematical Programming, Series B. 92: 315-333 |