Planificación,  Scheduling,  Satisfacción de Restricciones

Selección de Últimas Publicaciones

(Si está interesado en alguna publicación puede ponerse en contacto con los autores)

YEAR 2012

• A Filtering Technique to Achieve 2-consistency in Constraint Satisfaction Problems
  Marlene Arangú, Miguel A. Salido, Federico Barber
  Int. Journal of Innovative Computing Information and Control, Vol. 8, No.6:20-34 ISSN 1349-4198. 2012
   

• Robustness in Dynamic Constraint Satisfaction Problems.
  Laura Climent, Miguel A. Salido, Federico Barber.
  Int. Journal of Innovative Computing Information and Control, Volume 8, Number 3, 2012.
   

• A Decision Support System for Managing Combinatorial Problems in Container Terminals.
  Miguel A. Salido, Mario Rodriguez-Molins, Federico Barber.
  Knowledge Based Systems, 29, 63-74 (2012)Elsevier Science, doi:10.1016/j.knosys.2011.06.021

YEAR 2011

• Intelligent planning for allocating containers in maritime terminals.
  M. Rodriguez-Molins, M.A. Salido, F. Barber.
  Expert Systems with Applications, vol 39, pp:978-989, 2011. doi:10.1016/j.eswa.2011.07.098
   

• A Fine-grained Arc-consistency Algorithm for Non-Normalized Constraint Satisfaction Problems.
  Marlene Arangú, Miguel A. Salido.
  Applied Mathematics and Computer Science, Vol 21(4), pp:733-744, 2011. 
   

• Integrated intelligent techniques for remarshaling and berthing in maritime terminals.
  Miguel A. Salido, Mario Rodríguez-Molins, Federico Barber.
  Advanced Engineering Informatics 25(3): 435-451, 2011. doi:10.1016/j.aei.2010.10.001
   

• Reformulating Dynamic Linear Constraint Satisfaction Problems as Weighted CSPs for Searching Robust Solutions.
  L. Climent, M.A. Salido, F. Barber.
  SARA 2011, Symposium on Abstraction, Reformulation, and Approximation. AAAI Press. Pp. 34-41 2011

YEAR 2010

• Nogood-FC for Solving Distributed Constraint Satisfaction Problems.
  Montserrat Abril, Miguel A. Salido, Federico Barber.
  Journal of Intelligent Manufacturing (Elsevier),  DOI 10.1007/s10845-008-0168-3. 2010.
   

• New Trends on Constraint Satisfaction, Planning, and Scheduling: A Survey.
  Roman Barták, Miguel A. Salido, Francesca Rossi.
  The Knowledge Engineering Review, Vol. 25:3, 249–279, Cambridge University Press, 2010, doi:10.1017/S0269888910000202.
   

• Domain-Dependent Planning Heuristics for Locating Containers in Maritime Terminals
  Mario Rodriguez-Molins, Miguel A. Salido and Federico Barber.
  33th Int Conf on Industrial, Engineering  & other Applications of Applied Intelligent Systems (IEA-AIE 2010)
   

• A Filtering Technique for the Railway Scheduling Problem
  M. Arangu, M. Salido, F. Barber
  COPLAS'10, in ICAPS10. Int. Conf. on Automated Planning and Scheduling. Toronto (COPLAS'10)
   

• AC2001-OP: An Arc-Consistency Algorithm for Constraint Satisfaction Problems
  M.Arangu, M. A. Salido and F. Barber
  33th Int Conf on Industrial, Engineering &Other Applications of Applied Intelligent Systems (IEA-AIE 2010)
   

• A Decision Support Sytem for Railway Timetabling (MOM): the Spanish Case
  F. Barber, P. Tormos, A. Lova, L. Ingolotti, M. A. Salido, M. Abril
  In: Timetable Planning and Information Quality, WIT Press. 2010
   

• Towards the integration of berth allocation and container stacking problems in maritim container terminals.
  M A. Salido, M. Rodriguez-Molins, and F. Barber.
  Int.Conf. on Harbor, Maritime & Multimodal Logistics Modelling and Simulation (HMS’2010), Fez. 2010.
   

• Robust Solutions in Changing Constraint Satisfaction Problems
  Climent, L.; Salido, M. A.; Barber, F.
  33th Int Conf on Industrial, Engineering &Other Applications of Applied Intelligent Systems (IEA-AIE 2010)
   

