(Last updated August 2, 2011)
________________________________________________
[1] G. Appa, D. Magos, and I. Mourtos. A branch and cut algorithm for the planar four index assignment problem. Journal of the Operational Research Society, 55:298–307, 2004.
[2] G. Appa, D. Magos, and I. Mourtos. An lp-based proof for the non-existence of a pair of orthogonal latin squares of order 6. Operations Research Letters, 32:336–344, 2004.
[3] G. Appa, D. Magos, and I. Mourtos. On the system of two all-different predicates. Information Processing Letters, 94:99–105, 2005.
[4] G. Appa, D. Magos, and I. Mourtos. The wheels of the ols polytope: Classification and valid inequalities. Journal of Combinatorial Optimization, 10:365–389, 2005.
[5] G. Appa, D. Magos, and I. Mourtos. A new class of facets for the latin square polytope. Discrete Applied Mathematics, 104:900–911, 2006.
[6] G. Appa, D. Magos, and I. Mourtos. On multi-index assignment polytopes. Linear Algebra and its Applications, 416:224–241, 2006.
[7] G. Appa, D. Magos, I. Mourtos, and J.C.M.Janssen. On the orthogonal latin squares polytope. Discrete Mathematics, 306:171–187, 2006.
[8] P. Eirinakis, D. Magos, I. Mourtos, and P. Miliotis. Finding all stable sets and solutions to the many-to-many stable matching problem. INFORMS Journal on Computing, 2011. To appear, DOI:10.1287/ijoc.1110.0449. Online supplement.
[9] D. Magos. A binary search algorithm for the bottleneck problem of distinct representatives. CIT - Journal of Computing and Information Technology, 1:199–203, 1993.
[10] D. Magos. Tabu search for the planar three-index assignment problem. Journal of Global Optimization, 8:35–48, 1996.
[11] D. Magos. Calculating bounds for set partitioning via a new dual heuristic. WSEAS Transactions on Mathematics, 6:689–694, 2006.
[12] D. Magos and P. Miliotis. An algorithm for the planar three-index assignment problem. European Journal of Operational Research, 77:141–153, 1994.
[13] D. Magos and I. Mourtos. A characterization of odd-hole inequalities related to latin squares. Optimization. Accepted.
[14] D. Magos and I. Mourtos. The wheels of the ols polytope: Facets and separation. Discrete Mathematics, 308:3634 3651, 2008.
[15] D. Magos and I. Mourtos. Clique facets of the axial and planar assignment polytope. Discrete Optimization, 6:394–413, 2009. Test instances can be found here.
[16] D. Magos and I. Mourtos. On the facial structure of the alldifferent system. SIAM Journal on Discrete Mathematics, 25:130–158, 2011.
[17] D. Magos, I. Mourtos, and G. Appa. A polyhedral approach to the alldifferent system. Mathematical Programming. To appear, DOI:10.1007/s10107-010-0390-6.
[18] D. Magos, I. Mourtos, and L. Pitsoulis. The matching predicate and a filtering scheme based on matroids. Journal of Computers, 1:37–42, 2006.
[19] D. Magos, I. Mourtos, and L. Pitsoulis. Persistency and matroid intersection. Computational Management Science, 6:435–445, 2009.
[20] D. Magos, I. Voyiatzis, and S. Tarnick. An accumulator - based test-per-clock scheme. IEEE Transactions of Very Large Scale Integration Systems, 19:1090–1094, 2011.
________________________________________________
[1] G. Appa, D. Magos, I. Mourtos, and L. Pitsoulis. Modelling for feasibility - the case of mutually orthogonal Latin squares problem, Handbook on modelling for discrete optimization, volume 88 of International Series in Operations Research and Management Science, pages 103–127. Springer, 2006.
[2] D. Magos. The polytopes of the Orthogonal Latin Squares, Linear Algebra Research Advances, pages 169–201. Nova Publishers, Hauppauge NY, 2006.
________________________________________________
[1] G. Appa, D. Magos, and I. Mourtos. LP relaxations of multiple all_ different predicates. In Jean-Charles Régin and Michel Rueher, editors, Proceedings of the 1st International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems – CPAIOR 2004, Nice, volume 3011 of Lecture Notes in Computer Science, pages 364–369. Springer, 2004.
[2] G. Appa, I. Mourtos, and D. Magos. On integrating constraint logic programming and integer programming. In Nagib Calaos, editor, Proceedings of the 6th World Multiconference on Systemics, Cybernetics and Informatics – SCI 2002, Orlando, volume V, pages 140–145. International Institute of Informatics and Systemics, 2000.
[3] G. Appa, I. Mourtos, and D. Magos. Integrating constraint and integer programming for the orthogonal latin squares problem. In P. Van Hentenryck, editor, Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming – CP 2002, Ithaka, volume 2470 of Lecture Notes in Computer Science, pages 15–31. Springer, 2002.
[4] P. Eirinakis, D. Magos, I. Mourtos, and P. Miliotis. Hyperarc consistency for the stable admissions problem. In Proceedings of the 19th IEEE International Conference on Tools with Artificial Intelligence – ICTAI 2007, Patras, volume 1, pages 239–242. IEEE Computer Society, 2006.
[5] P. Eirinakis, D. Magos, I. Mourtos, and P. Miliotis. Finding all stable pairs for the (many-to-many) stable matching. In Proceedings of MATCH-UP: Matching Under Preferences Algorithms and Complexity, pages 239–242, Reykjavik, 2008. Satellite workshop of ICALP 2008.
[6] P. Eirinakis, D. Magos, I. Mourtos, and P. Miliotis. Stability in a specialized Supply Chain setting. In Proceedings of the 7th Student Conference, Department of Management Science and Technology, Athens University of Economics and Business, Athens, Astrolavos 13, pages 68–79. Greek Mathematical Society, May 2010.
[7] D. Magos. A binary search algorithm for the 0 1 minimax problem. In E. A. Lipitakis, editor, Proceedings of the 1st Hellenic Conference on Mathematics and informatics – Hermis 1992, Athens, pages 289–295. Greek Mathematical Society, 1992.
[8] D. Magos. A branch and bound algorithm for the planar three-index assignment problem. In Proceedings of the 2nd Balkan Conference on Operational Research, Thessaloniki, pages 415–425, October 1993.
[9] D. Magos. A tabu search algorithma for the planar three-index assignment problem. In Proceedings of the 4th Balkan Conference on Operational Research, Thessaloniki, October 1997.
[10] D. Magos. A dual heuristic for set partitioning. In Proceedings of the 9th WSEAS International Conference on Applied Mathematics, Istanbul, pages 296–300, 2006.
[11] D. Magos, I. Mourtos, and L. Pitsoulis. Consistency of the matching predicate. In G. Antoniou, G. Potamias, C. Spyropoulos, and D. Plexousakis, editors, Proceedings of the 4th Helenic Conference on AI – SETN 2006, Heraklion, volume 3955 of Lecture Notes in Computer Science, pages 555–558. Springer, 2006.
[12] D. Magos, I. Voyiatzis, and S. Tarnick. A low-cost accumulator-based test-pattern generation architecture. In D. Gizopoulos, N. Seifert, M. Nicolaidis, and A. Paschalis, editors, Proceedings of the 14th IEEE International On-Line Testing Symposium – IOLTS 2008, Rhodes, volume 1, pages 267–272. IEEE Computer Society, 2008.
[13] G. Miaoulis, D. Plemenos, D. Magos, and C. Skourlas. The multicad project: towards an intelligent multimedia system for cad. In Václav Skala, editor, Proceedings of the 8th International Conference on Computer Graphics, Visualization and Interactive Digital Media – WSCG 2000, Prague, pages 85–91. University of West Bohemia, Prague, 2000.
________________________________________________
[1] G. Appa, D. Magos, and I. Mourtos. Polyhedral results for assignment problems. Research report, Centre of Discrete Applied Mathematics - LSE, London, 2002.
[2] G. Appa, D. Magos, and I. Mourtos. Properties and classification of the wheels of the OLS polytope. Research report, Centre of Discrete Applied Mathematics - LSE, London, 2003.
[3] G. Appa, D. Magos, and I. Mourtos. Wheel facets of the OLS polytope. Research report, Centre of Discrete Applied Mathematics - LSE, London, 2003.
[4] G. Appa, D. Magos, I. Mourtos, and J.C.M. Janssen. Clique facets of the OLS polytope. Research report, Centre of Discrete Applied Mathematics - LSE, London, 2001.
________________________________________________
[1] G. Appa, A. Kouvela, D. Magos, and I. Mourtos. 11 methods for proving infeasibility of ip’s. In 24th European Conference on Operational Research - EUROXXIV, Lisbon, July 2010. Invited talk.
[2] G. Appa, D. Magos, and I. Mourtos. Hybrid algorithms integrating constraint and integer programming. In 12th International Symposium on Combinatorial Optimization - CO 2002, Paris, April 2002.
[3] G. Appa, D. Magos, and I. Mourtos. On the integration of integer and constraint programming. In 18th International Symposium on Mathematical Programming - ISMP 2003, Copenhagen, August 2003.
[4] G. Appa, D. Magos, and I. Mourtos. Multidimensional assignment problems. In 13th International Symposium on Combinatorial Optimization - CO 2004, Lancaster, March 2004.
[5] G. Appa, D. Magos, and I. Mourtos. Multidimensional assignment problems. In 20th European Conference on Operational Research - EURO XX, Rhodes, July 2004.
[6] G. Appa, D. Magos, I. Mourtos, and J.C.M. Janssen. The orthogonal latin squares polytope. In 12th International Symposium on Combinatorial Optimization - CO 2002, Paris, April 2002.
[7] P. Eirinakis, D. Magos, I. Mourtos, and P. Miliotis. On weighted stable b-matchings and their implications on supply chain networks. In 20th International Symposium on Mathematical Programming - ISMP2009, Chicago, August 2009.
[8] P. Eirinakis, D. Magos, I. Mourtos, and P. Miliotis. Non-stable pairs in the stable marriage problem and multi-index configurations. In 24th European Conference on Operational Research - EUROXXIV, Lisbon, July 2010. Invited talk.
[9] D. Magos and I. Mourtos. Further valid inequalities and facets of the ols polytope. In 3rd International Conference on Computational Management Science, CWI-Amsterdam, June 2006. Invited talk.
[10] D. Magos and I. Mourtos. Persistency of logic predicates and matroid intersection. In 3rd International Conference on Computational Management Science, CWI-Amsterdam, June 2006. Invited talk.
[11] D. Magos and I. Mourtos. Valid inequalities and facets of the ols polytope. In 19th International Symposium on Mathematical Programming - ISMP 2006, Rio de Janeiro, August 2006.
[12] D. Magos and I. Mourtos. Branch and cut for multi-index assignment problems. In 22th European Conference on Operational Research - EURO XXII, Prague, July 2007.
[13] D. Magos and I. Mourtos. Polyhedral analysis of an alldifferent system. In INFORMS Annual Meeting, Washington DC, October 2008. Invited talk.
[14] D. Magos and I. Mourtos. Characterising odd-hole inequalities related to latin squares. In 24th European Conference on Operational Research - EUROXXIV, Lisbon, July 2010. Invited talk.
[15] D. Magos and I. Mourtos. A polyhedral study of the alldifferent system. In 11th International Symposium on Artificial Intelligence and Mathematics, Fort Lauderdale, January 2010. Invited talk.
[16] D. Magos, I. Mourtos, and T. Yunes. A polyhedral study of the cumulative constraint. In 11th International Symposium on Artificial Intelligence and Mathematics, Fort Lauderdale, January 2010. Invited talk.
[17] D. Magos, I. Mourtos, and T. Yunes. Valid inequalities for the cumulative constraint and the cumulative job shop scheduling prob- lem. In 19th Conference of the International Federation of Operational Research Societies - IFORS, Melbourne, July 2011.