Emilie Danna

According to our database, Emilie Danna authored at least 9 papers between 2003 and 2017.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2017

Upward Max-Min Fairness.

Emilie Danna, Avinatan Hassidim, Haim Kaplan, Alok Kumar, Yishay Mansour, Danny Raz, Michal Segalov

J. ACM, 2017

2012

A practical algorithm for balancing the max-min fairness and throughput objectives in traffic engineering.

Emilie Danna, Subhasree Mandal, Arjun Singh

Proceedings of the IEEE INFOCOM 2012, Orlando, FL, USA, March 25-30, 2012, 2012

2011

MIPLIB 2010.

Thorsten Koch, Tobias Achterberg, Erling Andersen, Oliver Bastert, Timo Berthold, Robert E. Bixby, Emilie Danna, Gerald Gamrath, Ambros M. Gleixner, Stefan Heinz, Andrea Lodi, Hans D. Mittelmann, Ted K. Ralphs, Domenico Salvagnin, Daniel E. Steffy, Kati Wolter

Math. Program. Comput., 2011

2009

How to select a small set of diverse solutions to mixed integer programming problems.

Emilie Danna, David L. Woodruff

Oper. Res. Lett., 2009

2007

Generating Multiple Solutions for Mixed Integer Programming Problems.

Emilie Danna, Mary Fenelon, Zonghao Gu, Roland Wunderling

Proceedings of the Integer Programming and Combinatorial Optimization, 2007

2005

Exploring relaxation induced neighborhoods to improve MIP solutions.

Emilie Danna, Edward Rothberg, Claude Le Pape

Math. Program., 2005

2004

Solving a Network Design Problem.

Alain Chabrier, Emilie Danna, Claude Le Pape, Laurent Perron

Ann. Oper. Res., 2004

Integrating local search techniques into mixed integer programming.

Emilie Danna

4OR, 2004

2003

Structured vs. Unstructured Large Neighborhood Search: A Case Study on Job-Shop Scheduling Problems with Earliness and Tardiness Costs.

Emilie Danna, Laurent Perron

Proceedings of the Principles and Practice of Constraint Programming, 2003