• Artificial Intelligence Techniques for the Berth Allocation and Container Stacking Problems in Container Terminals
  Salido, M.A.; Rodriguez, M.; Barber, F.
  Applications and Innovations in Intelligent Systems XVIII, Springer, Cambridge, UK. 2010.

YEAR 2009

• Meta-Heuristic and Constraint-based Approaches for Single-Line Railway Timetabling
  F. Barber, L. Ingolotti, A. Lova, P. Tormos, and M.A. Salido
  In: Robust and online large-scale optimization (ed. R. Ahuja, T. Moehring, C Zaroliagis. (Springer) LNCS v:5868:145-181, 2009
   

• 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 Applications of Artificial Intelligence,  22(2009)374–388 Ed. Elsevier, ISSN: 0952-1976. doi:10.1016/j.engappai.2008.10.014  2009
   

• An Efficient Hybrid Genetic Algorithm for Scheduling Projects with Resource Constraints and Multiple Execution Modes
  A. Lova,  P. Tormos, M. Cervantes , F. Barber
  Int. Journal of Production Economics, vol.117, No.2. pp. 302-317, February, 2009 Ed. Elsevier, ISSN:0925-5273 doi:10.1016/j.ijpe.2008.11.002,
  You can DOWNLOAD the PSPLIB multi-mode project instances J60 and J120 tested in the article 
   

• Mathematical Solutions for Solving Periodical Railway Transportation
  M. Salido, F. Barber
  Transportation Mathematical Problems in Engineering, Hindawi Publishing Corporation. 2009
   

• 2-C3: From Arc-Consistency to 2-Consistency
  Marlene Arangú, Miguel A. Salido and Federico Barber.
  8th Symposium on Abstraction, Reformulation and Approximation, Lake Arrowhead (USA) - SARA 2009
   

• An Artificial Intelligence Planning tool for The Container Stacking Problem.
  M. A. Salido, O. Sapena, F. Barber
  Procc of ETFA 2009: 14th IEEE International Conference on Emerging Technologies and Factory Automation,ISBN: 978-1-4244-2728-4,ISSN: 1946-0759, 2009
   
• 2-C3OP: An Improved version of 2-Consistency.
  Marlene Arangú, Miguel A. Salido and Federico Barber.
  21st International Conference on Tools with Artificial Intelligence (ICTAI 2009), New Jersey.USA
   
• What is better: 4 tiers or 5 tiers in the container stacking problem?
  M. A. Salido, O. Sapena, F. Barber
  Procc. Int. Workshop on Harbour, Maritime & Multimodal Logistics Modelling and Simulation, HMS’2009. ISBN 978-84-692-5416-5, pp:39-42, 2009
   
• A Filtering Technique for Non-normalized CSPs
  Arangu, M.; Salido, M. A.; Barber, F.
  15th Int. Conf. on Principles and Practice of Constraint Programming - CP 2009.Lisbon (Portugal)
   
• Optimizing a Fine-grained Arc-consistency Algorithm.
  Arangu, M.; Salido, M. A.; Barber, F.
  XIII Conferencia de la Asociación Española para la Inteligencia Artificial (CAEPIA'2009)
   
• Finding Robust Solutions in Constraint Satisfaction Problems
  Climent, L.; Salido, M. A.; Barber, F.
  15th Int. Conf. on Principles and Practice of Constraint Programming - CP 2009.Lisbon (Portugal)

YEAR 2008

• 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, No.5. pp:774-806, 2008.
   
• Analytical Robustness in Single-Line Railway Scheduling
  Miguel A. Salido, Federico Barber, Laura Ingolotti
  Int.Trans. on Systems Science and Applications, vol 4 No.3 Oct'08 pp.243-251 Ed: SIWN Press. ISSN 1751-1461. 2008 
   
• 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, ISBN: 978-3-540-78984-0. 
  Series: Studies in Computational Intelligence, Vol. 128, Ed. Springer. 2008.
   
• Distributed Search in Railway Scheduling Problems.
  M. Abril, M. A. Salido, F. Barber.
  Engineering Application of Artificial Intelligence. (Ed. Elsevier Science), Vol.21, No. 5:744-755, 2008.
   
• A Hybrid Genetic Algorithm for the Multi-Mode Resource Constrained Project Scheduling Problem
  A. Lova, P. Tormos, M. Cervantes, F. Barber
  11th Workshop on Project Management and Scheduling, Instambul, 2008
   
• A Dynamic Population Steady-State Genetic Algorithm for the Resource-Constrained Project Scheduling Problem
  A. Lova, P. Tormos, M. Cervantes, F. Barber
  21th Int. Conf. on Industrial, Engineering & Other Applications of Applied Intelligent Systems, Wroclaw, 2008
   
• Robustness in Railway Transportation Scheduling
  Salido, M., Barber, F., Ingolotti, L.
  7th World Congress on Intelligent Control and Automation Publicación: Procc. del Workshop,China, 2008
   
• Analytical Assessment of Timetable Robustness
  M. Salido, F. Barber, L. Ingolotti, P. Tormos, A. Lova
  18th Triennial Conference of the International Federation of Operational Research Societies, Sandton, Sudáfrica, 2008
   
• Disruption Simulator in Railway timetabling for Empirical Robustness Assessment
  F. Barber, M. Salido, L. Ingolotti, P. Tormos, A. Lova
  18th Triennial Conference of the International Federation of Operational Research Societies, Sandton, Sudáfrica, 2008

YEAR 2007

• DFS-Tree Based Heuristic Search
  M. Abril, M. A. Salido, F.Barber.
  LNCS, vol 4612:6-19. Selected from: The 7th Symposium on Abstraction, Reformulation and Abstraction (SARA’07, Canada).  2007.
   

• Distributed Models for solving CSPs
  M. Abril, M.A. Salido, F.Barber.
  INFOCOMP, Journal of Computer Science, ISSN: 1807-4545 . Feb'07:43-50. 2007
   

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

• OPTIHPER: A Computer-Based Decision Support System for Employee Timetabling Problems.
  A. Lova P. Tormos, F. Barber
  ERCIM News ISSN: 0926-4981. Vol.70: 64-66, 2007
   

• An Efficient Adaptive Heuristic for the Resource Constrained Project Scheduling Problem.
  A. Lova, P. Tormos, M.Cervantes, F. Barber.
  XII Conferencia de la Asociación Española de IA , 2007
   

• Application of Meta-Tree-Based Distributed Search to the Railway Scheduling Problem.
  M. Abril, M.A. Salido, F. Barber.
  Int.Joint CP/ICAPS Workshop on Constraint SatisfactionTechniques for Planning and Scheduling Problems. pp.6-13,Rhode Island, USA, 2007
   

• Nogood-FC for Solving Partitionable Constraint Satisfaction Problems.
  M.Abril, M.A. Salido, F. Barber.
  Workshop on Planning, Scheduling and Constraint Satisfaction, Salamanca (ESPAÑA)ISBN:978-84-611-8860-4. 2007.
   
• An Optimization Software to solve Employee Timetabling Problems: OPTIHPER
  A. Lova, P. Tormos, M.Cervantes, F. Barber.
  TTIA'07 In: XII Conferencia de la Asociación Española de IA , 2007

• Intelligent Train Scheduling on a High-Loaded Railway Network

  A. Lova, P. Tormos, F. Barber, L. Ingolotti, M.A. Salido, M. Abril TÍTULO:

  Algorithmic Methods for Railway Optimization. Lecture Notes in Computer Science.ISNN: 978-3-540-74245-6 V: 4359: 219-232, 2007

YEAR 2006

• A Decision Support System for Railway Timetabling (MOM): the Spanish Case
  F. Barber, P. Tormos, A. Lova, L. Ingolotti, M. A. Salido, M. Abril.
  Comprail’2006. WIT Trans. in The Built Environment: Computer in Railways (ISSN: 1743-3509), vol. 10, 235-244. 2006. 
   

• Distributed Models in Railway Industry
  M. Abril, M. A. Salido, F. Barber, L. Ingolotti, A. Lova, P. Tormos
  1st Workshop on Industrial Applications of Distributed Intelligent Systems (INADIS'2006), 2006.ISBN 85-87837-11-7.  
   

• Multi-Mode Resource Constrained Project Scheduling: Scheduling Schemes, Priority Rules and Mode Selection Rules
  A. Lova, P. Tormos, F. Barber.
  Inteligencia Artificial, Revista Iberoamericana de I.A. Vol.10, No.30 (2006), ISSN: 1137-3601. pp. 69-86. 
   

• Domain Dependent Distributed Models in Railway Industry
  Salido, Miguel A., Abril, M., Barber, F., Ingolotti, L., Tormos, P. and Lova, A.
  The 26th SGAI International Conference on Innovative Techniques and Applications of Artificial Intelligence. AI-2006. Vol.14, pp.163-176 (2006) 
   

• A scheduling order-based method to solve timetabling problems.
  L. Ingolotti, F.Barber; P. Tormos, A. Lova; ; M. A. Salido M. Abril.
  L. N. in Computer Science, LNAI. Springer . vol: 4177, pp. 52-61. 2006. 
   

• Distributed Constraint Satisfaction Problems to Model Railway Scheduling Problems
  M. Abril, M.A. Salido, F. Barber, P. Tormos, A. Lova, L. Ingolotti.
  Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems. ICAPS’2006. 
   

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

• New Heuristics to Solve the CSOP Railway Timetabling Problem.
  L. Ingolotti, A. Lova, F. Barber, P. Tormos, M. A. Salido, M. Abril.
  Lecture Notes in Computer Science. Vol.4031 pp.. 400 – 409.  2006. 
   

• Train Scheduling: A Real Case
  L. Ingolotti, F. Barber, P.Tormos, A. Lova, M.Salido, M. Abril.
  Internationales Begegnungs und Forschungszentrum (IBFI), Schloss Dagstuhl, Germany. ISSN: 1862-4405.vol. 04261, 2006.

YEAR 2005

• A Heuristic 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. Artificial intelligence research and development. IOS Press. Volumen: 131, pp.339-346. 2005
   

• 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.
  5th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS’05), in ALGO’05. Mallorca, 2005 
   

• 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.
  Int. Trienal Conf. In OR/MS (IFORS’05). Hawai 2005 
   

• 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 (ATMOS’05), in ALGO’05.Mallorca 2005 
   

• Distributed Constraints for Large-Scale Scheduling Problems.
  M. Abril, M.A. Salido, F. Barber
  Springer Lecture Notes in Computer Science, LNAI.  3-540-29238-1 Vol:3709, 2005 
   

• 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). Hawai, 2005. 
   

• Optimization in Railway Scheduling
  M.A. Salido, M. Abril, F. Barber, P. Tormos, A. Lova, L. Ingoilotti
  2nd International Conference on Informatics in Control, Automation and Robotics (ICINCO’05). Barcelona 2005 
   

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

• 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). Proceedings of TTIA'2005, pp. 11-18 (Thomson), ISBN:84-9732-435-8. Granada 2005 
   

