A branch-and-bound algorithm for the supply connected location-allocation problem on networks

Author： Yesilkokcen G.N.   Wesolowsky G.O.  

Publisher： Elsevier

ISSN： 0966-8349

Source： Location Science, Vol.6, Iss.1, 1998-05, pp. : 395-415

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

A branch-and-bound algorithm to minimise the sum of maximum earliness and tardiness in the single machine

By Moslehi Ghasem   Mahnam Mehdi   Amin-Nayeri Majid   Azaron Amir  

International Journal of Operational Research, Vol. 8, Iss. 4, 2010-07 ,pp. : 458-482

Inderscience Publishers

Access to resources Recommend Favorite

Optimum process plan selection via branch-and-bound algorithm in an automated manufacturing environment

By Solimanpur Maghsud   Sattari Hossein   Abazari Amir Musa  

International Journal of Operational Research, Vol. 13, Iss. 3, 2012-02 ,pp. : 281-294

Inderscience Publishers

Access to resources Recommend Favorite

Parallel branch-and-bound and parallel PSO algorithms for job shop scheduling problem with blocking

By AitZai Abdelhakim   Boudhar Mourad  

International Journal of Operational Research, Vol. 16, Iss. 1, 2013-11 ,pp. : 14-37

Inderscience Publishers

Access to resources Recommend Favorite

Capacitated service and regional constraints in location-allocation modeling

By Murray A.T.   Gerrard R.A.  

Location Science, Vol. 5, Iss. 2, 1997-08 ,pp. : 103-118

Elsevier

Access to resources Recommend Favorite

A branch-and-price algorithm for the multi-source Weber problem

By Righini Giovanni   Zaniboni Luca  

International Journal of Operational Research, Vol. 2, Iss. 2, 2007-02 ,pp. : 188-207

Inderscience Publishers

Access to resources Recommend Favorite