The discrete p-dispersion problem
From MaRDI portal
DOI10.1016/0377-2217(90)90297-OzbMATH Open0702.90050OpenAlexW1986998000MaRDI QIDQ915643FDOQ915643
Publication date: 1990
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(90)90297-o
Recommendations
Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Integer programming (90C10) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- Finding a Maximum Clique in an Arbitrary Graph
- Analytical models for locating undesirable facilities
- An Analysis of Network Location Problems with Distance Constraints
- Relations between packing and covering numbers of a tree
- Semi-greedy heuristics: An empirical study
- State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
- Duality and Distance Constraints for the Nonlinear p-Center Problem and Covering Problem on a Tree Network
- The m-Center Problem
- Polynomially bounded algorithms for locatingp-centers on a tree
- Location on Tree Networks: P-Centre and n-Dispersion Problems
- An $O ( ( n\log p )^2 )$ Algorithm for the Continuous p-Center Problem on a Tree
Cited In (86)
- Facet-defining inequalities for the simple graph partitioning polytope
- Upper bounds and exact algorithms for \(p\)-dispersion problems
- The repeated p-dispersion problem
- On the discrete Fuglede and Pompeiu problems
- Locating two obnoxious facilities using the weighted maximin criterion
- On the set partitioning type formulation for the discrete location problem
- Location of alternative-fuel stations using the flow-refueling location model and dispersion of candidate sites on arcs
- A multiobjective model for locating undesirable facilities
- Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS
- Solving the maximum min-sum dispersion by alternating formulations of two different problems
- Title not available (Why is that?)
- Algorithms for \(k\)-dispersion for points in convex position in the plane
- Title not available (Why is that?)
- Polynomial algorithms for p-dispersion problems in a planar Pareto Front
- The Location of Undesirable Facilities
- A new compact formulation for the discrete \(p\)-dispersion problem
- Title not available (Why is that?)
- Space-filling Latin hypercube designs for computer experiments
- Multiobjective optimization for multimode transportation problems
- Heuristic and Special Case Algorithms for Dispersion Problems
- Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem
- Approximability of the dispersed \(\vec{p}\)-neighbor \(k\)-supplier problem
- The discrete multidimensional MPUM
- The disruptive anti-covering location problem
- Finding minimum and equitable risk routes for hazmat shipments
- A branch-and-cut method for the obnoxious \(p\)-median problem
- An integer programming approach for solving the \(p\)-dispersion problem
- Generalized route planning model for hazardous material transportation with VaR and equity considerations
- Discrete location problems with push-pull objectives
- Some personal views on the current state and the future of locational analysis
- Analytical models for locating undesirable facilities
- Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach
- \(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis
- Solving circle packing problems by global optimization: numerical results and industrial applications
- Good solutions to discrete noxious location problems via metaheuristics
- The equitable dispersion problem
- Heuristics for the bi-objective path dissimilarity problem
- Heuristic solution approaches for the maximum minsum dispersion problem
- A simple and effective algorithm for the MaxMin diversity problem
- Integer-friendly formulations for the \(r\)-separation problem
- Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster
- Finding a cluster of points and the grey pattern quadratic assignment problem
- A heuristic approach for the max-min diversity problem based on max-clique
- GRASP and path relinking for the max-min diversity problem
- Solving the anti-covering location problem using Lagrangian relaxation
- A tabu search approach for scheduling hazmat shipments
- Title not available (Why is that?)
- The discrete p-maxian location problem
- Variable neighborhood search for the heaviest \(k\)-subgraph
- Construction and improvement algorithms for dispersion problems
- A comparison of \(p\)-dispersion heuristics
- On finding dissimilar paths
- Lagrangian solution of maximum dispersion problems
- Maximum diversity/similarity models with extension to part grouping
- Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem
- Simulated annealing based GRASP for Pareto-optimal dissimilar paths problem
- Dispersing points on intervals
- Subset selection from large datasets for kriging modeling
- Big segment small segment global optimization algorithm on networks
- Facility dispersion and remote subgraphs
- A hybrid heuristic for the maximum dispersion problem
- Approximate solutions of continuous dispersion problems
- On the unified dispersion problem: efficient formulations and exact algorithms
- Solving \(k\)-cluster problems to optimality with semidefinite programming
- An exact algorithm for designing optimal districts in the collection of waste electric and electronic equipment through an improved reformulation
- \(t\)-linearization for the maximum diversity problem
- Convex maximization formulation of general sphere packing problem
- A constructive heuristic for the uniform capacitated vertex \(k\)-center problem
- Effective metaheuristic algorithms for the minimum differential dispersion problem
- Dispersion problem on a convex polygon
- Away from each other
- The conditional \(p\)-dispersion problem
- Max-min dispersion on a line
- A review on discrete diversity and dispersion maximization from an OR perspective
- Formulations and valid inequalities for the capacitated dispersion problem
- Fast approximation algorithms for \(p\)-centers in large \(\delta\)-hyperbolic graphs
- A linear time approximation scheme for computing geometric maximum \(k\)-star
- Title not available (Why is that?)
- A support tool for planning classrooms considering social distancing between students
- An exact cutting plane method for the Euclidean max-sum diversity problem
- Location Science in Canada
- Model development and solver demonstrations using randomized test problems
- Repulsion-based p-dispersion with distance constraints in non-convex polygons
- Obtaining approximately optimal and diverse solutions via dispersion
- Optimal control sphere packing problem
- On linearization techniques for budget-constrained binary quadratic programming problems
This page was built for publication: The discrete p-dispersion problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q915643)
