نتایج جستجو برای: capacitated location

تعداد نتایج: 227859  

Journal: :EURO Journal on Transportation and Logistics 2018

2008
Ting Hu Yuanzhu Peter Chen Wolfgang Banzhaf

IEEE 802.16, also known as WiMAX (Worldwide Inter-operability for Microwave Access), is a new wireless access technology for current increasing demand of wireless high-speed broadband service. Efficient and effective deployment of such a network to service an area of users with certain traffic demands is an important network planning problem. This network planning can be formulated in a similar...

Journal: :Transportation Science 2013
Tobias Harks Felix G. König Jannik Matuschke

A approximation algorithm for an optimization problem runs in polynomial time for all instances and is guaranteed to deliver solutions with bounded optimality gap. We derive such algorithms for different variants of capacitated location routing, an important generalization of vehicle routing where the cost of opening the depots from which vehicles operate is taken into account. Our results orig...

2016
Shi Li

In this paper, we study the uniform capacitated k-median problem. In the problem, we are given a set F of potential facility locations, a set C of clients, a metric d over F ∪ C, an upper bound k on the number of facilities we can open and an upper bound u on the number of clients each facility can serve. We need to open a subset S ⊆ F of k facilities and connect clients in C to facilities in S...

2009
WEN-CHEN LEE NENG-SHU YANG

Location problems have been the focus of considerable attention both in research and practice for many years. Numerous extensions have been described to broaden its appeal and enhance its applicability. This study proposes a spreadsheet approach for three well-known facility location problems, the p-median problem (PMP), capacitated p-median (CPMP), and maximal covering location problem (MCLP)....

2009
Donglei Du Xing Wang Dachuan Xu

In this paper, we consider k-level hard capacitated facility location problem.

2006
João C. Teixeira António P. Antunes Joaquim J. Júdice Pedro C. Martins

It is well known that choosing a good formulation for a mixed-integer optimization model can drastically reduce its solution time with a linear-programming based branch-and-bound algorithm. Integer optimization software such as CPLEX and XPRESS-MP has progressed rapidly in recent years and implements powerful branchand-cut algorithms, combining branch-and-bound with cutting plane generation. In...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید