Solving the train marshalling problem by inclusion-exclusion

DOI10.1016/j.dam.2016.09.044zbMath1362.90328OpenAlexW2534499764MaRDI QIDQ516904

Romeo Rizzi, Franca Rinaldi

Publication date: 15 March 2017

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2016.09.044

zbMATH Keywords

dynamic programmingfixed parameter tractabilityinclusion-exclusion principletrain marshalling

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39)

Related Items (1)

Solving Sorting of Rolling Stock Problems Utilizing Pseudochain Structures in Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A finite-difference sieve to count paths and cycles by length
• Inclusion and exclusion algorithm for the Hamiltonian path problem
• Exact algorithms for exact satisfiability and number of perfect matchings
• Dynamic programming meets the principle of inclusion and exclusion
• Algorithms to count paths and cycles
• The train marshalling problem
• Multistage methods for freight train classification
• Set Partitioning via Inclusion-Exclusion
• Shunting for Dummies: An Introductory Algorithmic Survey

This page was built for publication: Solving the train marshalling problem by inclusion-exclusion