Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem.
M. Hakan AkyüzI. Kuban AltinelTemel ÖncanPublished in: Ann. Oper. Res. (2014)
Keyphrases
- branch and bound algorithm
- multi source
- facility location problem
- multi commodity
- facility location
- lower bound
- np hard
- branch and bound
- heuristic solution
- single facility
- lagrangian relaxation
- approximation algorithms
- randomly generated
- optimal solution
- upper bound
- combinatorial optimization
- network design problem
- set covering problem
- information fusion
- data fusion
- search tree
- boolean satisfiability
- variable ordering
- finding an optimal solution
- max sat
- data sources
- search algorithm
- integer programming
- column generation
- lot sizing
- network flow problem
- vehicle routing problem
- multiple sources
- sat solvers
- haplotype inference
- genetic algorithm