Sequential location of two facilities: comparing random to optimal location of the first facility
type: Item
instance of: scholarly article
title: Sequential location of two facilities: comparing random to optimal location of the first facility
zbMATH Open document ID: 1357.90080
author: Tammy Drezner
author: Zvi Drezner
published in: Annals of Operations Research
publication date: 2017-03-03T00:00:00Z
Mathematics Subject Classification ID: 90B85
zbMATH DE Number: 6691348
zbMATH Keywords: facility location
zbMATH Keywords: p-median
zbMATH Keywords: p-center
zbMATH Keywords: competitive
MaRDI profile type: Publication
full work available at URL: s10479-014-1699-y
OpenAlex ID: W2086630717
cites work: Q3331506
cites work: LARGE-SCALE SINGLE FACILITY CONTINUOUS LOCATION BY D.C. OPTIMIZATION
cites work: Q4695785
cites work: A new formulation for the conditional \(p\)-median and \(p\)-center problems
cites work: Technical Note—Conditional Location Problems on Networks
cites work: Continuous location problems and big triangle small triangle: Constructing better bounds
cites work: Solution of the multisource Weber and conditional Weber problems by d. -c. programming
cites work: Location-Allocation Problems
cites work: Heuristic Methods for Location-Allocation Problems
cites work: Q3147658
cites work: Dynamic facility location when the total number of facilities is uncertain: A decision analysis approach
cites work: Dynamic facility location: The progressive p-median problem
cites work: A note on accelerating the weiszfeld procedure
cites work: Finding a cluster of points and the grey pattern quadratic assignment problem
cites work: A general global optimization approach for solving location problems in the plane
cites work: The fortified Weiszfeld algorithm for solving the Weber problem
cites work: Q3147656
cites work: The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
cites work: Q3987788
cites work: Sequential location problems
cites work: Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
cites work: Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
cites work: On functions representable as a difference of convex functions
cites work: On solving a d.c. programming problem by a sequence of linear programs
cites work: An Algorithmic Approach to Network Location Problems. I: Thep-Centers
cites work: An Algorithmic Approach to Network Location Problems. II: Thep-Medians
cites work: A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
cites work: Q4321558
cites work: Q4311915
cites work: Q4003558
cites work: Q4484914
cites work: GBSSS: The generalized big square small square method for planar single- facility location
cites work: AVOIDING CANNIBALISATION AND/OR COMPETITOR REACTION IN PLANAR SINGLE FACILITY LOCATION
cites work: The big cube small cube solution method for multidimensional facility location problems
cites work: Q4610958
cites work: The p-center location problem in an area
cites work: New approaches to circle packing in a square. With program codes.
cites work: Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models
cites work: A d.c. optimization method for single facility location problems
cites work: On the point for which the sum of the distances to \(n\) given points is minimum
DOI: 10.1007/S10479-014-1699-Y
description: scientific article; zbMATH DE number 6691348