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

DOI10.1016/J.COR.2018.08.009MaRDI QIDQ1628040zbMATH OpenOpenAlexWikidataFDO

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

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)

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

Cites work

• {{#invoke:WikidataIB|getLink|Q4670576}} scientific article; zbMATH DE number 2160609 (Why is no real title available?)
• {{#invoke:WikidataIB|getLink|Q4857376}} scientific article; zbMATH DE number 821272 (Why is no real title available?)
• {{#invoke:WikidataIB|getLink|Q4943600}} scientific article; zbMATH DE number 1416629 (Why is no real title available?)
• {{#invoke:WikidataIB|getLink|Q3893624}} A Maxmin Location Problem
• {{#invoke:WikidataIB|getLink|Q1010298}} A heuristic approach for the max-min diversity problem based on max-clique
• {{#invoke:WikidataIB|getLink|Q2890410}} A new formulation and resolution method for the \(p\)-center problem
• {{#invoke:WikidataIB|getLink|Q3216395}} An Analysis of Network Location Problems with Distance Constraints
• {{#invoke:WikidataIB|getLink|Q953423}} An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
• {{#invoke:WikidataIB|getLink|Q323154}} An integer programming approach for solving the \(p\)-dispersion problem
• {{#invoke:WikidataIB|getLink|Q1360111}} Computational aspects of the maximum diversity problem
• {{#invoke:WikidataIB|getLink|Q336682}} Double bound method for solving the \(p\)-center location problem
• {{#invoke:WikidataIB|getLink|Q814956}} Enhancements to two exact algorithms for solving the vertex \(P\)-center problem
• {{#invoke:WikidataIB|getLink|Q1038285}} GRASP and path relinking for the max-min diversity problem
• {{#invoke:WikidataIB|getLink|Q689250}} Good solutions to discrete noxious location problems via metaheuristics
• {{#invoke:WikidataIB|getLink|Q4301294}} Heuristic and Special Case Algorithms for Dispersion Problems
• {{#invoke:WikidataIB|getLink|Q1044136}} Lagrangean duals and exact solution to the capacitated \(p\)-center problem
• {{#invoke:WikidataIB|getLink|Q915643}} The discrete p-dispersion problem
• {{#invoke:WikidataIB|getLink|Q1011261}} The equitable dispersion problem
• {{#invoke:WikidataIB|getLink|Q2496032}} Upper bounds and exact algorithms for \(p\)-dispersion problems
• {{#invoke:WikidataIB|getLink|Q337587}} \(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis

Cited in

(5)

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

Describes a project that uses

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)