Complexity evaluation of benchmark instances for the \(p\)-median problem

DOI10.1016/j.mcm.2010.12.047zbMath1219.05186OpenAlexW1973994147MaRDI QIDQ636452

Boris I. Goldengorin, Dmitry Krushinsky

Publication date: 28 August 2011

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mcm.2010.12.047

zbMATH Keywords

\(p\)-median problemdata complexitypseudo-Boolean polynomialproblem size reduction

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem ⋮ Variations in the flow approach to CFCLP-TC for multiobjective supply chain design ⋮ A branch-and-price approach for the continuous multifacility monotone ordered median problem

Uses Software

• TSPLIB
• OR-Library

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Data aggregation for \(p\)-median problems
• The \(p\)-median problem: a survey of metaheuristic approaches
• Computational study of large-scale \(p\)-median problems
• A note on solving large p-median problems
• Logical reduction tests for the p-problem
• Supernode processing of mixed-integer models
• Solving the simple plant location problem using a data correcting approach
• COBRA: A new formulation of the classic \(p\)-median location problem
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Graph minors. XIII: The disjoint paths problem
• Presolving in linear programming
• A tighter formulation of the \(p\)-median problem
• A bibliography for some fundamental problem categories in discrete location science
• Solution methods for thep-median problem: An annotated bibliography
• Minimum Leaf Out-Branching Problems
• Solving Large-Scale Zero-One Linear Programming Problems
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• A Canonical Representation of Simple Plant Location Problems and Its Applications
• TSPLIB—A Traveling Salesman Problem Library
• Boolean and Graph Theoretic Formulations of the Simple Plant Location Problem
• Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
• The Optimal Diversity Management Problem
• On the \(p\)-median polytope

This page was built for publication: Complexity evaluation of benchmark instances for the \(p\)-median problem