Abstract
AbstractWe present two parallel branch-and-bound algorithms for the multicommodity location problem with balancing requirements. The first algorithm implements a master-slave approach in order to perform a parallel exploration of the search tree. The second algorithm decomposes the problem in order to compute the lower bounds in parallel. We realized implementations of these algorithms on a PC-based network of Transputers. Experimental results are reported and analyzed.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
