Publications

Principal
Curriculum
Publications
Photo Gallery

 

Journals

bullet

New Trends on Constraint Satisfaction, Planning, and Scheduling: A Survey. Roman Barták, Miguel A. Salido, Francesca Rossi. The Knowledge Engineering Review, to appear, 2010.

bullet

Introduction to Planning, Scheduling and Constraint Satisfaction. Miguel A. Salido. Journal of Intelligent Manufacturing (Springer), ISSN: 0956-5515, vol 21(1), pp:1-4, 2010

bullet

Experimental analysis of optimization techniques on the road passenger transportation problem. B. Lopez, V. Muñoz, J. Murillo, F. Barber, M.A. Salido, M. Abril, M. Cervantes, L.F. Caro, M. Villaret. Engineering Application of Artificial Intelligence 22, pp:374-388, (Ed. Elsevier Science), ISSN: 0952-1976,  2009.

bullet

Mathematical Solutions for Solving Periodic Railway Transportation. Miguel A. Salido,  Federico Barber. Mathematical Problems in Engineering, Volume 2009, Article ID 728916, doi:10.1155/2009/728916, 19 pages, 2009.

bullet

Constraint satisfaction techniques in planning and scheduling. Roman Barták, Miguel A. Salido, Francesca Rossi. Journal of Intelligent Manufacturing (Springer), ISSN: 0956-5515, vol 21(1), pp:5-15, 2010.

bullet

Feasible Distributed CSP Models for Scheduling Problems. Miguel A. Salido, Adriana Giret. Engineering Application of Artificial Intelligence. (Ed. Elsevier Science), ISSN: 0952-1976, vol 21(5), pp:723-732, 2008.

bullet

Distributed Search in Railway Scheduling Problems. M. Abril, M. A. Salido,  F. Barber. Engineering Application of Artificial Intelligence. (Ed. Elsevier Science), ISSN: 0952-1976, vol 21(5), pp:744-755,  2008.

bullet

A Holonic Architecture for the Global Road Transportation System. Frédérique Versteegh, Miguel A. Salido, Adriana Giret. Journal of Intelligent Manufacturing (Springer), ISSN: 0956-5515, vol 21(1), pp:133-144, 2010.

bullet

Introduction: Special Issue on Constraint Satisfaction Techniques for Planning and Scheduling Problems, Miguel A. Salido, Antonio Garrido; Roman Bartak. Engineering Application of Artificial Intelligence. (Ed. Elsevier Science), ISSN: 0952-1976, vol 21(5), pp:679-682, 2008.

bullet

Nogood-FC for Solving Partitionable Constraint Satisfaction Problems. Montserrat Abril, Miguel A. Salido, Federico Barber. Journal of Intelligent Manufacturing (Elsevier), ISSN: 0956-5515, vol 21(1), pp:101-110, 2010.

bullet

An Assessment of Railway Capacity. M. Abril,  F. Barber, L. Ingolotti, M. A. Salido, P. Tormos, A. Lova. Transportation Research Part E-Logistics and Transportation Review, Vol 44(5), pp:774-806, 2008.  (Ed. Elsevier Science)(JCR: 1.000)

bullet

A Non-binary Constraint Ordering Heuristic For Constraint Satisfaction Problems. M. A. Salido. Applied Mathematics and Computation, (Ed. Elsevier Science), Vol 198/1, pp 280-295, 2008. (JCR: 0.816)

bullet

Analytical Robustness in Single-Line Railway Scheduling. Miguel A. Salido, Federico Barber, Laura Ingolotti. International Transaction of Systems Science and Applications, Vol. 4, No. 3, pp: 243-251, 2008.

bullet

Domain Dependent Distributed Models for Railway Scheduling. M. A. Salido, M. Abril,  F. Barber, L. Ingolotti, P. Tormos, A. Lova. Knowledge-Based Systems, 20, 186-194, (Ed. Elsevier Science), 2007. (JCR: 0.696)

bullet

Metodologías Activas en la Enseñanza de Informática en la Licenciatura en Matemáticas. Miguel A. Salido, Adriana Giret, Montserrat Abril. IEEE-RITA (Latin-American Learning Technologies Journal), ISSN: 1932-8540, vol 2, nº 2, pp 73-78, 2007.

bullet

Distributed Models for solving CSPs.  M. Abril,  M. A. Salido, F. Barber,  INFOCOMP Journal of computer science,  ISSN: 1807-4545, pp: 43-50, 2007.

bullet

Distributed CSPs by Graph Partitioning. M. A. Salido, F. Barber. Applied Mathematics and Computation, 183 (2006) 491-498, Elsevier, 2006 (JCR: 0.816)

bullet

