Comparison of exact algorithms for rectilinear distance single-source Capacitated multi-facility Weber problems.: An article from: Journal of Computer Science

This digital document is an article from Journal of Computer Science, published by Science Publications on February 1, 2010. The length of the article is 3431 words. The page length shown above is based on a typical 300-word page. The article is delivered in HTML format and is available immediately after purchase. You can view it with any web browser.

From the author: Key words: Location-allocation problem, decomposition algorithms, mixed integer programming

Citation Details
Title: Comparison of exact algorithms for rectilinear distance single-source Capacitated multi-facility Weber problems.
Author: Chansiri Singhtaun
Publication:Journal of Computer Science (Magazine/Journal)
Date: February 1, 2010
Publisher: Science Publications
Volume: 6 Issue: 2 Page: 112(5)

Distributed by Gale, a part of Cengage Learning