The train marshalling problem
type: Item
instance of: scholarly article
title: The train marshalling problem
zbMATH Open document ID: 0962.90009
DOI: 10.1016/S0166-218X(99)00219-X
author: Elias Dahlhaus
author: Mirka Miller
author: Joe Ryan
author: Peter Horák
published in: Discrete Applied Mathematics
publication date: 2001-06-21T00:00:00Z
Mathematics Subject Classification ID: 90B20
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C65
zbMATH DE Number: 1474727
zbMATH Keywords: train rearrangement
zbMATH Keywords: partitions
zbMATH Keywords: NP-completeness
zbMATH Keywords: numerical matching with target sums
MaRDI profile type: Publication
cites work: Q3996253
cites work: Q3668280
Recommended article: Solving the train marshalling problem by inclusion-exclusion
Recommended article: The train-to-yard assignment problem
Recommended article: The Train Delivery Problem Revisited
Recommended article: Q4474107
Recommended article: The basic train makeup problem in shunting yards
Recommended article: The Merlin-Randell problem of train journeys
Recommended article: A railway scheduling problem
Recommended article: Solving a real-world train unit assignment problem
description: scientific article; zbMATH DE number 1474727