ΟΙΚΟΝΟΜΙΚΟ ΠΑΝΕΠΙΣΤΗΜΙΟ ΑΘΗΝΩΝ ΤΜΗΜΑ ΔΙΟΙΚΗΤΙΚΗΣ ΕΠΙΣΤΗΜΗΣ & ΤΕΧΝΟΛΟΓΙΑΣ
	Πατησίων 76, 104 34 Αθήνα Τηλ.: +30 210 8203129, 8203139  Fax: +30 210 8203127 E-mail: dmst@aueb.gr

Κεντρική Σελίδα English   Μηνιαία Νέα Newsletter Επικοινωνία

e -ΔΕΤ Link   ΔΕΤ Portals   Πύλη Μαθημάτων - Eduportal   E-learning Portal του ΔΕΤ   Knowledge Portals του ΔΕΤ   Newsletters του ΔΕΤ   Σημαντικά Portals   Πληροφορίες Φοιτητών   Ωρολόγιο Πρόγραμμα   Πίνακας Ανακοινώσεων   Φοιτητές του Τμήματος   Προγρ. Παραδόσεων Εργασιών   Εξετάσεις & Αποτελέσματα   Αναλ. Παρουσίαση Μαθημάτων   Ηλεκτρονική Βιβλιοθήκη   Βοηθητικό Υλικό Εργαστηρίου   Πληροφορίες Γραμματείας   Υπηρεσίες   Ηλεκτρονική Παράδoση Εργασιών   Web Mail Φοιτητών   Web Mail Προσωπικού   Είσοδος Μελών ΔΕΠ

Πρόσφατες Δημοσιεύσεις Magos and I. Mourtos: The wheels of the OLS polytope: Facets and separation, Discrete Mathematics 308, 3634-3651 (2008). D. Magos, I. Mourtos and L. Pitsoulis: Persistency and matroid intersection, Computational Management Science, forthcoming (doi:10.1007/s10287-007-0064-x). P. Eirinakis, D. Magos, I. Mourtos, Ioannis, P. Miliotis: Hyperarc Consistency for the Stable Admissions Problem, 19th IEEE International Conference on Tools with Artificial Intelligence, 2007 (ICTAI 2007) 1, 239-242. G. Appa, D. Magos and I. Mourtos: Searching for Mutually Orthogonal Latin Squares via Integer and Constraint Programming, European Journal of Operational Research 173, 519-530 (2006). G. Appa, D. Magos and I. Mourtos: A new class of facets for the Latin square polytope, Discrete Applied Mathematics 154, 900-911 (2006). G. Appa, D. Magos and I. Mourtos: On multi-index assignment polytopes. Linear Algebra and its Applications 416, 224-241 (2006). G. Appa, D. Magos, I. Mourtos and J.C.M. Janssen: On the Orthogonal Latin Squares polytope, Discrete Mathematics 306, 171-187 (2006). G. Appa, D. Magos, I. Mourtos and L. Pitsoulis: Modelling for feasibility - the case of mutually orthogonal Latin squares problem. In G. Appa, L. Pitsoulis, H.P. Williams (eds): Modelling for feasibility - the case of mutually orthogonal Latin squares problem, International Series in Operations Research and Management Science Volume 88, 103-127, Springer-Verlag (2006). D. Magos, I. Mourtos and L. Pitsoulis: Consistency of the matching predicate. Lecture Notes in Artificial Intelligence 3955, 555-558, Springer-Verlag (2006). G. Appa, D. Magos and I. Mourtos: On the system of two all_different predicates, Information Processing Letters 94, 99-105 (2005). G. Appa, D. Magos and I. Mourtos: Wheels of the OLS polytope, Journal of Combinatorial Optimization 10, 365-389 (2005). K. Antonis, J. Garofalakis, I. Mourtos and P. Spirakis: A Hierarchical Adaptive Distributed Algorithm for Load Balancing. Journal of Parallel and Distributed Computing 64, 151-162 (2004). G. Appa, D. Magos and I. Mourtos: A Branch & Cut algorithm for the planar four-index assignment problem, Journal of the Operational Research Society 55, 298-307 (2004). 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). G. Appa, D. Magos and I. Mourtos: LP relaxations of multiple all_different predicates. In J.C. Regin, M. Rueher (eds.): Lecture Notes in Computer Science 3011, 364-369 Springer-Verlag (2004). G. Appa, I. Mourtos and D. Magos: Integrating Constraint and Integer Programming for the Orthogonal Latin Squares Problem. Lecture Notes in Computer Science 2470, 15-31 (2002).

© Copyright 2002 Τμήμα Διοικητικής Επιστήμης & Τεχνολογίας.