Publicaciones en las que colabora con Federico Barber Sanchís (18)

2006

  1. A decision support system for railway timetabling (MOM): The Spanish case

    WIT Transactions on the Built Environment

  2. A scheduling order-based method to solve timetabling problems

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  3. Distributed CSPs by graph partitioning

    Applied Mathematics and Computation, Vol. 183, Núm. 1, pp. 491-498

  4. Distributed Constraint Satisfaction Problems to model Railway Scheduling problems

    ICAPS 2006 - Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems

  5. Distributed constraint satisfaction problems to model railway scheduling problems

    WIT Transactions on the Built Environment

  6. New heuristics to solve the "CSOP" railway timetabling problem

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2005

  1. A heuristic technique for the capacity assessment of periodic trains

    Frontiers in Artificial Intelligence and Applications

  2. Distributed constraints for large-scale scheduling problems

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2004

  1. A Decision Support System (DSS) for the Railway Scheduling Problem

    IFIP Advances in Information and Communication Technology

  2. An efficient method to schedule new trains on a heavily loaded railway network

    Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

  3. An interactive train scheduling tool for solving and plotting running maps

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  4. Constrainedness and redundancy by constraint ordering

    Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

  5. Distributed non-binary constraints

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  6. Exploiting the constrainedness in constraint satisfaction problems

    Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

2003

  1. A polynomial algorithm for continuous non-binary disjunctive CSPs: Extended DLRs

    Knowledge-Based Systems

  2. Introducción a la programación de restricciones

    Inteligencia artificial: Revista Iberoamericana de Inteligencia Artificial, Vol. 7, Núm. 20, pp. 13-30

2002

  1. Disjunction of non-binary and numeric constraint satisfaction problems

    Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

  2. Disjunctive and continuous constraint satisfaction problems

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)