A depth-first branch-and-bound algorithm for geocoding historic itinerary tables.
Daniel BlankAndreas HenrichPublished in: GIR (2016)
Keyphrases
- branch and bound algorithm
- branch and bound
- search tree
- lower bound
- search algorithm
- upper bound
- optimal solution
- test problems
- search space
- randomly generated problems
- combinatorial optimization
- column generation
- np hard
- tree search
- lower bounding
- mixed integer linear programming
- variable ordering
- search strategy
- single machine scheduling problem
- lagrangian relaxation
- upper bounding
- branch and bound method
- precedence constraints
- max sat
- finding an optimal solution
- network design problem
- maximum clique