Solving Sorting of Rolling Stock Problems Utilizing Pseudochain Structures in Graphs

DOI10.1007/978-3-030-22723-4_4OpenAlexW2954872506MaRDI QIDQ5051120

Jens Dörpinghaus, Rainer Schrader

Publication date: 18 November 2022

Published in: Recent Advances in Computational Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-22723-4_4

zbMATH Keywords

number of sorting trackstrain marshalling problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Solving the train marshalling problem by inclusion-exclusion
• The train marshalling problem
• The vectorization of ITPACK 2C
• Unnamed Item

This page was built for publication: Solving Sorting of Rolling Stock Problems Utilizing Pseudochain Structures in Graphs