Tabu search for the planar three-index assignment problem D Magos Journal of Global Optimization 8 (1), 35-48, 1996 | 49 | 1996 |

An algorithm for the planar three-index assignment problem D Magos, P Miliotis European Journal of Operational Research 77 (1), 141-153, 1994 | 47 | 1994 |

On the system of two all_different predicates G Appa, D Magos, I Mourtos Department of Operational Research, London School of Economics and Political …, 2005 | 28 | 2005 |

Integrating constraint and integer programming for the orthogonal Latin squares problem G Appa, I Mourtos, D Magos International Conference on Principles and Practice of Constraint …, 2002 | 26 | 2002 |

Pareto optimality in many-to-many matching problems K Cechlárová, P Eirinakis, T Fleiner, D Magos, I Mourtos, E Potpinková Discrete Optimization 14, 160-169, 2014 | 25 | 2014 |

On multi-index assignment polytopes G Appa, D Magos, I Mourtos Linear Algebra and its applications 416 (2-3), 224-241, 2006 | 23 | 2006 |

LP relaxations of multiple all_different predicates G Appa, D Magos, I Mourtos International Conference on Integration of Artificial Intelligence (AI) and …, 2004 | 23 | 2004 |

A polyhedral approach to the alldifferent system D Magos, I Mourtos, G Appa Mathematical Programming 132 (1), 209-260, 2012 | 21 | 2012 |

Finding all stable pairs and solutions to the many-to-many stable matching problem P Eirinakis, D Magos, I Mourtos, P Miliotis INFORMS Journal on Computing 24 (2), 245-259, 2012 | 18 | 2012 |

On the orthogonal Latin squares polytope G Appa, D Magos, I Mourtos, JCM Janssen Discrete mathematics 306 (2), 171-187, 2006 | 16 | 2006 |

Searching for mutually orthogonal latin squares via integer and constraint programming G Appa, D Magos, I Mourtos European journal of operational research 173 (2), 519-530, 2006 | 15 | 2006 |

An LP-based proof for the non-existence of a pair of orthogonal Latin squares of order 6 G Appa, D Magos, I Mourtos Operations Research Letters 32 (4), 336-344, 2004 | 15 | 2004 |

Pareto optimal matchings in many-to-many markets with ties K Cechlárová, P Eirinakis, T Fleiner, D Magos, D Manlove, I Mourtos, ... Theory of Computing Systems 59 (4), 700-721, 2016 | 13 | 2016 |

A Branch & Cut algorithm for a four-index assignment problem G Appa, D Magos, I Mourtos Journal of the Operational Research Society 55 (3), 298-307, 2004 | 13 | 2004 |

Polyhedral results for assignment problems D Magos, I Mourtos, G Appa CDAM Research Report LSE-CDAM-2002-01 19, 1-32, 2002 | 13 | 2002 |

Clique facets of the axial and planar assignment polytopes D Magos, I Mourtos Discrete Optimization 6 (4), 394-413, 2009 | 12 | 2009 |

A new class of facets for the Latin square polytope G Appa, D Magos, I Mourtos Discrete applied mathematics 154 (6), 900-911, 2006 | 12 | 2006 |

Pareto optimal matchings in many-to-many markets with ties K Cechlárová, P Eirinakis, T Fleiner, D Magos, DF Manlove, I Mourtos, ... International Symposium on Algorithmic Game Theory, 27-39, 2015 | 11 | 2015 |

Polyhedral aspects of stable marriage P Eirinakis, D Magos, I Mourtos, P Miliotis Mathematics of Operations Research 39 (3), 656-671, 2014 | 11 | 2014 |

On the facial structure of the alldifferent system D Magos, I Mourtos SIAM Journal on Discrete Mathematics 25 (1), 130-158, 2011 | 8 | 2011 |