Giacomo Nannicini

Bidirectional A* Search on Time-Dependent Road Networks

  • Daniel Delling
  • Leo Liberti
  • Giacomo Nannicini
  • Dominik Schultes
    • Categories Network Optimization Tags , , ,

    The computation of point-to-point shortest paths on time-dependent road networks has a large practical interest, but very few works propose efficient algorithms for this problem. We propose a novel approach which tackles one of the main complications of route planning in time-dependent graphs, which is the difficulty of using bidirectional search: since the exact arrival … Read more

    Improved strategies for branching on general disjunctions

  • Gérard Cornuéjols
  • Leo Liberti
  • Giacomo Nannicini
    • Categories (Mixed) Integer Linear Programming, Branch and Cut Algorithms Tags , ,

    Within the context of solving Mixed-Integer Linear Programs by a Branch-and-Cut algorithm, we propose a new strategy for branching. Computational experiments show that, on the majority of our test instances, this approach enumerates fewer nodes than traditional branching. On average, on instances that contain both integer and continuous variables the number of nodes in the … Read more