Stefan Hougardy

Speaker

• The k-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \geq 5$

  FA245 — TSP and vehicle routing
  26 Jul 2024 08:30 — Parallel Session

Chair

• FA245 — TSP and vehicle routing

  26 Jul 2024 08:30 — Parallel Session

Co-author

• Decision-guided SAT for hard routing problems

  ThB244 — Advanced algorithms for chip design
  25 Jul 2024 14:00 — Parallel Session