pith. sign in

← back to paper

Review history

arxiv: 2603.21880 · 2 revisions

Optimal Solutions for the Moving Target Vehicle Routing Problem with Obstacles via Lazy Branch and Price

  1. 2026-05-25 UNVERDICTED LOW v0.9.0 novelty 7.0
    29012 ms 5820 in 1055 out 2026-05-25T07:00:15.436238+00:00
  2. 2026-05-15 UNVERDICTED LOW v0.9.0 novelty 6.0
    52999 ms 5589 in 1068 out 2026-05-15T01:03:20.446219+00:00