Search results for "facility location problems"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Guy E. Blelloch, Kanat Tangwongsan	Parallel approximation algorithms for facility-location problems.	SPAA	2010	DBLP DOI BibTeX RDF	parallel algorithms, approximation algorithms, facility location problems
2	Mohammad Khairul Hasan, Hyunwoo Jung, Kyung-Yong Chwa	Approximation algorithms for connected facility location problems.	J. Comb. Optim.	2008	DBLP DOI BibTeX RDF	Approximation algorithms, Integer programming, Steiner tree, LP-rounding, Connected facility location
2	Wei-Lin Li, Peng Zhang, Daming Zhu	On Constrained Facility Location Problems.	J. Comput. Sci. Technol.	2008	DBLP DOI BibTeX RDF	approximation hardness, approximation algorithm, local search, Facility Location
2	Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Rothvoß, Guido Schäfer	Approximating connected facility location problems via random facility sampling and core detouring.	SODA	2008	DBLP DOI BibTeX RDF
2	Mohammad Khairul Hasan, Hyunwoo Jung, Kyung-Yong Chwa	Improved Approximation Algorithm for Connected Facility Location Problems.	COCOA	2007	DBLP DOI BibTeX RDF
2	Davide Bilò, Jörg Derungs, Luciano Gualà, Guido Proietti, Peter Widmayer	Locating Facilities on a Network to Minimize Their Average Service Radius.	ISAAC	2007	DBLP DOI BibTeX RDF	Graph radius, Graph treewidth, NP-hardness, Graph partition, Facility location problems
2	Kit Yan Chan, Mehmet Emin Aydin, Terence C. Fogarty	Main Effect Fine-tuning of the Mutation Operator and the Neighbourhood Function for Uncapacitated Facility Location Problems.	Soft Comput.	2006	DBLP DOI BibTeX RDF	Uncapacitated facility location problem, Main effect, Genetic algorithm, Simulated annealing, Mutation rate
2	Guido Proietti, Peter Widmayer	Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii.	ISAAC	2006	DBLP DOI BibTeX RDF	Clustering problems, Graph radius, NP-hardness, Graph partition, Facility location problems
2	Kamal Jain, Mohammad Mahdian, Amin Saberi	A new greedy approach for facility location problems.	STOC	2002	DBLP DOI BibTeX RDF
2	Vijay Arya, Naveen Garg, Rohit Khandekar, Adam Meyerson, Kamesh Munagala, Vinayaka Pandit	Local search heuristic for k-median and facility location problems.	STOC	2001	DBLP DOI BibTeX RDF
2	David B. Shmoys	Approximation algorithms for facility location problems.	APPROX	2000	DBLP DOI BibTeX RDF
1	Shuming Wang, Junzo Watada	A hybrid modified PSO approach to VaR-based facility location problems with variable capacity in fuzzy random uncertainty.	Inf. Sci.	2012	DBLP DOI BibTeX RDF
1	Zachary Friggstad, Mohammad R. Salavatipour	Minimizing movement in mobile facility location problems.	ACM Transactions on Algorithms	2011	DBLP DOI BibTeX RDF
1	Michael R. Fellows, Henning Fernau	Facility location problems: A parameterized view.	Discrete Applied Mathematics	2011	DBLP DOI BibTeX RDF
1	Haluk Yapicioglu, Alice E. Smith	Disservice representation using the Gini coefficient in semi-desirable facility location problems.	IEEE Congress on Evolutionary Computation	2011	DBLP DOI BibTeX RDF
1	Sergio Cabello, José Miguel Díaz-Báñez, Stefan Langerman, Carlos Seara, Inmaculada Ventura	Facility location problems in the plane based on reverse nearest neighbor queries.	European Journal of Operational Research	2010	DBLP DOI BibTeX RDF
1	Anita Schöbel, Daniel Scholz	The big cube small cube solution method for multidimensional facility location problems.	Computers & OR	2010	DBLP DOI BibTeX RDF
1	Jaroslaw Byrka, MohammadReza Ghodsi, Aravind Srinivasan	LP-rounding algorithms for facility-location problems	CoRR	2010	DBLP BibTeX RDF
1	Guy E. Blelloch, Kanat Tangwongsan	Parallel Approximation Algorithms for Facility-Location Problems	CoRR	2010	DBLP BibTeX RDF
1	Shuming Wang, Junzo Watada, Witold Pedrycz	Recourse-Based Facility-Location Problems in Hybrid Uncertain Environment.	IEEE Transactions on Systems, Man, and Cybernetics, Part B	2010	DBLP DOI BibTeX RDF
1	Tomohiko Kawamori, Kazuo Yamaguchi	Outcomes of bargaining and planning in single facility location problems.	Mathematical Social Sciences	2010	DBLP DOI BibTeX RDF
1	R. Ravi, Amitabh Sinha	Approximation Algorithms for Multicommodity Facility Location Problems.	SIAM J. Discrete Math.	2010	DBLP DOI BibTeX RDF
1	Li Xia, Wenjun Yin, Jin Dong, T. Wu, Ming Xie, Yanjia Zhao	A Hybrid Nested Partitions Algorithm for Banking Facility Location Problems.	IEEE T. Automation Science and Engineering	2010	DBLP DOI BibTeX RDF
1	Maurizio Boccia, Antonio Sforza, Claudio Sterle	Flow Intercepting Facility Location: Problems, Models and Heuristics.	J. Math. Model. Algorithms	2009	DBLP DOI BibTeX RDF
1	Robert Benkoczi, Binay K. Bhattacharya, Arie Tamir	Collection depots facility location problems in trees.	Networks	2009	DBLP DOI BibTeX RDF
1	Binay K. Bhattacharya, Qiaosheng Shi, Arie Tamir	Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees.	Algorithmica	2009	DBLP DOI BibTeX RDF
1	Shuming Wang, Junzo Watada, Witold Pedrycz	Value-at-Risk-Based Two-Stage Fuzzy Facility Location Problems.	IEEE Trans. Industrial Informatics	2009	DBLP DOI BibTeX RDF
1	Pasquale Avella, Maurizio Boccia, Antonio Sforza, Igor Vasil'ev	An effective heuristic for large-scale capacitated facility location problems.	J. Heuristics	2009	DBLP DOI BibTeX RDF
1	A. Jourani, C. Michelot, Malick Ndiaye	Efficiency for continuous facility location problems with attraction and repulsion.	Annals OR	2009	DBLP DOI BibTeX RDF
1	Justo Puerto, Federica Ricca, Andrea Scozzari	Extensive facility location problems on networks with equity measures.	Discrete Applied Mathematics	2009	DBLP DOI BibTeX RDF
1	M. Caserta, E. Quiñonez Rico	A cross entropy-based metaheuristic algorithm for large-scale capacitated facility location problems.	JORS	2009	DBLP DOI BibTeX RDF
1	Kaj Holmberg	Facility Location Problems with Spatial Interaction.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Dual ascent, Integer programming, Location, Spatial interaction
1	Shuming Wang, Junzo Watada, Witold Pedrycz	Fuzzy Random Facility Location Problems with Recourse.	SMC	2009	DBLP DOI BibTeX RDF
1	Lin-Yu Tseng, Chih-Sheng Wu	Multiple Trajectory Search for Uncapacitated Facility Location Problems.	CSO	2009	DBLP DOI BibTeX RDF
1	MohammadHossein Bateni, MohammadTaghi Hajiaghayi	Assignment problem in content distribution networks: unsplittable hard-capacitated facility location.	SODA	2009	DBLP DOI BibTeX RDF
1	Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko	Non-monotone submodular maximization under matroid and knapsack constraints.	STOC	2009	DBLP DOI BibTeX RDF	approximation algorithms, matroids, knapsacks, submodular functions
1	Yam Ki Cheung, Ovidiu Daescu	Line Segment Facility Location in Weighted Subdivisions.	AAIM	2009	DBLP DOI BibTeX RDF
1	Uriel Feige, Nicole Immorlica, Vahab S. Mirrokni, Hamid Nazerzadeh	PASS Approximation.	APPROX-RANDOM	2009	DBLP DOI BibTeX RDF
1	Mark de Berg, Sergio Cabello, Sariel Har-Peled	Covering Many or Few Points with Unit Disks.	Theory Comput. Syst.	2009	DBLP DOI BibTeX RDF	Weighted points, Facility location, Random sample, Geometric optimization
1	Kokichi Sugihara	Voronoi Diagrams in Facility Location.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Farthest-point Voronoi diagram, Largest empty circle, Smallest enclosing circle, L1-distance, L?-distance, Lp-distance, Elliptic distance, Manhattan distance, Voronoi diagram, Convex hull, Facility location
1	Michael R. Fellows, Henning Fernau	Facility Location Problems: A Parameterized View.	AAIM	2008	DBLP DOI BibTeX RDF
1	Zachary Friggstad, Mohammad R. Salavatipour	Minimizing Movement in Mobile Facility Location Problems.	FOCS	2008	DBLP DOI BibTeX RDF
1	Barbara M. Anthony, Vineet Goyal, Anupam Gupta, Viswanath Nagarajan	A plant location guide for the unsure.	SODA	2008	DBLP DOI BibTeX RDF
1	Jens Maßberg, Jens Vygen	Approximation algorithms for a facility location problem with service capacities.	ACM Transactions on Algorithms	2008	DBLP DOI BibTeX RDF	Approximation algorithm, network design, VLSI design, facility location
1	Yam Ki Cheung, Ovidiu Daescu	Line Facility Location in Weighted Regions.	AAIM	2008	DBLP DOI BibTeX RDF
1	Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, Mohammad R. Salavatipour	Two-Stage Robust Network Design with Exponential Scenarios.	ESA	2008	DBLP DOI BibTeX RDF
1	Martin Hoefer	Competitive Cost Sharing with Economies of Scale.	LATIN	2008	DBLP DOI BibTeX RDF
1	Ronald Hochreiter, Georg Ch. Pflug	Financial scenario generation for stochastic multi-stage decision processes as facility location problems.	Annals OR	2007	DBLP DOI BibTeX RDF	Multi-stage financial scenario generation, Stochastic programming
1	Marcos Colebrook, Joaquin Sicilia	Undesirable facility location problems on multicriteria networks.	Computers & OR	2007	DBLP DOI BibTeX RDF
1	Uriel Feige, Vahab S. Mirrokni, Jan Vondrák	Maximizing Non-Monotone Submodular Functions.	FOCS	2007	DBLP DOI BibTeX RDF
1	Kurt DeMaagd, Scott Moore	Using Classifiers to Solve Warehouse Location Problems.	HICSS	2007	DBLP DOI BibTeX RDF
1	Christian Frank, Kay Römer	Distributed Facility Location Algorithms for Flexible Configuration of Wireless Sensor Networks.	DCOSS	2007	DBLP DOI BibTeX RDF
1	Adriana Felicia Gabor, Jan-Kees C. W. van Ommeren	Approximation algorithms for facility location problems with a special class of subadditive cost functions.	Theor. Comput. Sci.	2006	DBLP DOI BibTeX RDF
1	Mohammad Mahdian, Yinyu Ye, Jiawei Zhang	Approximation Algorithms for Metric Facility Location Problems.	SIAM J. Comput.	2006	DBLP DOI BibTeX RDF
1	Krista Rizman Zalik	Fuzzy C-means clustering and facility location problems.	Artificial Intelligence and Soft Computing	2006	DBLP BibTeX RDF
1	Binay K. Bhattacharya, Yuzhuang Hu, Qiaosheng Shi, Arie Tamir	Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees.	ISAAC	2006	DBLP DOI BibTeX RDF
1	Helmut Alt, Esther M. Arkin, Hervé Brönnimann, Jeff Erickson, Sándor P. Fekete, Christian Knauer, Jonathan Lenchner, Joseph S. B. Mitchell, Kim Whittlesey	Minimum-cost coverage of point sets by disks.	Symposium on Computational Geometry	2006	DBLP DOI BibTeX RDF	tour problems, complexity, approximation, geometric optimization, covering problems
1	David B. Shmoys, Chaitanya Swamy	An approximation scheme for stochastic linear programming and its application to stochastic integer programs.	J. ACM	2006	DBLP DOI BibTeX RDF	Approximation algorithms, randomized algorithms, convex optimization
1	Dan Feldman, Amos Fiat, Micha Sharir	Coresets forWeighted Facilities and Their Applications.	FOCS	2006	DBLP DOI BibTeX RDF
1	Rudolf Fleischer, Jian Li, Shijun Tian, Hong Zhu	Non-metric Multicommodity and Multilevel Facility Location.	AAIM	2006	DBLP DOI BibTeX RDF
1	Martin Hoefer	Non-cooperative Facility Location and Covering Games.	ISAAC	2006	DBLP DOI BibTeX RDF
1	Mark de Berg, Sergio Cabello, Sariel Har-Peled	Covering Many or Few Points with Unit Disks.	WAOA	2006	DBLP DOI BibTeX RDF
1	Jiawei Zhang	Approximating the two-level facility location problem via a quasi-greedy approach.	Math. Program.	2006	DBLP DOI BibTeX RDF	Two-level facility location, Quasi-greedy approach, Approximation algorithm, Linear programming relaxation
1	Francisco Barahona, Fabián A. Chudak	Near-optimal solutions to large-scale facility location problems.	Discrete Optimization	2005	DBLP DOI BibTeX RDF
1	Igor Averbakh, Sergey Bereg	Facility location problems with uncertainty on the plane.	Discrete Optimization	2005	DBLP DOI BibTeX RDF
1	Fabián A. Chudak, David P. Williamson	Improved approximation algorithms for capacitated facility location problems.	Math. Program.	2005	DBLP DOI BibTeX RDF
1	Moses Charikar, Sudipto Guha	Improved Combinatorial Algorithms for Facility Location Problems.	SIAM J. Comput.	2005	DBLP DOI BibTeX RDF
1	Sergio Cabello, José Miguel Díaz-Báñez, Stefan Langerman, Carlos Seara, Inmaculada Ventura	Reverse facility location problems.	CCCG	2005	DBLP BibTeX RDF
1	Guido Proietti, Peter Widmayer	A truthful mechanism for the non-utilitarian minimum radius spanning tree problem.	SPAA	2005	DBLP DOI BibTeX RDF	pricing and equilibria in networks, algorithmic mechanism design, selfish agents, truthful mechanisms
1	Wenqiang Dai, Peng Xiao, Ke Jiang	Facility Location in a Global View.	AAIM	2005	DBLP DOI BibTeX RDF
1	Jens Maßberg, Jens Vygen	Approximation Algorithms for Network Design and Facility Location with Service Capacities.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
1	Patricia Domínguez-Marín, Stefan Nickel, Pierre Hansen, Nenad Mladenovic	Heuristic Procedures for Solving the Discrete Ordered Median Problem.	Annals OR	2005	DBLP DOI BibTeX RDF	discrete facility location, genetic algorithms, variable neighborhood search
1	Arie Tamir	Sorting weighted distances with applications to objective function evaluations in single facility location problems.	Oper. Res. Lett.	2004	DBLP DOI BibTeX RDF
1	Chaitanya Swamy, Amit Kumar	Primal-Dual Algorithms for Connected Facility Location Problems.	Algorithmica	2004	DBLP DOI BibTeX RDF	Approximation algorithms, Steiner trees, Facility location, Primal-dual algorithms, Connected facility location
1	Zvi Drezner, Atsuo Suzuki	The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems.	Operations Research	2004	DBLP DOI BibTeX RDF
1	Yuri Levin, Adi Ben-Israel	A heuristic method for large-scale multi-facility location problems.	Computers & OR	2004	DBLP DOI BibTeX RDF
1	Vijay Arya, Naveen Garg, Rohit Khandekar, Adam Meyerson, Kamesh Munagala, Vinayaka Pandit	Local Search Heuristics for k-Median and Facility Location Problems.	SIAM J. Comput.	2004	DBLP DOI BibTeX RDF
1	Jiawei Zhang	Approximating the two-level facility location problem via a quasi-greedy approach.	SODA	2004	DBLP DOI BibTeX RDF
1	Dirk Koschützki, Katharina Anna Lehmann, Leon Peeters, Stefan Richter, Dagmar Tenfelde-Podehl, Oliver Zlotowski	Centrality Indices.	Network Analysis	2004	DBLP DOI BibTeX RDF
1	Retsef Levi, David B. Shmoys, Chaitanya Swamy	LP-based Approximation Algorithms for Capacitated Facility Location.	IPCO	2004	DBLP DOI BibTeX RDF
1	Spyros Angelopoulos, Allan Borodin	The Power of Priority Algorithms for Facility Location and Set Cover.	Algorithmica	2004	DBLP DOI BibTeX RDF	Approximation lower bounds, Greedy algorithms
1	Adam Cannon, Lenore Cowen	Approximation Algorithms for the Class Cover Problem.	Ann. Math. Artif. Intell.	2004	DBLP DOI BibTeX RDF	disk cover, margin classifier, classification, approximation algorithms, set cover
1	Igor Averbakh	Complexity of Robust Single Facility Location Problems on Networks with Uncertain Edge Lengths.	Discrete Applied Mathematics	2003	DBLP DOI BibTeX RDF
1	C. Greg Plaxton	Approximation algorithms for hierarchical location problems.	STOC	2003	DBLP DOI BibTeX RDF	discrete location theory, hierarchical clustering
1	Alexander A. Ageev	Improved approximation algorithms for multilevel facility location problems.	Oper. Res. Lett.	2002	DBLP DOI BibTeX RDF
1	Richard L. Francis, Timothy J. Lowe, Arie Tamir	Worst-case incremental analysis for a class of p-facility location problems.	Networks	2002	DBLP DOI BibTeX RDF
1	Alexander A. Ageev	Improved Approximation Algorithms for Multilevel Facility Location Problems.	APPROX	2002	DBLP DOI BibTeX RDF
1	Chaitanya Swamy, Amit Kumar	Primal-Dual Algorithms for Connected Facility Location Problems.	APPROX	2002	DBLP DOI BibTeX RDF
1	Mohammad Mahdian, Yinyu Ye, Jiawei Zhang	Improved Approximation Algorithms for Metric Facility Location Problems.	APPROX	2002	DBLP DOI BibTeX RDF
1	Marta Indulska, Maria E. Orlowska	Spatial Clustering for Facility Location Problems.	ISDB	2002	DBLP BibTeX RDF
1	Prosenjit Bose, Qingda Wang	Facility Location Constrained to a Polygonal Domain.	LATIN	2002	DBLP DOI BibTeX RDF
1	Piotr Krysta, Roberto Solis-Oba	Approximation Algorithms for Bounded Facility Location Problems.	J. Comb. Optim.	2001	DBLP DOI BibTeX RDF
1	Moses Charikar, Samir Khuller, David M. Mount, Giri Narasimhan	Algorithms for facility location problems with outliers.	SODA	2001	DBLP DOI BibTeX RDF
1	Boaz Ben-Moshe, Matthew J. Katz, Joseph S. B. Mitchell	Farthest neighbors and center points in the presence of rectangular obstacles.	Symposium on Computational Geometry	2001	DBLP DOI BibTeX RDF
1	Mikkel Thorup	Quick k-Median, k-Center, and Facility Location for Sparse Graphs.	ICALP	2001	DBLP DOI BibTeX RDF
1	Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman	Analysis of a Local Search Heuristic for Facility Location Problems.	J. Algorithms	2000	DBLP DOI BibTeX RDF
1	Kaj Holmberg, Mikael Rönnqvist, Di Yuan	An exact algorithm for the capacitated facility location problems with single sourcing.	European Journal of Operational Research	1999	DBLP DOI BibTeX RDF
1	Fabián A. Chudak, David P. Williamson	Improved Approximation Algorithms for Capacitated Facility Location Problems.	IPCO	1999	DBLP DOI BibTeX RDF
1	Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman	Analysis of a Local Search Heuristic for Facility Location Problems.	SODA	1998	DBLP DOI BibTeX RDF
1	Koji Nakano, Stephan Olariu	An Efficient Algorithm for Row Minima Computations on Basic Reconfigurable Meshes.	IEEE Trans. Parallel Distrib. Syst.	1998	DBLP DOI BibTeX RDF	Monotone matrices, totally monotone matrices, row minima, basic reconfigurable meshes, cellular system design, VLSI design, search problems, reconfigurable meshes, facility location problems