Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem
type: Item
instance of: scholarly article
title: Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem
zbMATH Open document ID: 1458.90440
author: Golbarg Kazemi Tutunchi
author: Yahya Fathi
published in: Computers \& Operations Research
publication date: 2018-12-03T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6988094
zbMATH Keywords: location
zbMATH Keywords: max-min diversity
zbMATH Keywords: \(p\)-center partitioning
zbMATH Keywords: integer programming
zbMATH Keywords: valid inequalities
describes a project that uses: SITATION
describes a project that uses: MOD-DIST
describes a project that uses: MENU-OKF
MaRDI profile type: Publication
full work available at URL: j.cor.2018.08.009
OpenAlex ID: W2889430680
cites work: Enhancements to two exact algorithms for solving the vertex \(P\)-center problem
cites work: Lagrangean duals and exact solution to the capacitated \(p\)-center problem
cites work: An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
cites work: Double bound method for solving the \(p\)-center location problem
cites work: A Maxmin Location Problem
cites work: Q4857376
cites work: A heuristic approach for the max-min diversity problem based on max-clique
cites work: Q4670576
cites work: A new formulation and resolution method for the \(p\)-center problem
cites work: The discrete p-dispersion problem
cites work: Computational aspects of the maximum diversity problem
cites work: Good solutions to discrete noxious location problems via metaheuristics
cites work: An Analysis of Network Location Problems with Distance Constraints
cites work: Q4943600
cites work: Upper bounds and exact algorithms for \(p\)-dispersion problems
cites work: The equitable dispersion problem
cites work: Heuristic and Special Case Algorithms for Dispersion Problems
cites work: GRASP and path relinking for the max-min diversity problem
cites work: An integer programming approach for solving the \(p\)-dispersion problem
cites work: \(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis
Wikidata QID: Q129335907
DOI: 10.1016/J.COR.2018.08.009
description: scientific article; zbMATH DE number 6988094