The discrete p-dispersion problem

DOI10.1016/0377-2217(90)90297-OzbMath0702.90050OpenAlexW1986998000MaRDI QIDQ915643

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

zbMATH Keywords

dispersion branch-and-bound heuristic facility locations undesirable facilities

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (70)

Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem ⋮ A comparison of \(p\)-dispersion heuristics ⋮ On the unified dispersion problem: efficient formulations and exact algorithms ⋮ Facility dispersion and remote subgraphs ⋮ The disruptive anti-covering location problem ⋮ An integer programming approach for solving the \(p\)-dispersion problem ⋮ Location of alternative-fuel stations using the flow-refueling location model and dispersion of candidate sites on arcs ⋮ Finding minimum and equitable risk routes for hazmat shipments ⋮ A tabu search approach for scheduling hazmat shipments ⋮ Generalized route planning model for hazardous material transportation with VaR and equity considerations ⋮ Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach ⋮ \(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis ⋮ Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster ⋮ Solving the anti-covering location problem using Lagrangian relaxation ⋮ Analytical models for locating undesirable facilities ⋮ Subset selection from large datasets for kriging modeling ⋮ Solving \(k\)-cluster problems to optimality with semidefinite programming ⋮ Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS ⋮ Lagrangian solution of maximum dispersion problems ⋮ A review on discrete diversity and dispersion maximization from an OR perspective ⋮ Away from each other ⋮ An exact cutting plane method for the Euclidean max-sum diversity problem ⋮ Location Science in Canada ⋮ Obtaining approximately optimal and diverse solutions via dispersion ⋮ A linear time approximation scheme for computing geometric maximum \(k\)-star ⋮ Algorithms for \(k\)-dispersion for points in convex position in the plane ⋮ Formulations and valid inequalities for the capacitated dispersion problem ⋮ Model development and solver demonstrations using randomized test problems ⋮ Simulated annealing based GRASP for Pareto-optimal dissimilar paths problem ⋮ Dispersing points on intervals ⋮ On linearization techniques for budget-constrained binary quadratic programming problems ⋮ A simple and effective algorithm for the MaxMin diversity problem ⋮ Space-filling Latin hypercube designs for computer experiments ⋮ Approximability of the dispersed \(\vec{p}\)-neighbor \(k\)-supplier problem ⋮ A branch-and-cut method for the obnoxious \(p\)-median problem ⋮ On finding dissimilar paths ⋮ An exact algorithm for designing optimal districts in the collection of waste electric and electronic equipment through an improved reformulation ⋮ Solving circle packing problems by global optimization: numerical results and industrial applications ⋮ \(t\)-linearization for the maximum diversity problem ⋮ Facet-defining inequalities for the simple graph partitioning polytope ⋮ Heuristic solution approaches for the maximum minsum dispersion problem ⋮ Effective metaheuristic algorithms for the minimum differential dispersion problem ⋮ A new compact formulation for the discrete \(p\)-dispersion problem ⋮ Solving the maximum min-sum dispersion by alternating formulations of two different problems ⋮ A multiobjective model for locating undesirable facilities ⋮ Good solutions to discrete noxious location problems via metaheuristics ⋮ Maximum diversity/similarity models with extension to part grouping ⋮ Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem ⋮ Discrete location problems with push-pull objectives ⋮ Upper bounds and exact algorithms for \(p\)-dispersion problems ⋮ Multiobjective optimization for multimode transportation problems ⋮ A hybrid heuristic for the maximum dispersion problem ⋮ Construction and improvement algorithms for dispersion problems ⋮ Fast approximation algorithms for \(p\)-centers in large \(\delta\)-hyperbolic graphs ⋮ Max-min dispersion on a line ⋮ The conditional \(p\)-dispersion problem ⋮ A heuristic approach for the max-min diversity problem based on max-clique ⋮ The equitable dispersion problem ⋮ Integer-friendly formulations for the \(r\)-separation problem ⋮ Convex maximization formulation of general sphere packing problem ⋮ Variable neighborhood search for the heaviest \(k\)-subgraph ⋮ Heuristics for the bi-objective path dissimilarity problem ⋮ A support tool for planning classrooms considering social distancing between students ⋮ The discrete p-maxian location problem ⋮ Repulsion-based p-dispersion with distance constraints in non-convex polygons ⋮ GRASP and path relinking for the max-min diversity problem ⋮ Big segment small segment global optimization algorithm on networks ⋮ Some personal views on the current state and the future of locational analysis ⋮ The Location of Undesirable Facilities ⋮ Locating two obnoxious facilities using the weighted maximin criterion

Cites Work

This page was built for publication: The discrete p-dispersion problem