A branch-and-price algorithm for the multi-source Weber problem
by Giovanni Righini, Luca Zaniboni
International Journal of Operational Research (IJOR), Vol. 2, No. 2, 2007

Abstract: We present a branch-and-price algorithm for the exact solution of the multi-source Weber problem, a classical NP-hard optimisation problem in location science with binary variables and non-linear objective. The algorithm is based on a set covering reformulation whose linear relaxation is solved via column generation at every node of a search tree. The pricing subproblem is equivalent to a single-source Weber problem with limited distances. The algorithm solved to optimality several previously unsolved instances with some thousands of points and some hundreds of sources. Computational experiments show that the algorithm is particularly effective at solving instances in which the ratio between the number of sources and the number of points is high.

Online publication date: Wed, 14-Feb-2007

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com