//
sign in
Post
by @danabra.mov
PostEmbed
by @danabra.mov
Record
by @jimpick.com
Record
by @atsui.org
+ new component
Post
Real- world railway scheduling problem can be reformulated as a a graph optimization and solved by hybrid quantum-classical methods. arxiv.org/abs/2606.11383
1d
Rolling stock planning is a complex optimization problem in railway management that involves assigning physical trains to scheduled trips while minimizing operational costs. In this work, we address a...
arxiv.org
Rolling Stock Planning Using the Quantum Approximate Optimization Algorithm
The Hilbert Space Post