| 2008 |
|---|
| 30 | EE | María Pilar Tormos,
Antonio Luis Lova,
Federico Barber,
Laura Paola Ingolotti,
Montserrat Abril,
Miguel A. Salido:
A Genetic Algorithm for Railway Scheduling Problems.
Metaheuristics for Scheduling in Industrial and Manufacturing Applications 2008: 255-276 |
| 29 | EE | Miguel A. Salido:
A non-binary constraint ordering heuristic for constraint satisfaction problems.
Applied Mathematics and Computation 198(1): 280-295 (2008) |
| 2007 |
|---|
| 28 | EE | Miguel A. Salido:
Distributed CSPs: Why It Is Assumed a Variable per Agent?
SARA 2007: 407-408 |
| 27 | EE | Montserrat Abril,
Miguel A. Salido,
Federico Barber:
DFS-Tree Based Heuristic Search.
SARA 2007: 5-19 |
| 26 | EE | Miguel A. Salido,
Adriana Giret,
Montserrat Abril López:
Aplicación de Metodologías Activas en la Enseñanza de Informática en la Licenciatura en Matemáticas.
IEEE-RITA 2(2): 73-78 (2007) |
| 25 | EE | Miguel A. Salido,
Montserrat Abril,
Federico Barber,
Laura Paola Ingolotti,
María Pilar Tormos,
Antonio Luis Lova:
Domain-dependent distributed models for railway scheduling.
Knowl.-Based Syst. 20(2): 186-194 (2007) |
| 2006 |
|---|
| 24 | EE | Laura Paola Ingolotti,
Antonio Luis Lova,
Federico Barber,
María Pilar Tormos,
Miguel A. Salido,
Montserrat Abril:
New Heuristics to Solve the "CSOP" Railway Timetabling Problem.
IEA/AIE 2006: 400-409 |
| 23 | EE | Miguel A. Salido,
Federico Barber:
Distributed CSPs by graph partitioning.
Applied Mathematics and Computation 183(1): 491-498 (2006) |
| 2005 |
|---|
| 22 | EE | Laura Paola Ingolotti,
Federico Barber,
María Pilar Tormos,
Antonio Luis Lova,
Miguel A. Salido,
Montserrat Abril:
A Scheduling Order-Based Method to Solve Timetabling Problems.
CAEPIA 2005: 52-61 |
| 21 | | Montserrat Abril,
Miguel A. Salido,
Federico Barber,
Laura Paola Ingolotti,
Antonio Luis Lova,
María Pilar Tormos:
A Heuristic Technique for the Capacity Assessment of Periodic Trains.
CCIA 2005: 339-346 |
| 20 | EE | Montserrat Abril,
Miguel A. Salido,
Federico Barber:
Distributed Constraints for Large-Scale Scheduling Problems.
CP 2005: 837 |
| 19 | | Miguel A. Salido,
Montserrat Abril,
Federico Barber,
Laura Paola Ingolotti,
Antonio Luis Lova,
María Pilar Tormos:
Optimization in railway scheduling.
ICINCO 2005: 188-195 |
| 2004 |
|---|
| 18 | | Laura Paola Ingolotti,
María Pilar Tormos,
Antonio Luis Lova,
Federico Barber,
Miguel A. Salido,
Montserrat Abril:
A Decision Support System (DSS) for the Railway Scheduling Problem.
AIAI 2004: 465-474 |
| 17 | EE | Miguel A. Salido,
Federico Barber:
Exploiting the Constrainedness in Constraint Satisfaction Problems.
AIMSA 2004: 126-136 |
| 16 | EE | Antonio Luis Lova,
María Pilar Tormos,
Federico Barber,
Laura Paola Ingolotti,
Miguel A. Salido,
Montserrat Abril:
Intelligent Train Scheduling on a High-Loaded Railway Network.
ATMOS 2004: 219-232 |
| 15 | EE | Miguel A. Salido,
Federico Barber:
Constrainedness and Redundancy by Constraint Ordering.
IBERAMIA 2004: 124-133 |
| 14 | EE | Laura Paola Ingolotti,
Federico Barber,
María Pilar Tormos,
Antonio Luis Lova,
Miguel A. Salido,
Montserrat Abril:
An Efficient Method to Schedule New Trains on a Heavily Loaded Railway Network.
IBERAMIA 2004: 164-173 |
| 2003 |
|---|
| 13 | EE | Miguel A. Salido,
Federico Barber:
Distributed Non-binary Constraints.
CAEPIA 2003: 271-280 |
| 12 | EE | Federico Barber,
Miguel A. Salido,
Laura Paola Ingolotti,
Montserrat Abril,
Antonio Luis Lova,
María Pilar Tormos:
An Interactive Train Scheduling Tool for Solving and Plotting Running Maps.
CAEPIA 2003: 646-655 |
| 11 | EE | César Ferri,
José Hernández-Orallo,
Miguel A. Salido:
Volume under the ROC Surface for Multi-class Problems.
ECML 2003: 108-120 |
| 10 | EE | Federico Barber,
Miguel A. Salido:
Introducción a la programación de restricciones.
Inteligencia Artificial, Revista Iberoamericana de Inteligencia Artificial 20: 13-30 (2003) |
| 9 | EE | Miguel A. Salido:
Técnicas para el manejo de CSPs no binarios.
Inteligencia Artificial, Revista Iberoamericana de Inteligencia Artificial 20: 95-110 (2003) |
| 8 | EE | Miguel A. Salido,
Federico Barber:
A polynomial algorithm for continuous non-binary disjunctive CSPs: extended DLRs.
Knowl.-Based Syst. 16(5-6): 277-285 (2003) |
| 2002 |
|---|
| 7 | EE | Miguel A. Salido,
Federico Barber:
Disjunction of Non-binary and Numeric Constraint Satisfaction Problems.
CCIA 2002: 159-172 |
| 6 | EE | Miguel A. Salido,
Federico Barber:
Disjunctive and Continuous Constraint Satisfaction Problems.
CP 2002: 768 |
| 5 | EE | Miguel A. Salido,
Adriana Giret,
Federico Barber:
Problemas de Satisfaccion de Restricciones no Binarias con Dominios Continuos.
Inteligencia Artificial, Revista Iberoamericana de Inteligencia Artificial 15: 60-70 (2002) |
| 2001 |
|---|
| 4 | EE | Miguel A. Salido,
Federico Barber:
An Incremental and Non-binary CSP Solver: The Hyperpolyhedron Search Algorithm.
CP 2001: 779 |
| 3 | EE | Miguel A. Salido,
Adriana Giret,
Federico Barber:
Realizing a Global Hyperpolyhedron Constraint via LP Techniques.
PuK 2001 |
| 2000 |
|---|
| 2 | EE | Antonio Garrido Tejero,
Miguel A. Salido,
Federico Barber,
Montserrat Abril López:
Heuristic Methods for Solving Job-Shop Scheduling Problems.
PuK 2000 |
| 1 | EE | Antonio Garrido Tejero,
Miguel A. Salido,
Federico Barber:
Scheduling in a Planning Environment.
PuK 2000 |
