Fetching the paper…
Reading the bibliography…
As consequences of disruptions in railway traffic affect passenger experience/satisfaction, appropriate rerouting and/or rescheduling is necessary.
B. Szpigel, “Optimal train scheduling on a single line railway,” Journal of Operations Research
1973
Earlier work this paper cites.
I. G. Rosenberg, “Reduction of bivalent maximization to the quadratic case.,” Cahiers du Centre d’Etudes de Recherche Operationnelle
1975
Earlier work this paper cites.
International Series in Operations Research & Management Science, 1984
D. Luenberger and Y. Ye, Linear and Nonlinear Programming · 1984
Earlier work this paper cites.
B. Apolloni, C. Carvalho, and D. De Falco, “Quantum stochastic optimization,” Stochastic Processes and their Applications
1989
Earlier work this paper cites.
Y. N. Sotskov and N. V. Shakhlevich, “NP-hardness of shop-scheduling problems with three jobs,” Discrete Applied Mathematics
1995
Earlier work this paper cites.
T. Kadowaki and H. Nishimori, “Quantum annealing in the transverse Ising model,” Physical Review E
1998
Earlier work this paper cites.
J.-F. Cordeau, P. Toth, and D. Vigo, “A survey of optimization models for train routing and scheduling,” Transportation Science
1998
Earlier work this paper cites.
E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser, “Quantum computation by adiabatic evolution,” arXiv preprint quant-ph/0001106
2000
Earlier work this paper cites.
E. Boros and P. L. Hammer, “Pseudo-boolean optimization,” Discrete Applied Mathematics
2002
Earlier work this paper cites.
J. Forrest and R. Lougee-Heimer, “CBC user guide: Emerging theory, methods, and applications,” in INFORMS TutORials in Operations Research
2005
Earlier work this paper cites.
J. Törnquist and J. A. Persson, “N-tracked railway traffic re-scheduling during disturbances,” Transportation Research Part B: Methodological
2007
Earlier work this paper cites.
A. D’Ariano, D. Pacciarelli, and M. Pranzo, “A branch and bound algorithm for scheduling trains in a railway network,” European Journal of Operational Research
2007
Earlier work this paper cites.
S. Q. Liu and E. Kozan, “Scheduling trains as a blocking parallel-machine job shop scheduling problem,” Computers & Operations Research
2009
Earlier work this paper cites.
S. Harrod, “Capacity factors of a mixed speed railway network,” Transportation Research Part E: Logistics and Transportation Review
2009
Earlier work this paper cites.
F. Corman, A. D’Ariano, M. Pranzo, and I. A. Hansen, “Effectiveness of dynamic reordering and rerouting of trains in a complicated and densely occupied station area,” Transportation Planning and Technology
2011
Earlier work this paper cites.
M. W. Johnson et al
2011
Earlier work this paper cites.
F. Corman, A. D’Ariano, I. A. Hansen, D. Pacciarelli, and M. Pranzo, “Dispatching trains during seriously disrupted traffic situations,” in 2011 International Conference on Networking, Sensing and Control
2011
Cited alongside, same era.
F. Glover, J.-K. Hao, and G. Kochenberger, “Polynomial unconstrained binary optimisation–part 1,” International Journal of Metaheuristics
2011
Cited alongside, same era.
S. Mitchell, S. M. Consulting, and I. Dunning, “PuLP: A Linear Programming Toolkit for Python,” 2011
2011
Cited alongside, same era.
New York: Springer, 2012
M. L. Pinedo, Scheduling · 2012
Cited alongside, same era.
R. Larsen, M. Pranzo, A. D’Ariano, F. Corman, and D. Pacciarelli, “Susceptibility of optimal train schedules to stochastic disturbances of process times,” Flexible Services and Manufacturing Journal
2014
Cited alongside, same era.
A. Perdomo-Ortiz, A. Feldman, A. Ozaeta, S. V. Isakov, Z. Zhu, B. O’Gorman, H. G. Katzgraber, A. Diedrich, H. Neven, J. de Kleer, et al
2019
Later among the works it cites.
Z. Tabi, K. H. El-Safty, Z. Kallus, P. Hága, T. Kozsik, A. Glos, and Z. Zimborás, “Quantum optimization for the graph coloring problem with space-efficient embedding,” in 2020 IEEE International Conference on Quantum Computing and Engineering (QCE)
2020
Later among the works it cites.
M. Borowski et al
2020
Later among the works it cites.
A. Mandal, A. Roy, S. Upadhyay, and H. Ushijima-Mwesigwa, “Compressed quadratization of higher order binary optimization problems,” in Proceedings of the 17th ACM International Conference on Computing Frontiers
2020
Later among the works it cites.
https://www.dwavesys.com/media/m2xbmlhs/14-1048a-a_d-wave_hybrid_solver_service_plus_advantage_technology_update.pdf
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A. Lucas, “Ising formulations of many NP problems,” Frontiers in Physics
2014
Cited alongside, same era.
2014
Cited alongside, same era.
P. Batty, R. Palacin, and A. González-Gil, “Challenges and opportunities in developing urban modal shift,” Travel Behaviour and Society
2015
Cited alongside, same era.
L.-G. Mattsson and E. Jenelius, “Vulnerability and resilience of transport systems – a discussion of recent research,” Transportation Research Part A: Policy and Practice
2015
Cited alongside, same era.
F. Corman and L. Meng, “A review of online dynamic models and algorithms for railway traffic management,” IEEE Transactions on Intelligent Transportation Systems
2015
Cited alongside, same era.
F. Neukart, G. Compostella, C. Seidel, D. Von Dollen, S. Yarkoni, and B. Parney, “Traffic flow optimization using a quantum annealer,” Frontiers in ICT
2017
Cited alongside, same era.
S. Tsukamoto, M. Takatsu, S. Matsubara, and H. Tamura, “An accelerator architecture for combinatorial optimization problems,” Fujitsu Sci. Tech. J
2017
Cited alongside, same era.
D-Wave, “D-Wave Hybrid Solver Service + Advantage: Technology Update [WhitePaper],” 2020 · 2020
Later among the works it cites.
C. McGeoch, P. Farré, and W. Bernoudy, “D-Wave Hybrid Solver Service+ Advantage: Technology Update,” tech. rep., D-Wave Systems Inc, Burnaby, BC, Canada, 2020
2020
Later among the works it cites.
C. Mulley, J. D. Nelson, S. Ison, K. H. Tsoi, and B. P. Y. Loo, “The Routledge Handbook of Public Transport,” The Routledge Handbook of Public Transport
2021
Closest in time.
2021
Closest in time.
D. Shimada, T. Shibuya, and T. Shibasaki, “A decomposition method for makespan minimization in job-shop scheduling problem using ising machine,” in IEEE 8th International Conference on Industrial Engineering and Applications (ICIEA)
2021
Closest in time.
2021
Closest in time.
C. Roch, A. Impertro, and C. Linnhoff-Popien, “Cross entropy optimization of constrained problem hamiltonians for quantum annealing,” in International Conference on Computational Science
2021
Closest in time.
K. Gawlak, “Mapa zdarzeń i wydarzeń kolejowych w roli innowacyjnego projektu wspomagajacego system zarzadzania bezpieczeństwem regionalnego przewoźnika Koleje Ślaskie sp. z o.o. (Map of railroad events as an innovative project supporting safety management system of the regional carrier Koleje Ślaskie sp. z o.o.),” 2022
2022
Closest in time.
A. Glos, A. Krawiec, and Z. Zimborás, “Space-efficient binary optimization for variational quantum computing,” npj Quantum Information
2022
Closest in time.
Ö. Salehi, A. Glos, and J. A. Miszczak, “Unconstrained binary models of the travelling salesman problem variants for quantum optimization,” Quantum Information Processing
2022
Closest in time.