( en | de | ru )

 

Disambiguation of "Salido, Miguel A."

Author of the publication

copydeleteadd this publication to your clipboard
Robustness for a single railway line: Analytical and simulation methods.

, , and . Expert Syst. Appl., 39 (18): 13305-13327 (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Miguel Angel Peña A

Miguel A Granados Velásquez

Ignacio López Salido

Miguel Beato

Miguel Cruset

 

Other publications of authors with the same name

Preface to special issue on planning and scheduling., , , and . Knowledge Eng. Review, 25 (3): 247-248 (2010)Disjunction of Non-binary and Numeric Constraint Satisfaction Problems., and . CCIA, volume 2504 of Lecture Notes in Computer Science, page 159-172. Springer, (2002)An Interactive Train Scheduling Tool for Solving and Plotting Running Maps., , , , , and . CAEPIA, volume 3040 of Lecture Notes in Computer Science, page 646-655. Springer, (2003)Solving the job shop scheduling problem with operators by depth-first heuristic search enhanced with global pruning rules., , , , and . AI Commun., 28 (2): 365-381 (2015)New trends in constraint satisfaction, planning, and scheduling: a survey., , and . Knowl. Eng. Rev., 25 (3): 249-279 (2010)Meta-heuristic and Constraint-Based Approaches for Single-Line Railway Timetabling., , , , and . Robust and Online Large-Scale Optimization, volume 5868 of Lecture Notes in Computer Science, Springer, (2009)A holonic architecture for the global road transportation system., , and . J. Intell. Manuf., 21 (1): 133-144 (2010)Distributed search in railway scheduling problems., , and . Eng. Appl. Artif. Intell., 21 (5): 744-755 (2008)Integrated intelligent techniques for remarshaling and berthing in maritime terminals., , and . Adv. Eng. Informatics, 25 (3): 435-451 (2011)A non-binary constraint ordering heuristic for constraint satisfaction problems.. Appl. Math. Comput., 198 (1): 280-295 (2008)