The conditional \(p\)-dispersion problem

DOI10.1007/s10898-020-00962-4zbMath1475.90078OpenAlexW3107782992MaRDI QIDQ2046325

Marilène Cherkesly, Claudio Contardo

Publication date: 17 August 2021

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-020-00962-4

zbMATH Keywords

clusteringexact methods\(p\)-dispersionconditional \(p\)-dispersion

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (1)

A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games

Uses Software

• TSPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient elementary and restricted non-elementary route pricing
• Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach
• About the minimum mean cycle-canceling algorithm
• Sequential location of two facilities: comparing random to optimal location of the first facility
• A sampling-based exact algorithm for the solution of the minimax diameter clustering problem
• The discrete p-dispersion problem
• A branch-and-cut method for the obnoxious \(p\)-median problem
• New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems
• A relaxation-based algorithm for solving the conditional \(p\)-center problem
• A new formulation for the conditional \(p\)-median and \(p\)-center problems
• A scalable exact algorithm for the vertex \(p\)-center problem
• A new compact formulation for the discrete \(p\)-dispersion problem
• On the conditional \(p\)-median problem
• An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems
• Upper bounds and exact algorithms for \(p\)-dispersion problems
• Accelerated label setting algorithms for the elementary resource constrained shortest path problem
• Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling
• Technical Note—Conditional Location Problems on Networks
• New dynamic programming algorithms for the resource constrained elementary shortest path problem
• Conditional p-Center Problems
• Bicriterion Cluster Analysis
• Finite Dominating Sets for Network Location Problems
• TSPLIB—A Traveling Salesman Problem Library
• Solving the Continuous p-Dispersion Problem Using Non-linear Programming
• Location Science
• Location Science

This page was built for publication: The conditional \(p\)-dispersion problem