 | 2012 |
|---|
| 8 |       | Emilie Danna,
Avinatan Hassidim,
Haim Kaplan,
Alok Kumar,
Yishay Mansour,
Danny Raz,
Michal Segalov:
Upward Max Min Fairness.
INFOCOM 2012: 837-845 |
| 7 | | Emilie Danna,
Subhasree Mandal,
Arjun Singh:
A practical algorithm for balancing the max-min fairness and throughput objectives in traffic engineering.
INFOCOM 2012: 846-854 |
| 2009 |
|---|
| 6 | | Emilie Danna,
David L. Woodruff:
How to select a small set of diverse solutions to mixed integer programming problems.
Oper. Res. Lett. 37(4): 255-260 (2009) |
| 2007 |
|---|
| 5 | | Emilie Danna,
Mary Fenelon,
Zonghao Gu,
Roland Wunderling:
Generating Multiple Solutions for Mixed Integer Programming Problems.
IPCO 2007: 280-294 |
| 2005 |
|---|
| 4 | | Emilie Danna,
Edward Rothberg,
Claude Le Pape:
Exploring relaxation induced neighborhoods to improve MIP solutions.
Math. Program. 102(1): 71-90 (2005) |
| 2004 |
|---|
| 3 | | Emilie Danna:
Integrating local search techniques into mixed integer programming.
4OR 2(4): 321-324 (2004) |
| 2 | | Alain Chabrier,
Emilie Danna,
Claude Le Pape,
Laurent Perron:
Solving a Network Design Problem.
Annals OR 130(1-4): 217-239 (2004) |
| 2003 |
|---|
| 1 | | Emilie Danna,
Laurent Perron:
Structured vs. Unstructured Large Neighborhood Search: A Case Study on Job-Shop Scheduling Problems with Earliness and Tardiness Costs.
CP 2003: 817-821 |
Data released under the ODC-BY 1.0 license — See also our legal information page