An Analysis of Network Location Problems with Distance Constraints
From MaRDI portal
Recommendations
Cited in
(72)- The equitable dispersion problem
- Conditional covering: greedy heuristics and computational results
- On eliminating vertices from a tree
- Axiomatic considerations in multi-objective location theory
- Analytical models for locating undesirable facilities
- Integer-friendly formulations for the \(r\)-separation problem
- Locating flow-capturing units on a network with multi-counting and diminishing returns to scale
- A review of extensive facility location in networks
- Facets for node packing
- The obnoxious p facility network location problem with facility interaction
- The dynamics and internal geometry of the three-city noxious location problem
- Solving the anti-covering location problem using Lagrangian relaxation
- Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem
- Median and covering location problems with interconnected facilities
- Location analysis: a synthesis and survey
- The discrete p-maxian location problem
- Facility location on a tree with maximum distance constraints
- Isodistant points in competitive network facility location
- A linear time approximation scheme for computing geometric maximum \(k\)-star
- The conditional covering problem on unweighted interval graphs with nonuniform coverage radius
- A support tool for planning classrooms considering social distancing between students
- Repulsion-based p-dispersion with distance constraints in non-convex polygons
- Worst-case analysis of clique MIPs
- Optimization in business strategy as a part of sustainable economic growth using clique covering of fuzzy graphs
- Covering problem on fuzzy graphs and its application in disaster management system
- Safe distancing in the time of COVID-19
- Alternative formulations for the obnoxious \(p\)-median problem
- Facility location with tree topology and radial distance constraints
- The minimum weighted covering location problem with distance constraints
- Column generation approach for the point-feature cartographic label placement problem
- Lagrangean relaxation with clusters for point-feature cartographic label placement problems
- Single- and multi-objective defensive location problems on a network
- Public facility location using dispersion, population, and equity criteria
- On the unified dispersion problem: efficient formulations and exact algorithms
- Review of obnoxious facilities location problems
- A review on discrete diversity and dispersion maximization from an OR perspective
- scientific article; zbMATH DE number 1803756 (Why is no real title available?)
- The disruptive anti-covering location problem
- An integer programming approach for solving the p-dispersion problem
- A distribution network design problem in the automotive industry: MIP formulation and heuristics
- Comments on ‘Facility location problem on network under multiple criteria fuzzy set theoretic approach’
- The Solution of Distance Constrained Mini-Sum Location Problems
- scientific article; zbMATH DE number 3922329 (Why is no real title available?)
- Confined location of facilities on a graph
- An efficient algorithm to solve the conditional covering problem on trapezoid graphs
- scientific article; zbMATH DE number 1076395 (Why is no real title available?)
- scientific article; zbMATH DE number 1138452 (Why is no real title available?)
- Equivalence of Solutions to Network Location Problems
- An iterated local search for the budget constrained generalized maximal covering location problem
- Facility dispersion and remote subgraphs
- On the Modeling Tactics of Research Extensions in Production/Operations Management
- Computation of lower bounds on the network cost in location problems subject to distance constraints
- Discrete center problems
- Conditional Location Problems on Networks and in the Plane
- The Location of Undesirable Facilities
- Composite Regions of Feasibility for Certain Classes of Distance Constrained Network Location Problems
- The maximin-maxisum network location problem
- A new method for solving capacitated location problems based on a set partitioning approach
- Geographical information systems and location science
- Portfolio optimization through a network approach: network assortative mixing and portfolio diversification
- Location analysis of primary health care centers: a case study of Mohalla clinics in Delhi
- On conditional covering problem
- Bilevel optimization for the deployment of refuelling stations for electric vehicles on road networks
- Presolving and cutting planes for the generalized maximal covering location problem
- On worst-case aggregation analysis for network location problems
- Efficient algorithms for the conditional covering problem
- Discrete location problems with push-pull objectives
- Fifty years of location theory -- a selective review
- On disperse generalized linear models
- The zone-constrained location problem on a network
- The discrete p-dispersion problem
- A branch-and-cut method for the obnoxious \(p\)-median problem
This page was built for publication: An Analysis of Network Location Problems with Distance Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3216395)