Técnicas para el Manejo de CSPs no Binarios. Miguel Angel Salido; Inteligencia Artificial: Revista Iberoamericana de Inteligencia Artificial. Nº 20, pp:95-109, ISSN:1137-3601, 2003.

bullet

Introducción a la Programación de Restricciones. Federico Barber, Miguel Angel Salido; Inteligencia Artificial: Revista Iberoamericana de Inteligencia Artificial. Nº 20, pp:13-29, ISSN:1137-3601, 2003.

bullet

A Polynomial Algorithm for Continuous Non-binary Disjunctive CSPs: Extended DLRs. Miguel. A. Salido, Federico Barber. International Journal Knowledge Based Systems 16, 277-285,  ISSN: 0950-7051 (Ed. Elsevier Science), 2003. (JCR: 0.842)

bullet

Problems de Satisfacción de Restricciones no Binarias con Dominios Continuos. Miguel. A. Salido, Adriana Giret, Federico Barber. Inteligencia Artificial: Revista Iberoamericana de Inteligencia Artificial. ISSN:1137-3601, 60-70, 2002.

 

 

Conferences listed in CORE, CiteseerX and CSC

 

bullet

2-C3: From Arc-Consistency to 2-Consistency, Marlene Arangú, Miguel A. Salido and Federico Barber. The Ninth Symposium on Abstraction, Reformulation and Abstraction (SARA2009), 2009 (CORE: A).

bullet

A Planning Tool for Minimizing Reshuffles in Containers Terminals. Miguel A. Salido, Oscar Sapena, Mario Rodriguez and Federico Barber. ICTAI 2009: 21st International Conference on Tools with Artificial Intelligence, 567-571, 2009 (CSC Ranking: 0.74).

bullet

2-C3OP: An Improved version of 2-Consistency. Marlene Arangú, Miguel A. Salido and Federico Barber. ICTAI 2009: 21st International Conference on Tools with Artificial Intelligence, pp:344-348, 2009 (CSC Ranking: 0.74).

bullet

A Planning-Based Approach for Allocating Containers in Maritime Terminals. Miguel A. Salido, Oscar Sapena, Mario Rodriguez and Federico Barber. CAEPIA'09: Thirteenth Spanish Conference for Artificial Intelligence, to appear, 2009 (CSC Ranking: 0.55).

bullet

Optimizing a Fine-grained Arc-consistency Algorithm. Marlene Arangú, Miguel A. Salido and Federico Barber. CAEPIA'09: Thirteenth Spanish Conference for Artificial Intelligence, to appear, 2009 (CSC Ranking: 0.55).

bullet

Distributed CSPs: Why it is assumed a Variable per Agent?. M. A. Salido. The Seventh Symposium on Abstraction, Reformulation and Abstraction (SARA2007), LNAI 4612, pp: 407-408, 2007 (CORE: A).

bullet

DFS-Tree Based Heuristic Search. Monserrat Abril, Miguel A. Salido, Federico Barber. The Seventh Symposium on Abstraction, Reformulation and Abstraction (SARA2007), LNAI 4612, pp: 5-19, 2007 (CORE: A).

bullet

Feasible Distributed CSP Models for Scheduling Problems. Miguel A. Salido. COPLAS'07: CP/ICAPS 2007 Joint Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems, pp:60-67, 2007.(CORE B)

bullet

Application of Meta-Tree-Based Distributed Search to the Railway Scheduling Problem. Montserrat Abril, Miguel A. Salido, Federico Barber. COPLAS'07: CP/ICAPS 2007 Joint Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems, pp:6-13, 2007. (CORE B)

bullet

