The Merlin-Randell problem of train journeys

DOI10.1007/BF00267866zbMath0573.90094OpenAlexW2018146264MaRDI QIDQ1062925

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

optimal strategysynchronizationtrain schedulinglabeled directed multigraphMerlin-Randell problem of train journeysmovement graphtrain system

Mathematics Subject Classification ID

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

Related Items (1)

Occurrence Nets Then and Now: The Path to Structured Occurrence Nets

Cites Work

• COSY - a system specification language based on paths and processes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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