Discrete network location models
Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)
The contribution contains a broad overview of network location problems, in which facilities are allowed to be located only at sites of a finite set of candidates. The sequence of studied problems starts with set covering problem and continues over maximal covering location problem, \(p\)-center problem, \(p\)-dispersion problem and \(p\)-mediand problems to the family of fixed charge location problems. This family includes both capacitated and uncapacitated facility location problems as well as hub location and minisum location problems. The authors build an integer linear programming model for each of these problems and provide a concise explanation of their possible application in practice together with extensive references to relevant works. In the last but one section they outline principles of methods, which may solve the location problems. Greedy and improvement heuristics are reported here as well as the metaheuristic tabu search and the Lagrangian relaxation approach. In the concluding section the perspectives of this scientific area are analysed and further development outlined. For the entire collection see [Zbl 0988.00044].
- A new formulation for the conditional p-median and p-center problems
- A computational evaluation of a general branch-and-price framework for capacitated network location problems
- The variable radius covering problem
- Location with acceleration-deceleration distance
- On the set partitioning type formulation for the discrete location problem
- A scalable exact algorithm for the vertex \(p\)-center problem
- Territorial design optimization for business sales plan
- A two-echelon joint continuous-discrete location model
- Optimization of competitive facility location for chain stores
- Shelter site location under multi-hazard scenarios
- Location analysis: a synthesis and survey
- A combined facility location and network design problem with multi-type of capacitated links
- Semi-fair design of emergency service system with failing centers
- Location of courts of justice: the making of the new judiciary map of Portugal
- Efficient incrementing heuristics for generalized \(p\)-location problems
- Multi-objective multi-layer congested facility location-allocation problem optimization with Pareto-based meta-heuristics
- Robust weighted vertex \(p\)-center model considering uncertain data: an application to emergency management
- Capacitated refueling station location problem with traffic deviations over multiple time periods
- The minimum equitable radius location problem with continuous demand
- Voronoi diagrams with overlapping regions
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
- Finding a cluster of points and the grey pattern quadratic assignment problem
- Using logic-based Benders decomposition to solve the capacity- and distance-constrained plant location problem
- Covering part of a planar network
- The quintile share ratio in location analysis
- Public service system design with fuzzy parameters of perceived utility
- The -reliable minimax and maximin location problems on a network with probabilistic weights
- An Analysis of Network Location Problems with Distance Constraints
- scientific article; zbMATH DE number 3887396 (Why is no real title available?)
- scientific article; zbMATH DE number 3847184 (Why is no real title available?)
- Robust vertex p-center model for locating urgent relief distribution centers
- A new heuristic for solving the \(p\)-median problem in the plane
- scientific article; zbMATH DE number 3922329 (Why is no real title available?)
- An Overview of Representative Problems in Location Research
- Sequential competitive location on networks
- The maximin gradual cover location problem
- An iterated local search for the budget constrained generalized maximal covering location problem
- scientific article; zbMATH DE number 821272 (Why is no real title available?)
- Sequential location of two facilities: comparing random to optimal location of the first facility
- Discrete self-organizing migration algorithm and \(p\)-location problems
- Impact of utility function to service center location in public service system
- A hybrid hypercube - genetic algorithm approach for deploying many emergency response mobile units in an urban network
- Discrete center problems
- Siting and sizing of facilities under probabilistic demands
- Siting and sizing of facilities under probabilistic demands
- The gravity multiple server location problem
- Weber problems with high-speed lines
- A PTAS framework for clustering problems in doubling metrics
- Optimal charging station location in a linear cycle path with deviations
- Equitable service by a facility: minimizing the Gini coefficient
- The gravity p-median model
- A distribution map for the one-median location problem on a network
- A fuzzy queuing location model with a genetic algorithm for congested systems
- A mixed integer linear program and tabu search approach for the complementary edge covering problem
- The ordered gradual covering location problem on a network
- Generalized coverage: new developments in covering location models
- Multiple criteria facility location problems: a survey
- Optimizing the location of a production firm
This page was built for publication: Discrete network location models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3147658)
