MIGUEL ANGEL
SALIDO GREGORIO
Investigador en el període 2002-2005
Universidad Politécnica de Valencia
Valencia, EspañaPublicacions en col·laboració amb investigadors/es de Universidad Politécnica de Valencia (22)
2006
-
A decision support system for railway timetabling (MOM): The Spanish case
WIT Transactions on the Built Environment
-
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)
-
Distributed CSPs by graph partitioning
Applied Mathematics and Computation, Vol. 183, Núm. 1, pp. 491-498
-
Distributed constraint satisfaction problems to model railway scheduling problems
WIT Transactions on the Built Environment
-
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)
-
Preface
ICAPS 2006 - Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems
2005
-
A heuristic technique for the capacity assessment of periodic trains
Frontiers in Artificial Intelligence and Applications
-
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
-
A Decision Support System (DSS) for the Railway Scheduling Problem
IFIP Advances in Information and Communication Technology
-
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)
-
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)
-
Constrainedness and redundancy by constraint ordering
Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)
-
Distributed non-binary constraints
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
-
Exploiting the constrainedness in constraint satisfaction problems
Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)
2003
-
A polynomial algorithm for continuous non-binary disjunctive CSPs
RESEARCH AND DEVELOPMENT IN INTELLIGENT SYSTEM XIX
-
A polynomial algorithm for continuous non-binary disjunctive CSPs: Extended DLRs
Knowledge-Based Systems
-
Volume under the ROC surface for multi-class problems
Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)
2002
-
A non-binary constraint satisfaction solver: The One-face Hyperpolyhedron Heuristic.
RESEARCH AND DEVELOPMENT IN INTELLIGENT SYSTEMS XVIII
-
Constraint satisfaction by means of dynamic polyhedra
OPERATIONS RESEARCH PROCEEDINGS 2001
-
Disjunction of non-binary and numeric constraint satisfaction problems
Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)