On the public citation graph

Exploiting Incrementality in Branch and Bound for Train Dispatching

https://doi.org/10.2139/ssrn.5260286
0 signed · 35 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11564751_28openalex-snapshot
Maintaining Longest Paths in Cyclic Graphs
inferredcites →https://doi.org/10.1007/3-540-68530-8_27openalex-snapshot
Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights
inferredcites →https://doi.org/10.1007/978-3-030-37599-7_32openalex-snapshot
Combinatorial Learning in Traffic Management
inferredcites →https://doi.org/10.1007/978-3-319-59776-8_26openalex-snapshot
Rescheduling Railway Traffic on Real Time Situations Using Time-Interval Variables
inferredcites →https://doi.org/10.1007/978-3-319-72153-8_12openalex-snapshot
Train Dispatching
inferredcites →https://doi.org/10.1007/978-3-540-70575-8_35openalex-snapshot
Faster Algorithms for Incremental Topological Ordering
inferredcites →https://doi.org/10.1007/978-3-642-56628-8openalex-snapshot
Linear optimization and extensions : problems and solutions
inferredcites →https://doi.org/10.1007/pl00009261openalex-snapshot
Solving Systems of Difference Constraints Incrementally
inferredcites →https://doi.org/10.1007/s10107-023-01977-xopenalex-snapshot
A theoretical and computational analysis of full strong-branching
inferredcites →https://doi.org/10.1007/s10601-005-0554-9openalex-snapshot
Maintaining Longest Paths Incrementally
inferredcites →https://doi.org/10.1007/s12469-013-0063-yopenalex-snapshot
Rescheduling models for railway traffic management in large-scale networks
inferredcites →https://doi.org/10.1007/s43069-023-00243-2openalex-snapshot
An Optimization-Based Decision Support Tool for Incremental Train Timetabling
inferredcites →https://doi.org/10.1016/j.cor.2023.106339openalex-snapshot
Set covering heuristics in a Benders decomposition for railway timetabling
inferredcites →https://doi.org/10.1016/j.cor.2024.106679openalex-snapshot
A MaxSAT approach for solving a new Dynamic Discretization Discovery model for train rescheduling problems
inferredcites →https://doi.org/10.1016/j.ejor.2006.10.034openalex-snapshot
A branch and bound algorithm for scheduling trains in a railway network
inferredcites →https://doi.org/10.1016/j.ejor.2022.02.043openalex-snapshot
A logic-based Benders decomposition for microscopic railway timetable planning
inferredcites →https://doi.org/10.1016/j.jrtpm.2011.09.001openalex-snapshot
Micro–macro transformation of railway networks
inferredcites →https://doi.org/10.1016/j.jrtpm.2016.01.002openalex-snapshot
A detailed analysis of the actual impact of real-time railway traffic management optimization
inferredcites →https://doi.org/10.1016/j.orl.2004.04.002openalex-snapshot
Branching rules revisited
inferredcites →https://doi.org/10.1016/j.sorms.2012.12.001openalex-snapshot
Practical guidelines for solving difficult mixed integer linear programs
inferredcites →https://doi.org/10.1016/j.trb.2020.09.004openalex-snapshot
Decomposition and distributed optimization of real-time traffic management for large-scale railway networks
inferredcites →https://doi.org/10.1016/s0377-2217(01)00338-1openalex-snapshot
Job-shop scheduling with blocking and no-wait constraints
inferredcites →https://doi.org/10.1109/tits.2014.2358392openalex-snapshot
A Review of Online Dynamic Models and Algorithms for Railway Traffic Management
inferredcites →https://doi.org/10.1109/tits.2015.2446985openalex-snapshot
A Survey on Problem Models and Solution Approaches to Rescheduling in Railway Networks
inferredcites →https://doi.org/10.1145/1187436.1210590openalex-snapshot
A dynamic topological sort algorithm for directed acyclic graphs
inferredcites →https://doi.org/10.1145/3379489openalex-snapshot
Toward a Theory of Superdense Time in Simulation Models
inferredcites →https://doi.org/10.1145/3618260.3649745openalex-snapshot
Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow
inferredcites →https://doi.org/10.1145/3828.3830openalex-snapshot
Generalized best-first search strategies and the optimality of A*
inferredcites →https://doi.org/10.1287/inte.2017.0931openalex-snapshot
A Novel Movement Planner System for Dispatching Trains
inferredcites →https://doi.org/10.1287/opre.1080.0642openalex-snapshot
Optimal Real-Time Traffic Control in Metro Stations
inferredcites →https://doi.org/10.1287/opre.17.6.941openalex-snapshot
Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
inferredcites →https://doi.org/10.1287/opre.2014.1327openalex-snapshot
An Exact Decomposition Approach for the Real-Time Train Dispatching Problem
inferredcites →https://doi.org/10.1287/opre.2018.1837openalex-snapshot
A Noncompact Formulation for Job-Shop Scheduling Problems in Traffic Management
inferredcites →https://doi.org/10.1287/trsc.2015.0605openalex-snapshot
Optimal Train Dispatching by Benders’-Like Reformulation
inferredcites →https://doi.org/10.4230/oasics.atmos.2011.1openalex-snapshot
Real-time traffic control in railway systems
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.