The Merlin-Randell problem of train journeys

DOI10.1007/BF00267866MaRDI QIDQ1062925zbMATH OpenOpenAlexFDO

Authors Maciej Koutny

Publication date 1986

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00267866

zbMATH Keywords

labeled directed multigraphMerlin-Randell problem of train journeysmovement graphoptimal strategysynchronizationtrain schedulingtrain system

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Deterministic scheduling theory in operations research (90B35) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 3956436
• Exact train pathing
• A Model, Algorithms and Strategy for Train Pathing
• Waiting for trains: complexity results
• Routing trains through railway stations: Complexity issues

Cites work

• COSY - a system specification language based on paths and processes
• scientific article; zbMATH DE number 3956436 (Why is no real title available?)
• scientific article; zbMATH DE number 3669869 (Why is no real title available?)
• scientific article; zbMATH DE number 3683521 (Why is no real title available?)
• scientific article; zbMATH DE number 3755835 (Why is no real title available?)

Cited in

(5)

• The train marshalling problem
• Occurrence nets then and now: the path to structured occurrence nets
• scientific article; zbMATH DE number 3956436 (Why is no real title available?)
• The railroad crossing problem: an experiment with instantaneous actions and immediate reactions
• Logical foundations of group traffic control of trains

This page was built for publication: The Merlin-Randell problem of train journeys

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1062925)