• Técnicas Distribuidas para Problemas de Scheduling a Gran Escala
  Salido M. A.; Abril M.; Barber F.; Tormos P.; Lova A.; Ingolotti L.
  III Workshop sobre Planificación, Scheduling y Razonamiento Temporal (2005) Santiago de Compostela. 2005 
   

• Topological Constraints in Periodic Train Scheduling.
  M.A.Salido, M. Abril, F. Barber, L. Ingolotti, P. Tormos, A. Lova.
  IOS Press. Planning, Scheduling and Constraint Satisfaction: From Theory to Practice. Frontiers in Artificial Intelligence and Applications. Vol 117, 11-20 2005

YEAR 2004

• 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 , M.A. Salido.
  XXVIII Congreso Nacional de Estadística e Investigación Operativa. Cadiz, Octubre (2004).
   

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

• A Topological Model Based on Network Capacity to Manage Periodic Train Scheduling. 
  M.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). Vol.XII pp.107-120. 2004. 
   

• A Non-Binary Constraint Ordering Approach to Scheduling Problems.
  Miguel A. Salido, Federico Barber.
  Applications and Innovations in Intelligent Systems (Selected form The 24th International Conference on Innovative Techniques and Applications of Artificial Intelligence). Springer Verlag) 2004. 
   

