Free Access

Note—On a Modified One-Center Model

Zvi Drezner
Zvi Drezner
University of Michigan-Dearborn
Search for more papers by this author

Zvi Drezner

University of Michigan-Dearborn

Search for more papers by this author

Published Online:1 Jul 1981https://doi.org/10.1287/mnsc.27.7.848

Cited by
- Competitive location models: A review
  European Journal of Operational Research, Vol. 316, No. 1
- Continuous Facility Location Problems
  8 July 2022
- New exact algorithms for planar maximum covering location by ellipses problems
  European Journal of Operational Research, Vol. 291, No. 1
- Unified Polynomial Dynamic Programming Algorithms for P-Center Variants in a 2D Pareto Front
  23 February 2021 | Mathematics, Vol. 9, No. 4
- Covering problems with polyellipsoids: A location analysis perspective
  European Journal of Operational Research, Vol. 289, No. 1
- Stability of utility functions and apportionment rules in location models
  31 May 2020 | TOP, Vol. 28, No. 3
- A Memetic Algorithm for Competitive Facility Location Problems
  31 May 2019
- Topological Stability of Kinetic k-centers
  21 December 2018
- My Career and Contributions
  8 October 2019
- Cover-Based Competitive Location Models
  8 October 2019
- Continuous Location Problems
  8 October 2019
- Competitive Location Models
  17 March 2020
- Covering Location Problems
  17 March 2020
- The Most Points Connected-Covering Problem with Two Disks
  11 June 2018 | Theory of Computing Systems, Vol. 62, No. 8
- Territorial design optimization for business sales plan
  Journal of Computational and Applied Mathematics, Vol. 340
- Near-linear time approximation schemes for geometric maximum coverage
  Theoretical Computer Science, Vol. 725
- Territorial Design Optimization for Business Sales Plan
  3 January 2018
- A hybrid artificial bee colony algorithm for the cooperative maximum covering location problem
  7 December 2015 | International Journal of Machine Learning and Cybernetics, Vol. 8, No. 2
- Iterative Projection approach for solving the Territorial Business Sales optimization problem
  Procedia Computer Science, Vol. 122
- Circle-Covering Algorithm for Multiple-POI Searching
- Integrated Approach to Assignment, Scheduling and Routing Problems in a Sales Territory Business Plan
  Procedia Computer Science, Vol. 80
- Competitive Location Models
  21 January 2015
- Covering Location Problems
  21 January 2015
- Linear Time Approximation Schemes for Geometric Maximum Coverage
  24 June 2015
- Covering Part of a Planar Network
  18 September 2014 | Networks and Spatial Economics, Vol. 14, No. 3-4
- Maximizing Range Sum in External Memory
  7 October 2014 | ACM Transactions on Database Systems, Vol. 39, No. 3
- An Iterated Local Search for the Budget Constrained Generalized Maximal Covering Location Problem
  13 September 2013 | Journal of Mathematical Modelling and Algorithms in Operations Research, Vol. 13, No. 3
- General Bibliography
  8 August 2014
- Location Problems
  8 August 2014
- Continuous covering and cooperative covering problems with a general decay function on networks
  21 December 2017 | Journal of the Operational Research Society, Vol. 64, No. 11
- ON PLANAR MEDIANOID COMPETITIVE LOCATION PROBLEMS WITH MANHATTAN DISTANCE
  4 April 2013 | Asia-Pacific Journal of Operational Research, Vol. 30, No. 02
- Location Problems
  13 February 2013
- A scalable algorithm for maximizing range sum in spatial databases
  1 July 2012 | Proceedings of the VLDB Endowment, Vol. 5, No. 11
- A Multi-Objective Evolutionary Algorithm for Finding Efficient Solutions to a Competitive Facility Location Problem
- A cover-based competitive location model
  21 December 2017 | Journal of the Operational Research Society, Vol. 62, No. 1
- Generalized coverage: New developments in covering location models
  Computers & Operations Research, Vol. 37, No. 10
- On competitive sequential location in a network with a decreasing demand intensity
  European Journal of Operational Research, Vol. 205, No. 2
