Structured vs. Unstructured Large Neighborhood Search: A Case Study on Job-Shop Scheduling Problems with Earliness and Tardiness Costs. - Emilie Danna; Laurent Perron (CP, 2003)

Integrating local search techniques into mixed integer programming. - Emilie Danna (4OR, 2004)

Solving a Network Design Problem. - Alain Chabrier; Emilie Danna; Claude Le Pape; Laurent Perron (Ann. Oper. Res., 2004)

Exploring relaxation induced neighborhoods to improve MIP solutions. - Emilie Danna; Edward Rothberg; Claude Le Pape (Math. Program., 2005)

Generating Multiple Solutions for Mixed Integer Programming Problems. - Emilie Danna; Mary Fenelon; Zonghao Gu; Roland Wunderling (IPCO, 2007)

How to select a small set of diverse solutions to mixed integer programming problems. - Emilie Danna; David L. Woodruff (Oper. Res. Lett., 2009)

MIPLIB 2010. - Thorsten Koch; Tobias Achterberg; Erling Andersen; Oliver Bastert; Timo Berthold; Robert E. Bixby; Emilie Danna; Gerald Gamrath; Ambros M. Gleixner; Stefan Heinz 001; Andrea Lodi 001; Hans D. Mittelmann; et al. (Math. Program. Comput., 2011)

A practical algorithm for balancing the max-min fairness and throughput objectives in traffic engineering. - Emilie Danna; Subhasree Mandal; Arjun Singh (INFOCOM, 2012)

Upward Max-Min Fairness. - Emilie Danna; Avinatan Hassidim; Haim Kaplan; Alok Kumar; Yishay Mansour; Danny Raz; Michal Segalov (J. ACM, 2017)