The conditional \(p\)-dispersion problem
type: Item
instance of: scholarly article
title: The conditional \(p\)-dispersion problem
zbMATH Open document ID: 1475.90078
author: Marilène Cherkesly
author: Claudio Contardo
published in: Journal of Global Optimization
publication date: 2021-08-17T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 7382691
zbMATH Keywords: \(p\)-dispersion
zbMATH Keywords: clustering
zbMATH Keywords: conditional \(p\)-dispersion
zbMATH Keywords: exact methods
describes a project that uses: TSPLIB
MaRDI profile type: Publication
full work available at URL: s10898-020-00962-4
OpenAlex ID: W3107782992
cites work: A sampling-based exact algorithm for the solution of the minimax diameter clustering problem
cites work: A branch-and-cut method for the obnoxious \(p\)-median problem
cites work: A new formulation for the conditional \(p\)-median and \(p\)-center problems
cites work: Technical Note—Conditional Location Problems on Networks
cites work: Accelerated label setting algorithms for the elementary resource constrained shortest path problem
cites work: New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems
cites work: A relaxation-based algorithm for solving the conditional \(p\)-center problem
cites work: Q3793913
cites work: Q4695785
cites work: Q3323698
cites work: A scalable exact algorithm for the vertex \(p\)-center problem
cites work: Bicriterion Cluster Analysis
cites work: Q4393480
cites work: Sequential location of two facilities: comparing random to optimal location of the first facility
cites work: Conditional p-Center Problems
cites work: On the conditional \(p\)-median problem
cites work: Solving the Continuous p-Dispersion Problem Using Non-linear Programming
cites work: The discrete p-dispersion problem
cites work: About the minimum mean cycle-canceling algorithm
cites work: Finite Dominating Sets for Network Location Problems
cites work: An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems
cites work: Path-reduced costs for eliminating arcs in routing and scheduling
cites work: Location Science
cites work: Efficient elementary and restricted non-elementary route pricing
cites work: Upper bounds and exact algorithms for \(p\)-dispersion problems
cites work: TSPLIB—A Traveling Salesman Problem Library
cites work: New dynamic programming algorithms for the resource constrained elementary shortest path problem
cites work: Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach
cites work: A new compact formulation for the discrete \(p\)-dispersion problem
DOI: 10.1007/S10898-020-00962-4
description: scientific article; zbMATH DE number 7382691