New Heuristics to Solve the "CSOP" Railway Timetabling Problem, L. Ingolotti, A. Lova, , F. Barber, P. Tormos, M.A. Salido, M. Abril he 19th International Conference on Industrial, Engineering & Other Applications of Applied Intelligent Systems (IEA/AIE'06), LNAI 4031, pp: 400-409, 2006 ( CSC Ranking: 0.57, 46/701).

bullet

A Scheduling Order-Based Method to Solve Timetabling Problem. P. Tormos, A. Lova, L. Ingolotti, F. Barber, M.A. Salido, M. Abril. LNCS 4177, pp:52-61, 2006 (CSC: 0.55,  52/620)

bullet

Distributed Constraints for Large-Scale Scheduling Problems. M. Abril, M. A. Salido, F. Barber. Eleventh International Conference on Principles and Practice of Constraint Programming (Doctoral Program). CP 2005. LNCS 3709. Springer-Verlag. 2005 (CORE: A, CSC Ranking: 0.96).

bullet

Constrainedness and Redundancy by Constraint Ordering. Miguel A. Salido, Federico Barber. Advances in Artificial Intelligence, LNAI 3315, pp: 124-133, 2004. (CiteseerX  501/914)

bullet

An Efficient Method to Schedule New Trains on a High-Loaded Railway Network. L. Ingolotti, F. Barber, P. Tormos, A. Lova, Miguel A. Salido, M. Abril. Advances in Artificial Intelligence, LNAI 3315, pp:164-173, 2004. (CiteseerX  501/914)

bullet

Exploiting the Constrainedness in Constraint Satisfaction Problems. Miguel A. Salido, Federico Barber. Artificial Intelligence: Methodology, Systems, and Applications. LNAI 3192, pp:126-136. 2004. (CiteseerX  471/914)

bullet

Distributed Non-binary Constraints. Miguel A. Salido; Federico Barber;  Current Topic in Artificial Intelligence, LNAI 3040, pp:271-280, 2004. (CSC: 0.55,  52/620)

bullet

An Interactive Train Scheduling Tool for Solving and Plotting Running Maps. F. Barber, Miguel A. Salido, M. Abril, L. Ingolotti, A. Lova, P. Tormos. Current Topic in Artificial Intelligence, LNAI 3040, pp:646-655, 2004. (CSC: 0.55,  52/620)

bullet

Volume Under the ROC Surface for Multi-class Problems. Cèsar Ferri, J-Hernandez Orallo,  Miguel. A. Salido. Machine Learning, ECML 2003. Proceeding of 14th European Conference on Machine Learning, pp: 108-120, LNAI 2837,  2003 (CORE: A, CSC Ranking: 0.80).

bullet

Disjunction of Non-Binary and Numeric Constraints Satisfaction Problems. Miguel. A. Salido, Federico Barber. In Topics in Artificial Intelligence. LNAI 2504, pp: 159-172, 2002.

bullet

Disjunctive and Continuous Constraint Satisfaction Problems. Miguel. A. Salido, Federico Barber. In Proceedings of Eighth International Conference on Principles and Practice of Constraint Programming (CP2002). Springer Verlag, LNCS 2470, 2002 (CORE: A, CSC Ranking: 0.96).

bullet

Realizing a Global Hyperpolyhedron Constraint via LP Techniques. Miguel. A. Salido, Adriana Giret, Federico Barber. In Proceedings of the KI-2001 Workshop AI in Planning, Scheduling, Configuration and Design (PUK 2001),  78-88, (Wien), 2001.  (CiteseerX 227/752).

bullet

An Incremental and Non-binary CSP Solver: The Hyperpolyhedron Search Algorithm. Miguel. A. Salido, Federico Barber. In Proceedings of Seventh International Conference on Principles and Practice of Constraint Programming CP 2001. LNCS 2239, pp 779-780, 2001 (CORE: A, CSC Ranking: 0.96).

 

 

Books

 

bullet Planning, Scheduling and Constraint Satisfaction: From Theory to Practice. Luis Castillo, Daniel Borrajo, Miguel A. Salido, Angelo Oddi. Frontiers in Artificial Intelligence and Applications (IOS Press), Vol 117, ISBN: 1-58603-484-7, ISSN: 0922-6389, 208 pp, 2005

bulletPolyhedra: A model for solving N-ary constraint satisfaction problems by means of Hyperpolyhedra. ProQuest Information and Learning, UMI. ISBN: 0-493-24254-6. 365 pp, 2002

 

 Book Chapters

bullet

Meta-Heuristic and Constraint-based Approaches for Railway Timetabling. Federico Barber, Laura Ingolotti, Antonio Lova, Pilar Tormos, Miguel A. Salido. Special Volume on ROBUST AND ONLINE LARGE-SCALE OPTIMIZATION, (ed. Springer), pp:145-181, 2009

bullet

Problemas de Satisfacción de Restricciones (CSP). F. Barber, M. A. Salido,  Inteligencia Artificial: Técnicas, métodos y aplicaciones,   (Ed. McGraw-Hill), pp:385-432, 2008.

bullet

A Genetic Algorithm for Railway Scheduling Problems. P. Tormos, A. Lova, F. Barber, L. Ingolotti, M. Abril, and M.A. Salido. In: Metaheuristics for Scheduling In Industrial and Manufacturing Applications. Springer, 2008.

bulletA Technique for the Capacity Assessment of Periodic Trains; M. Abril, M. A. Salido, F. Barber, L. Ingolotti, A. Lova, P. Tormos. Frontiers in Artificial Intelligence and Applications, IOS Press, 2005
bullet

Topological Constraints in Periodic Train Scheduling.  Miguel A. Salido, M. Abril, F. Barber, L. Ingolotti, P. Tormos, A. Lova. Planning, Scheduling and Constraint Satisfaction: From Theory to Practice. Frontiers in Artificial Intelligence and Applications (IOS Press), Vol 117, pp:11-20, ISBN: 1-58603-484-7, ISSN: 0922-6389, 2005.

bullet

A Genetic Algorithm for Railway Scheduling Problems. P. Tormos, A. Lova, F. Barber, L. Ingolotti, M. Abril, and M. A. Salido. Metaheuristics for Scheduling in Industrial and Manufacturing Applications. Springer-Verlag, 2007.

bullet

Domain Dependent Distributed Models for Railway Scheduling. M. A. Salido, M. Abril,  F. Barber, L. Ingolotti, P. Tormos, A. Lova,  Applications and Innovations in Intelligent Systems XIV, Best Refereed Application paper, To appear, 2006

bullet

A Decision Support Sytem for Railway Timetabling (MOM): the Spanish Case. F. Barber, P. Tormos, A. Lova, L. Ingolotti, M. A. Salido, M. Abril. Computers in Railways X: Computer System Design and Operation in the Railway and Other Transit Systems, WIT Press, 2006

bullet

A Topological Model Based on Railway Capacity to Manage Periodic Train Scheduling.  Miguel A. Salido, M. Abril, F. Barber, P. Tormos, A. Lova, L. Ingolotti. Applications and Innovations in Intelligent Systems XII. (Springer Verlag), ISBN: 1-85233-908-X. pp: 107-120. 2004.

bullet

A Non-Binary Constraint Ordering Approach to Scheduling Problems.  Miguel A. Salido, Federico Barber. Applications and Innovations in Intelligent Systems XII. (Springer Verlag), ISBN: 1-85233-908-X. pp:81-94  2004.

bullet

How to Classify Hard and Soft Constraints in Non-binary Constraint Satisfaction Problems. Miguel. A. Salido, Federico Barber. In Research and Development in Intelligent Systems XX, 213-226, ISBN: 1-85233-780-X  (Springer Verlag). Cambridge 2003.

bullet

Constrainedness in Constraint Satisfaction.  Miguel A. Salido, Federico Barber. Recent Advances in Artificial Intelligence Research and Development. Frontiers in Artificial Intelligence and Applications (IOS Press), Vol 113, ISBN: 1-58603-466-9, ISSN: 0922-6389, pp:425-432. 2004.

bullet

Distributing constraints by sampling in non-binary CSPs.  Miguel A. Salido, Adriana Giret, Federico Barber. Distributed Constraint Problem Solving and Reasoning in Multi-Agent Systems. Frontiers in Artificial Intelligence and Applications (IOS Press). Vol 112, pp: 77-91, ISBN: 1-58603-456-1, 2004.

bullet

A Polynomial Algorithm for Continuous Non-binary Disjunctive CSPs. Miguel. A. Salido, Federico Barber. In Research and Development in Intelligent Systems XIX. Best Refereed Technical Paper. (Springer Verlag). (Cambridge) 2002.

bullet

Constraint Satisfaction by means of Dynamic Polyhedra. Miguel. A. Salido, Adriana Giret, Federico Barber. In Operations Research Proceedings 2001.(Springer Verlag), ISBN: 3-540-43344-9, 405-412, 2002.

bullet

Preprocessing Algorithms for non-binary Disjunctive Constraints Satisfaction. Miguel. A. Salido, Adriana. Giret, Federico Barber. Research and Development in Intelligent Systems XVIII. (Ed. Springer Verlag).  2001.

bullet

A Non-binary Constraint Satisfaction Solver: The One-face Hyperpolyhedron Heuristic. Miguel. A. Salido, Adriana Giret, Federico Barber. Research and Development in Intelligent Systems XVIII. (Ed. Springer Verlag). (Cambridge) 2001.

 

 International Conferences

2009

bullet

A Filtering Technique for Non-normalized CSPs. Marlene Arangu, Miguel A. Salido and Federico Barber. CP2009 Doctoral Program. The 15th International Conference on Principles and Practice of Constraint Programming, pp:1-6, 2009

bullet

Finding Robust Solutions in Constraint Satisfaction Problems. Laura Climent, Miguel A. Salido and Federico Barber. CP2009 Doctoral Program. The 15th International Conference on Principles and Practice of Constraint Programming, pp:25-30, 2009

bullet

Extending arc-consistency algorithms for Non-Normalized CSPs. Marlene Arangu, Miguel A. Salido and Federico Barber. AI-2009 Twenty-ninth SGAI International Conference on Artificial Intelligence, 2009.

bullet

What is Better: 4 Tiers or 5 Tiers in the Container Stacking Problem? Miguel A. Salido, Oscar Sapena, Federico Barber. The International Workshop on Harbour, Maritime & Multimodal Logistics Modelling and Simulation, 2009

bullet

The Container Stacking Problem: an Artificial Intelligence Planning-Based Approach. Miguel A. Salido, Oscar Sapena, Federico Barber. The International Workshop on Harbour, Maritime & Multimodal Logistics Modelling and Simulation, 2009

bullet

An Artificial Intelligence Planning tool for The Container Stacking Problem. Miguel A. Salido, Oscar Sapena, Federico Barber. ETFA 2009: 14th IEEE International Conference on Emerging Technologies and Factory Automation, 2009.

bulletAC3-OP: An Arc-Consistency Algorithm for Arithmetic Constraints. Marlene Arangu, Miguel A. Salido and Federico Barber. CCIA 2009: Twelfth International Congress of the Catalan Association of Artificial Intelligence, 2009
bullet

Stability of Solutions in Constraint Satisfaction Problems. Miguel A. Salido, Laura Climent and Federico Barber. CCIA 2009: Twelfth International Congress of the Catalan Association of Artificial Intelligence, 2009

2008

bullet

Robustness and capacity in scheduling: Application to railway timetabling.  Laura Climent, Federico Barber, Miguel A. Salido, Laura Ingolotti.  IBERAMIA 2008 Workshop on Planning, Scheduling and Constraint Satisfaction.  (2008)

bullet

 A distributed algorithm for the Holonic Global Road Transportation System. C. Beckers, A. Giret and M.A. Salido. IBERAMIA 2008 Workshop on Agreement Technologies 2008.  (2008)

bullet

Robustness in Railway Transportation Scheduling. Miguel A. Salido, Federico Barber, Luara Ingolotti. 7th Congress on Intelligent Control and Automation. IEEE Press, to appear, 2008.

bullet

Analytical Assessment of Timetable Robustness.  M. A. Salido, F. Barber, L. Ingolotti,  P. Tormos, A. Lova. Int. Trienal Conf. In OR/MS (IFORS’08), 2008.

bullet

Disruption Simulator in Railway timetabling for Empirical Robustness Assessment.  F. Barber, M. A. Salido, L. Ingolotti,  P. Tormos, A. Lova. Int. Trienal Conf. In OR/MS (IFORS’08), 2008.

2007

bullet

Intelligent Train Scheduling on a High-Loaded Railway Network.  A. Lova, P. Tormos, F. Barber, L. Ingolotti, Miguel A. Salido, M. Abril. Algorithmic Methods for Railways Optimization. Lecture Notes in Computer Science, LNCS 4359, pp: 219-232, (Springer Verlag). 2007.

bullet

The Motivation of Working and Studing. Adriana Giret, Miguel A. Salido. INTED2007. International Technology, Education and Development Conference. ISBN: 84-611-4517-8, pp1-9,  2007

bullet

Nogood-FC for Solving Partitionable Constraint Satisfaction Problems. Montserrat Abril, Miguel A. Salido, Federico Barber: CAEPIA 2007 Workshop on Planning, Scheduling and Constraint Satisfaction, ISBN-13: 978-84-611-8860-4, pp 115-128, 2007.

bullet

A Distributed Architecture for Solving the Global Road Transportation System. Frédérique Versteegh, Miguel A. Salido, Adriana Giret: CAEPIA 2007 Workshop on Planning, Scheduling and Constraint Satisfaction, ISBN-13: 978-84-611-8860-4, 162-174, 2007.

2006

bullet

Distributed Models in Railway Industry,  M. Abril, M. A. Salido, F. Barber, L. Ingolotti, A. Lova, P. Tormos, Workshop on Industrial Applications of Distributed Intelligent Systems (INADIS 2006), 2006.

bullet

Train Scheduling: A Real Case. L. Ingolotti, F. Barber, P.Tormos, A. Lova, M.Salido, M. Abril. Algorithmic Methods for Railway Optimization (L. Kroon, F. Geraets, D. Wagner and C. Zaroliagis Ed.) ISSN: 1862-4405, vol 04261, 2006

bullet

Distributed Constraint Satisfaction Problems to Model Railway Scheduling Problems, M. Abril, M. A. Salido, F. Barber, L. Ingolotti, A. ICAPS 2006 Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems, Cumbria (England), 2006

2005

bullet

A Scheduling Order-Based Method to Solve the Train Timetabling Problem. L. Ingolotti, F. Barber, P. Tormos, A. Lova, M. A. Salido, and M. Abril. XI Conference of the Spanish Association for Artificial Intelligence (CAEPIA), ISBN:84-96474-13-5, Vol I 343-352, 2005

bullet

Optimization in Railway Scheduling.  M.A. Salido, M. Abril, F. Barber, P. Tormos, A. Lova, L. Ingolotti. 2nd International Conference on Informatics in Control, Automation and Robotics (ICINCO´05), ISBN: 972-8865-29-5 , 188-195. 2005.

bullet

Applying Analytical and Empirical Methods to the Assessment of Railway Capacity. M. Abril; F.Barber; L. Ingolotti; M. A. Salido; A. Lova; P. Tormos, J. Estrada. 5th Workshop on Algorithmic Methods and Models for Optimization of Railways, in ALGO’05. In Proceeding of ATMOS’05.

bullet

The Power of Constrainedness in Constraint Satisfaction Problems; Miguel A. Salido, Federico Barber. International Transaction on Computer Science and Engineering, Vol 4, Nº 1, pp: 33-44, 2005

bullet

MOM, A Decision Support System for Railway Scheduling.  F. Barber, M. Abril, L. Ingolotti, A. Lova, M. A. Salido, P. Tormos. Int. Trienal Conf. In OR/MS (IFORS’05), 2005.

bullet

An Efficient Heuristic Technique To Schedule New Trains On A High Loaded Network.  A. Lova, P. Tormos, F. Barber, L. Ingolotti, M. Abril, M. A. Salido. In Proceeding of IFOR´05. Int. Trienal Conf. In OR/MS (IFORS’05), 2005.

bullet

Periodic Single Track Railway Scheduling: A Sequential Approach.  P. Tormos, A. Lova, F. Barber, L. Ingolotti, M. Abril, M.A. Salido. Int. Trienal Conf. In OR/MS (IFORS’05), 2005.

2004

bullet

A Decision Support System (DSS) for the Railway Scheduling Problem.  Laura Ingolotti, Pilar Tormos, Antonio Lova, Federico Barber, Miguel A. Salido, Montse Abril. First IFIP Conference on Artificial Intelligence Applications and Innovations (Kluwer Academic Publishers), ISBN: 1-4020-8150-2, pp 465-674 . 2004.

bullet

Applying Topological Constraint Optimization Techniques to Periodic Train Scheduling.  Miguel A. Salido, M. Abril, F. Barber, L. Ingolotti, P. Tormos, A. Lova. In Proceeding of ECAI 2004 Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems, pp:17-26. 2004.

2003

bullet

An Interactive Train Scheduling Tool for Solving and Plotting Running Maps. Federico Barber; Miguel A. Salido; L. Ingolotti; M. Abril; A. Lova; P. Tormos. V Session of Technology Transfer on Artificial Intelligence (TTIA), (Jose Cuena Award, Best paper of TTIA), ISBN: 84-8373-564-4, Vol(2), pp:379-4388, San Sebastian, 2003

bullet

Stochastic Local Search for Distributed Constraint Satisfaction Problems. Miguel. A. Salido, Federico Barber. In Proceeding of IJCAI Workshop  on Stochastic Search Algorithms, Acapulco, México, 2003

bullet

Distributed Constraint Satisfaction Problems for Resource Allocation. Miguel. A. Salido, Federico Barber. In Proceeding of AAMAS Workshop  on Representation and approaches for Time-Critical Decentralized Resource/Role/Task Allocation, Melbourne, Australia, 2003

bullet

Distributing Constraints by Sampling in Non-Binary CSPs. Miguel. A. Salido, Adriana Giret, Federico Barber. In Proceeding of IJCAI International Workshop on Distributed Constraint Reasoning. Acapulco, México, 2003

bullet

Distributed Hard and Soft Non-binary Constraints: An Any-Time Proposal. Miguel. A. Salido, Federico Barber. X Conference of the Spanish Association for Artificial Intelligence (CAEPIA), ISBN: 84-8373-564-4, Vol(1), pp:449-458 San Sebastian, 2003

2002

bullet

Integration of Discrete and Non-binary CSPs with Linear Programming Techniques. Miguel A. Salido, Adriana Giret and Federico Barber. In Proceedings of CP2002 Workshop on Cooperative Solvers in Constraint Programming, (Itaca, NY) 2002.

bullet

Non-binary Disjunctive Constraint Satisfaction. Miguel. A. Salido, Federico Barber. In Eighth International Conference on Principles and Practice of Constraint Programming Doctoral Programme (CP2002). http://www.math.unipd.it/~frossi/cp2002-doctoral.html, (Itaca, NY) 2002.

2001

bullet

MAS: An On-line and Non-binary CSP solver. Miguel. A. Salido, Adriana Giret, Federico Barber. In Proceeding of CP2001 workshop on On-Line combinatorial problem solving and Constraint Programming (OLCP-01) (Chipre), 2001

bullet

POLYSA: A Polynomial Algorithm for Non-binary Constraint Satisfaction Problems with <= and <>. Miguel. A. Salido, Federico Barber. In Proceeding of EPIA workshop on Constraint Satisfaction and Operational Research Techniques for Problem Solving (CSOR-01) (Oporto), 2001

bullet

Non-binary Constraint Satisfaction Problems. Miguel. A. Salido, Federico Barber. In Seventh International Conference on Principles and Practice of Constraint Programming Poster Session (CP2001). (Chipre) 2001.

bullet

An Incremental and Non-binary CSP Solver: The Hyperpolyhedron Search Algorithm. Miguel. A. Salido, Federico Barber. In Seventh International Conference on Principles and Practice of Constraint Programming Doctoral Programme (CP2001). http://www.math.unipd.it/~frossi/doctoral.html, (Chipre) 2001.

bullet

Constraint Satisfaction by means of Dynamic Polyhedra. Miguel. A. Salido, Adriana Giret, Federico Barber. In the abstract volume on OR 2001. (Duisburg). 146, 2001.

bullet

Consistency and Reduction Algorithms with Agents for non-binary Disjunctive Temporal Constraints. Miguel. A. Salido, Adriana Giret, Oscar Sapena. In Proceedings to SCI2001/ISAS2001: The 5th World Multi-Conference onSystemics, Cybernetics and Informatics. Ed. IIIS, ISBN 980-07-7547-1 and ISBN(CD) 980-07-7529-3, pp. 251-255 (Orlando) 2001.

bullet

Non-binary Temporal CSPs Management with Polyhedra in Artificial Intelligence Problems. Miguel. A. Salido, Adriana Giret, Oscar Sapena. In Proceedings to SCI2001/ISAS2001:” The 5th World Multi-Conference onSystemics, Cybernetics and Informatics. Ed. IIIS, ISBN 980-07-7547-1 and ISBN(CD) 980-07-7529-3, pp. 256-259 (Orlando) 2001.

bullet

Consistency Management by means of Polyhedra in AI/OR Problems. Miguel. A. Salido, Federico Barber. Accepted to proceedings to the EURO2001: The European Operational Research Conference. (Rotterdam) 2001.

bullet

Preprocessing Algorithms for non-binary Disjunctive Constraints in Scheduling Problems. Application to non-linear Constraints. Miguel. A. Salido, Federico Barber. In Proceedings to MAPSP’01 workshop: Fifth Workshop on Models and Algorithms for Planning and Scheduling Problems. (Aussois) 2001.

bullet

Consistency Study by Means of Polyhedra in Scheduling Problems. Miguel. A. Salido, Federico Barber. In Proceedings to the ECCOXIV’01.Conference of the European Chapter on Combinatorial Optimization ECCO XIV. (Bonn) (91-92) 2001.

2000

bullet

Evaluation of Algorithms to Satisfy Disjunctive Temporal Constraints in Planning and Scheduling Problems. Miguel. A. Salido, Antonio Garrido, Federico Barber. In Proceedings of the AISB'00 Symposium on AI Planning and Intelligent Agents, ISBN 1902956146, 33-40. (Birmingham) 2000.

bullet

Dynamic Scheduling in an Integrated Planning and Scheduling Environment. Antonio Garrido, Miguel. A Salido, Federico Barber. Contribution to the Dynamic Scheduling roadmap of PLANET Network of Excellence in AI Planning. (Marsella) 2000.

bullet

Heuristic Methods for Solving Job-Shop Scheduling Problems. Antonio Garrido, Miguel. A. Salido, Federico Barber. In Proceedings of ECAI-2000 Workshop on New Results in Planning, Scheduling and Design (PUK2000). (ed. By Sauer, Köhler). Pp. 36-43. (Berlín) 2000.

bullet

Scheduling in a Planning Environment. Antonio Garrido, Miguel. A. Salido, Federico Barber. In Proceedings of ECAI-2000 Workshop on New Results in Planning, Scheduling and Design (PUK2000). (ed. By Sauer, Köhler). Pp. 36-43. (Berlín) 2000.

 

National Conferences

 
bullet

Uso de herramientas on-line en la docencia de grupos numerosos. A. Giret, M.A. Salido and M. Peinado.17 Congreso Universitario de Innovación Educativa en las Enseñanzas Técnicas. CUIEET 2009. To appear (2009)

bullet

La Formación Algorítmica del Ingeniero. Miguel A. Salido, Adriana Giret, Laura Ingolotti. 17 Congreso Universitario de Innovación Educativa en las Enseñanzas Técnicas. CUIEET 2009. To appear (2009)

bullet

La Programación Informática en las Ingenierías Técnicas. Miguel A. Salido, Adriana Giret, Manuel Peinado. 17 Congreso Universitario de Innovación Educativa en las Enseñanzas Técnicas. CUIEET 2009. To appear (2009)

bullet

A Hybrid Approach to Polynomial Constraint Solving for Termination Tools Salvador Lucas, Raquel Montagut, Rafael Navarro-Marset y Miguel A. Salido. PROLE 2008: 8th Conference on Programming and Computer Languages, 2008.

bullet

Particionamiento y resolución de problemas de satisfacción de restricciones. Montserrat Abril, Miguel A. Salido, Federico Barber: CAEPIA 2007 Workshop on Planning, Scheduling and Constraint Satisfaction, ISBN-13: 978-84-611-8860-4, pp 191-195, 2007.

bullet

Robustez en Horarios Ferroviarios. Miguel A. Salido, Sonia Tarazona. INADIS'07: CAEPIA 2007 Workshop sobre Aplicaciones en la industria de sistemas inteligentes, aceptado, 2007.

bullet

Grupo de Inteligencia Artificial, Planificación y Scheduling, Razonamiento Basado en Restricciones. F. Barber, P. Tormos, A. Lova, M. Abril, L. Ingolotti, M. A. Salido: CAEPIA 2007 Workshop on Planning, Scheduling and Constraint Satisfaction, ISBN-13: 978-84-611-8860-4, pp 213-217, 2007.

bullet

Técnicas para la programación del Tráfico Ferroviario Heterogéneo, A. Lova, P. Tormos,  Barber, L. Ingolotti, M. Abril, M.A. Salido. XXIX Congreso Nacional de Estadística e Investigación Operativa, ISBN: 84-689-8553-8 535-536,  2006

bullet

MOM: Un Sistema Software para la Optimización del Tráfico Ferroviario, P. Tormos, A. Lova, Barber, L. Ingolotti, M. Abril, M.A. Salido. XXIX Congreso Nacional de Estadística e Investigación Operativa, ISBN: 84-689-8553-8 633-634,  2006

bullet

Técnicas Distribuidas para Problemas de Scheduling a Gran Escala. Miguel A. Salido, Montserrat Abril, Federico Barber, Pilar Tormos, Antonio Lova, Laura Ingolotti. Caepia 2005 Workshop sobre Planificación, scheduling y Razonamiento Temporal, 51-59, 2005

bullet

Técnicas de Inteligencia Artificial en Planificación Ferroviaria.  M. A. Salido; F.Barber; M. Abril; L. Ingolotti; A. Lova; P. Tormos, J. Estrada. VI Session on Artificial Intelligence Technology Transfer (TTIA '2005), Ed. Thomson, ISBN:84-9732-435-811-18.  2005.

bullet

A Genetic Approach to Train Scheduling on a High-Traffic Railway Line, P. Tormos, A. Lova, L. Ingolotti, F. Barber, M. Abril, M.A. Salido. Electronic Notes In Theorical Computer Science. To appear, 2005

bullet

Sistema de Créditos ETCS en las asignaturas de primer curso de Ingeniería Informática: Lógica Computacional. Investigar el Espacio Europeo de Educación Superior. Editores: J.G. Bernabeu y N. Sauleda. ISBN: 84-689-0161-X,  pp: 1-34. 2004

bullet

Planificación del tráfico ferroviario en una red altamente sobrecargada.  A. Lova, P. Tormos, F. Barber, L. Ingolotti, M. Abril, Miguel A. Salido.  XXVIII Congreso Nacional de Estadística e Investigación Operativa, 2004.

bullet

Un sistema de ayuda a la toma de decisiones (DSS) para el problema de secuenciación de trenes periódicos. P. Tormos, A. Lova, F. Barber, L. Ingolotti, M. Abril, Miguel A. Salido. XXVIII Congreso Nacional de Estadística e Investigación Operativa, 2004.

bullet

Aplicación de CSPs no Binarios al Análisis ROC.  Miguel A. Salido. Federico Barber; Cesar Ferri; José Hernandez Orallo;  En Actas del workshop de Planificación, Scheduling y Razonamiento Temporal, pp:89-98, San Sebastian, 2003.

bullet

Disjunction of Non-Binary and Numeric CSPs. Miguel. A. Salido, Federico Barber. In Proceedings of 5th Catalan Congress of Artificial Intelligence, ISSN: 1577-1989, (Castellón, Spain) 2002,

bullet

Aplicando Técnicas de Mejora de la Enseñanza de la Inteligencia Artificial en la Licenciatura en Documentación. Carlos Carrascosa, Vicente Julian, Miguel. A. Salido. En actas VIII Jornadas de Enseñanza Universitaria de la Informática, JENUI 2002, ISBN: 84-600-9782-X, pp: 247-254, (Cáceres), 2002.

bullet

Problemas de Satisfacción de Restricciones Temporales no Binarias Mediante Poliedros Dinámicos. Miguel. A. Salido, Adriana Giret, Federico Barber. En actas del V Taller de Razonamiento temporal, espacial y Planificación. TARRAT 01.(Gijón) 2001.

bullet

Grupo de Investigación de Planificación y Scheduling. F. Barber, M. A. De la Fuente, A. Garrido, E. Marzal, E. Onaindia, M. Rebollo, Miguel. A. Salido, L. Sebastia. Actas del “IV Taller de Razonamiento Temporal” pp. 73-76. (Murcia) 1999.

Principal | Curriculum | Publications | Photo Gallery