On the online track assignment problem

DOI10.1016/J.DAM.2012.01.002zbMATH Open1238.90088OpenAlexW2001487170MaRDI QIDQ423916FDOQ423916

Marc Demange, Benjamin Leroy-Beaulieu, Gabriele Di Stefano

Publication date: 30 May 2012

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

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

Recommendations

• A Greedy On-Line Algorithm for thek-Track Assignment Problem
• The \(k\)-track assignment problem
• Trackless online algorithms for the server problem
• The \(k\)-Track assignment problem on partial orders
• The online stochastic generalized assignment problem
• Solvability of \(k\)-track assignment problem: a graph approach
• Randomized approximation and online algorithms for assignment problems
• On track procession assignment problem at the railway network sections
• scientific article; zbMATH DE number 1086921
• On-line \(k\)-truck problem and its competitive algorithms.

zbMATH Keywords

permutation graphsonline coloringcomparability graphsoverlap graphsonline bounded coloringtrack assignment

Mathematics Subject Classification ID

Applications of graph theory (05C90) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Coloring of graphs and hypergraphs (05C15) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

Cites Work

• Algorithmic graph theory and perfect graphs
• Routing Trains Through Railway Stations: Model Formulation and Algorithms
• On-line chain partitions of orders
• Title not available (Why is that?)
• Parallel and On-Line Graph Coloring
• Scheduling trams in the morning
• On the performance of the first-fit coloring algorithm on permutation graphs
• On-line and first fit colorings of graphs
• Dispatching Buses in Parking Depots
• Algorithms for a maximum clique and a maximum independent set of a circle graph
• A tutorial on the use of graph coloring for some problems in robotics
• On minimum \(k\)-modal partitions of permutations
• Real-time dispatch of trams in storage yards
• Title not available (Why is that?)
• On-Line Coloring and Recursive Graph Theory
• Recoverable robustness for train shunting problems
• Which claw-free graphs are perfectly orderable?
• An on-line graph coloring algorithm with sublinear performance ratio
• The train marshalling problem
• Fuzzy dispatching model and genetic algorithms for railyards operations
• Track assignment
• A graph theoretical approach to the shunting problem
• Parking buses in a depot using block patterns: a Benders decomposition approach for minimizing type mismatches
• Partitioning a weighted partial order

Cited In (4)

• A survey on combinatorial optimization in dynamic environments
• An asymptotically optimal algorithm for online stacking
• A tree-based model for setting optimal train fare zones
• Generalised online colouring problems in overlap graphs

This page was built for publication: On the online track assignment problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q423916)