Quadratic and higher-order unconstrained binary optimization of railway rescheduling for quantum computing

DOI10.1007/s11128-022-03670-yOpenAlexW4297997184MaRDI QIDQ2104772

Akash Kundu, Krzysztof Krawiec, Krzysztof Domino, Özlem Salehi

Publication date: 7 December 2022

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2107.03234

zbMATH Keywords

D-wave annealerhigher-order binary optimizationquantum-classical hybrid procedurerailway reroutingrailway rescheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Quantum computation (81P68) Boolean programming (90C09)

Related Items (1)

High-speed train timetable optimization based on space-time network model and quantum simulator

Uses Software

• Cbc
• PuLP

Cites Work

• Unnamed Item
• Unnamed Item
• Pseudo-Boolean optimization
• Scheduling trains as a blocking parallel-machine job shop scheduling problem
• Approaches to modeling train scheduling problems as job-shop problems with blocking constraints
• Quantum stochastic optimization
• NP-hardness of shop-scheduling problems with three jobs
• Unconstrained binary models of the travelling salesman problem variants for quantum optimization
• Polynomial unconstrained binary optimisation -- part 1
• A branch and bound algorithm for scheduling trains in a railway network
• A Survey of Optimization Models for Train Routing and Scheduling
• Scheduling
• Quantum bridge analytics. I: A tutorial on formulating and using QUBO models

This page was built for publication: Quadratic and higher-order unconstrained binary optimization of railway rescheduling for quantum computing