Skip to content

Author

T. Bektaş

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Jul 2026

Sequence and Speed Optimization

Two polynomial-time algorithms for the SOP, one to solve the SOP and another to compute all possible completion times for a sequence, along with proofs of optimality, and a branch-and-price algorithm, incorporating a new dominance rule, for the joint routing and speed optimization problem.

Stefan Schaudt, T. Bektaş · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.