Gradual cover competitive facility location

DOI10.1007/S00291-020-00585-XzbMATH Open1446.90104OpenAlexW3010989813MaRDI QIDQ2197154FDOQ2197154

Authors Tammy Drezner, Zvi Drezner, Pawel Kalczynski 

Publication date 28 August 2020

Published in OR Spectrum (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00291-020-00585-x

zbMATH Keywords

facility locationgradual covercompetitive facilities

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Recommendations

• A stochastic gradual cover location problem
• The maximin gradual cover location problem
• A directional approach to gradual cover
• The gradual covering problem
• Optimal location and design of a competitive facility

Cites work

• scientific article; zbMATH DE number 1803758 (Why is no real title available?)
• scientific article; zbMATH DE number 9247 (Why is no real title available?)
• scientific article; zbMATH DE number 1746287 (Why is no real title available?)
• scientific article; zbMATH DE number 757676 (Why is no real title available?)
• A ROBUST TOPOLOGY-ORIENTED INCREMENTAL ALGORITHM FOR VORONOI DIAGRAMS
• A d.c. optimization method for single facility location problems
• A general global optimization approach for solving location problems in the plane
• A leader-follower model for discrete competitive facility location
• A maximal covering location model in the presence of partial coverage
• A stochastic gradual cover location problem
• Continuous location problems and big triangle small triangle: Constructing better bounds
• Covering Problems
• Equilibria in Competitive Location Models
• Generalized coverage: new developments in covering location models
• IMPROVEMENTS OF THE INCREMENTAL METHOD FOR THE VORONOI DIAGRAM WITH COMPUTATIONAL COMPARISON OF VARIOUS ALGORITHMS
• LARGE-SCALE SINGLE FACILITY CONTINUOUS LOCATION BY D.C. OPTIMIZATION
• Location Theory, Dominance, and Convexity
• On locating new facilities in a competitive environment
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
• The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
• The generalized maximal covering location problem
• The gradual covering decay location problem on a network.
• The gradual covering problem
• The maximin gradual cover location problem
• The multiple markets competitive location problem
• Two algorithms for constructing a Delaunay triangulation

Cited in

(7)

• A refinement of the gravity model for competitive facility location
• Competitive location models: a review
• Multipurpose shopping trips and location
• Facility dependent distance decay in competitive location
• Competitive network restructuring with spatially loyal customers. A bilevel facility delocation problem
• The maximin gradual cover location problem
• A location-or-routing problem with partial and decaying coverage

Describes a project that uses

Uses Software

• SNOPT
• Ipopt

This page was built for publication: Gradual cover competitive facility location

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2197154)