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

DOI10.1016/J.COR.2018.08.009zbMATH Open1458.90440OpenAlexW2889430680WikidataQ129335907 ScholiaQ129335907MaRDI QIDQ1628040FDOQ1628040

Authors: 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

Recommendations

• \(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis
• An integer programming approach for solving the \(p\)-dispersion problem
• The discrete p-dispersion problem
• Heuristic solution approaches for the maximum minsum dispersion problem
• A comparison of \(p\)-dispersion heuristics

zbMATH Keywords

locationinteger programmingvalid inequalitiesmax-min diversity\(p\)-center partitioning

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• The complete vertex \(p\)-center problem
• A Class of Single Machine Central Tendency-Dispersion Bicriteria Problems
• Set covering problem with conflict constraints
• \(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis
• Maximizing single attribute diversity in group selection

Uses Software

• SITATION
• MOD-DIST
• MENU-OKF

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1628040)