• Constrainedness and Redundancy by Constraint Ordering. 
  Miguel A. Salido, Federico Barber.
  Advances in Artificial Intelligence – IBERAMIA 2004: 9th Ibero-American Conference on AI.  LNCS Vol.3315 (Springer Verlag), Puebla, Mexico. 2004. 
   

• An Efficient Method to Schedule New Trains on a Heavily Loaded Railway Network. 
  L. Ingolotti, F. Barber, P. Tormos, A. Lova, M.A. Salido, M. Abril.
  Advances in Artificial Intelligence – IBERAMIA 2004: 9th Ibero-American Conference on AI.  LNCS Vol.3315 (Springer Verlag), Puebla, Mexico. 2004. 
   

• Intelligent Train Scheduling on a High-Loaded Railway Network. 
  A. Lova, P. Tormos, F. Barber, L. Ingolotti, M.A. Salido, M. Abril.
  ATMOS 2004: Algorithmic Methods and Models for Optimization of Railways.  2004. 
   

• Exploiting the Constrainedness in Constraint Satisfaction Problems. 
  Miguel A. Salido, Federico Barber.
  Advances in Artificial Intelligence. Lecture Notes in Conputer Science. I.S.S.N.0302-9743.Vol.3192 pp.126-136. 2004. 
   

