scientific article; zbMATH DE number 7121836

DOI10.4230/OASIcs.ATMOS.2014.34zbMath1432.90017MaRDI QIDQ5240128

Frédéric Meunier, Vianney Boeuf

Publication date: 24 October 2019

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

bipartite graphcompetitive analysisonline algorithmvertex covertrain shunting problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Traffic problems in operations research (90B20) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• The train marshalling problem
• On-line vertex-covering
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Optimal Freight Train Classification using Column Generation
• Optimal Algorithms for Train Shunting and Relaxed List Update Problems.
• Multistage methods for freight train classification
• Coverings of Bipartite Graphs
• Shunting for Dummies: An Introductory Algorithmic Survey

This page was built for publication: