Branch and bound algorithms for solving the multi-commodity capacitated multi-facility Weber problem.
M. Hakan AkyüzTemel ÖncanI. Kuban AltinelPublished in: Ann. Oper. Res. (2019)
Keyphrases
- multi commodity
- branch and bound algorithm
- network flow problem
- heuristic solution
- facility location
- branch and bound
- lower bound
- np hard
- facility location problem
- network design problem
- combinatorial optimization
- lagrangian relaxation
- max min
- optimal solution
- finding an optimal solution
- minimum cost
- transportation costs
- upper bound
- network flow
- minimal cost
- mixed integer
- search algorithm
- integer programming
- simulated annealing
- haplotype inference
- network design
- np complete
- search space
- lower and upper bounds
- boolean satisfiability
- min max
- worst case
- scheduling problem
- special case
- evolutionary algorithm
- exact solution
- exact methods
- vehicle routing problem
- knapsack problem
- traveling salesman problem
- genetic algorithm