- Locating a Surveillance Infrastructure in and Near Ports or on Other Planar Surfaces to Monitor Flows
  Computer-Aided Civil and Infrastructure Engineering, Vol. 25, No. 2
- Cooperative cover location problems: The planar case
  19 December 2009 | IIE Transactions, Vol. 42, No. 3
- Covering Many or Few Points with Unit Disks
  30 July 2008 | Theory of Computing Systems, Vol. 45, No. 3
- The variable radius covering problem
  European Journal of Operational Research, Vol. 196, No. 2
- Competitive Location Problem
  27 April 2009
- The Maximal Covering Problem with Some Negative Weights
  4 January 2009 | Geographical Analysis, Vol. 41, No. 1
- Covering point sets with two disjoint disks or squares
  Computational Geometry, Vol. 40, No. 3
- Covering Many or Few Points with Unit Disks
- LOCATING MULTIPLE FACILITIES IN A PLANAR COMPETITIVE ENVIRONMENT
  Journal of the Operations Research Society of Japan, Vol. 50, No. 3
- Finding a cluster of points and the grey pattern quadratic assignment problem
  21 December 2005 | OR Spectrum, Vol. 28, No. 3
- AVOIDING CANNIBALISATION AND/OR COMPETITOR REACTION IN PLANAR SINGLE FACILITY LOCATION
  Journal of the Operations Research Society of Japan, Vol. 48, No. 2
- The gradual covering problem
  28 June 2004 | Naval Research Logistics (NRL), Vol. 51, No. 6
- The gradual covering decay location problem on a network
  European Journal of Operational Research, Vol. 151, No. 3
- The expropriation location problem
  21 December 2017 | Journal of the Operational Research Society, Vol. 54, No. 7
- Satisfying partial demand in facilities location
  IIE Transactions, Vol. 34, No. 11
- Continuous Covering Location Problems
- Static competitive facility location: An overview of optimisation approaches
  European Journal of Operational Research, Vol. 129, No. 3
- On a Profit Maximizing Location Model
  Annals of Operations Research, Vol. 103, No. 1-4
- Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints
  Top, Vol. 6, No. 2
- Sequential location problems
  European Journal of Operational Research, Vol. 96, No. 2
- Hitting or avoiding balls in Euclidean space
  Annals of Operations Research, Vol. 69, No. 0
- On the conditional p-median problem
  Computers & Operations Research, Vol. 22, No. 5
- The p maximal cover - p partial center problem on networks
  European Journal of Operational Research, Vol. 72, No. 2
- The slab dividing approach to solve the EuclideanP-Center problem
  Algorithmica, Vol. 9, No. 1
- Competitive location in the plane
  Annals of Operations Research, Vol. 40, No. 1
- Perceptual maps and the optimal location of new products: An integrative essay
  International Journal of Research in Marketing, Vol. 5, No. 4
- Sequential Bias: Impact on a Bank Credit Card Concept Test
  International Journal of Bank Marketing, Vol. 5, No. 3
- The p-cover problem
  European Journal of Operational Research, Vol. 26, No. 2
- On a circle placement problem
  Computing, Vol. 36, No. 1-2
- Geometric location problems and their complexity
- A single facility location problem with a weighted maximin-minimax rectilinear distance
  Computers & Operations Research, Vol. 12, No. 1
- Computational Geometry—A Survey
  IEEE Transactions on Computers, Vol. C-33, No. 12
- A continuous location problem with different norms
  Socio-Economic Planning Sciences, Vol. 18, No. 3
- Constrained Location Problems in the Plane and on a Sphere
  6 July 2007 | IIE Transactions, Vol. 15, No. 4
- Competitive location strategies for two facilities
  Regional Science and Urban Economics, Vol. 12, No. 4

Volume 27, Issue 7

July 1981

Pages 731-853

Article Information

Metrics

Information

Published Online:July 01, 1981

Cite as

Zvi Drezner, (1981) Note—On a Modified One-Center Model. Management Science 27(7):848-851.

https://doi.org/10.1287/mnsc.27.7.848

Keywords

PDF download

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Note—On a Modified One-Center Model

Volume 27, Issue 7

Article Information

Metrics

Information

Cite as

Keywords

Sign Up for INFORMS Publications Updates and News