Sciweavers

62 search results - page 3 / 13
» Solving the Uncapacitated Facility Location Problem Using Me...
Sort
View
IPCO
2001
166views Optimization» more  IPCO 2001»
13 years 7 months ago
Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation
Garg [10] gives two approximation algorithms for the minimum-cost tree spanning k vertices in an undirected graph. Recently Jain and Vazirani [16] discovered primal-dual approxima...
Fabián A. Chudak, Tim Roughgarden, David P....
JMLR
2012
11 years 8 months ago
Message-Passing Algorithms for MAP Estimation Using DC Programming
We address the problem of finding the most likely assignment or MAP estimation in a Markov random field. We analyze the linear programming formulation of MAP through the lens of...
Akshat Kumar, Shlomo Zilberstein, Marc Toussaint
AI
2009
Springer
14 years 16 days ago
STFLS: A Heuristic Method for Static and Transportation Facility Location Allocation in Large Spatial Datasets
Abstract. This paper solves a static and transportation facility location allocation problem defined as follows: given a set of locations Loc and a set of demand objects D located ...
Wei Gu, Xin Wang, Liqiang Geng
EOR
2006
76views more  EOR 2006»
13 years 6 months ago
Load balancing and capacity constraints in a hierarchical location model
Recent work on the location of perinatal facilities in the municipality of Rio de Janeiro resulted in the development of an uncapacitated, three-level hierarchical model. An impor...
Roberto D. Galvão, Luis Gonzalo Acosta Espe...
DCOSS
2005
Springer
13 years 11 months ago
A Local Facility Location Algorithm for Sensor Networks
In this paper we address a well-known facility location problem (FLP) in a sensor network environment. The problem deals with finding the optimal way to provide service to a (poss...
Denis Krivitski, Assaf Schuster, Ran Wolff