• Constrainedness in Constraint Satisfaction. 
  Miguel A. Salido, Federico Barber.
  Frontiers in Artificial Intelligence and Applications (IOS Press). vol.113, pp 425-432. 2004. 
   

• Distributing constraints by sampling in non-binary CSPs. 
  Miguel A. Salido, Adriana Giret, Federico Barber.
  Frontiers in Artificial Intelligence and Applications (IOS Press). vol.112-1, pp.77-91. 2004.
   

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

• Distributed Non-binary Constraints
  Miguel Angel Salido; Federico Barber; 
  LNCS/LNAI 3040:281-290 (Springer Verlag). 2004. 
   

• A mixed Closure-CSP Method for Solving Scheduling Problems.
  Mª. I. Alfonso, F. Barber.
  Applied Intelligence, Vol.21:173-193, Kluwer Academic Publishers. 2004
   

• Applying Topological Constraint Optimization Techniques to Periodic Train Scheduling. 
  Miguel A. Salido, M. Abril, F. Barber, L. Ingolotti, P. Tormos, A. Lova. 
  ECAI'2004 Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems. 2004. 
   

• An Interactive Train Scheduling Tool for Solving and Plotting Running Maps.
  F. Barber, M. A. Salido, M. Abril, L. Ingolotti, A. Lova, P. Tormos
  LNCS/LNAI 3040: 659-668 (Springer Verlag). 2004.

YEAR 2003

• 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 
   

• 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. 
   

• 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 
   

• 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. 
   

• 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. 
   

• 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. 
   

• 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. 
   

• 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, 108-120, ISSN: 0302-9743, LNCS-LNAI 2837,  Cavtat-Dubrovnik, Croatia, 2003. 
   

• A Constraint Ordering Heuristic for Scheduling Problems.  
  Miguel. A. Salido, Federico Barber. 
  In Proceeding of  the 1st Multidisciplinary International Conference on Scheduling : Theory and Applications, Vol(2) 476-490, ISBN 0-9545821-1-X Nottingham, 2003. 
   

• Volume Under the ROC Surface for Multi-class Problems. Exact Computation and Evaluation of Approximations. 
  Cesar Ferri, José Hernández-Orallo,  Miguel. A. Salido. 
  Technical Report, Ref. Nº: DSIC-II/09/03, Mayo, 2003. 
   

• 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 
   

• 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 
   

• 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

YEAR 2002

• 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. 
   

• Representation and reasoning with disjunctive temporal constraints.  
  Mª I. Galipienso, F. Barber. Manchester . TIME'2002. 
   

• AI: Past, Present and Future.  
  In: Artificial Intelligence: Technology with a Future. (guest eds: F. Barber, V. Botti, J. Koehler.)  Upgrade. CEPIS. issn: 1684-5285. (2202).
   

• Disjunction of Non-Binary and Numeric CSPs. 
  Miguel. A. Salido, Federico Barber. 
  In Topics in Artificial Intelligence. (Springer Verlag, LNAI 2504) pp: 159-172, 2002.
   

• An integration model for planning and scheduling problems with constrained resources. P. Tormos, F. Barber, A. Lova. Eighth International Workshop On Project Management And Scheduling.PMS 2002 (EURO Working Group on Project Management and Scheduling).  (ISSN: 84-921190-5-5). pág:354-358. 2002.
   

• 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. 
   

• 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. 
   

• Time-Optimal Planning in Temporal Problems. 
  A. Garrido, E. Onaindía, F. Barber. 
  Lecture Notes on Artificial Intelligence (Springer) 2002.
   

• 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) (Itaca, NY) 2002. 
   

• 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. 
   

• 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. 
   

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

• Problemas 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, pp: 60-70, 2002.

Publicaciones Previas ( < 2002)