A particular timetable problem: terminal scheduling
From MaRDI portal
Publication:3766555
DOI10.1080/02331938708843221zbMath0629.60010MaRDI QIDQ3766555
Publication date: 1987
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331938708843221
shortest path; heuristic algorithm; Hungarian method; alternating paths; minimal path algorithm; optimal time table
Cites Work