Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem

DOI10.1016/j.cor.2018.08.009zbMath1458.90440OpenAlexW2889430680WikidataQ129335907 ScholiaQ129335907MaRDI QIDQ1628040

Golbarg Kazemi Tutunchi, Yahya Fathi

Publication date: 3 December 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2018.08.009

zbMATH Keywords

integer programmingvalid inequalitieslocationmax-min diversity\(p\)-center partitioning

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (3)

Set covering problem with conflict constraints ⋮ Maximizing single attribute diversity in group selection ⋮ The complete vertex \(p\)-center problem

Uses Software

• SITATION
• MOD-DIST
• MENU-OKF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An integer programming approach for solving the \(p\)-dispersion problem
• Double bound method for solving the \(p\)-center location problem
• \(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis
• Good solutions to discrete noxious location problems via metaheuristics
• Enhancements to two exact algorithms for solving the vertex \(P\)-center problem
• The discrete p-dispersion problem
• An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
• A heuristic approach for the max-min diversity problem based on max-clique
• The equitable dispersion problem
• GRASP and path relinking for the max-min diversity problem
• Lagrangean duals and exact solution to the capacitated \(p\)-center problem
• Computational aspects of the maximum diversity problem
• Upper bounds and exact algorithms for \(p\)-dispersion problems
• A New Formulation and Resolution Method for the p-Center Problem
• An Analysis of Network Location Problems with Distance Constraints
• A Maxmin Location Problem
• Heuristic and Special Case Algorithms for Dispersion Problems

This page was built for publication: Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem