Data aggregation for \(p\)-median problems

DOI10.1007/s10878-009-9251-8zbMath1319.90045OpenAlexW2152465818MaRDI QIDQ491200

Bader F. AlBdaiwi, Diptesh Ghosh, Boris I. Goldengorin

Publication date: 24 August 2015

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-009-9251-8

zbMATH Keywords

\(p\)-median problempseudo-Boolean polynomialdata aggregationequivalent instances

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80) Boolean programming (90C09)

Related Items (2)

Complexity evaluation of benchmark instances for the \(p\)-median problem ⋮ Berge-acyclic multilinear 0-1 optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Pseudo-Boolean optimization
• The \(p\)-median problem: a survey of metaheuristic approaches
• Computational study of large-scale \(p\)-median problems
• Equivalent instances of the simple plant location problem
• Logical reduction tests for the p-problem
• A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
• Solving the simple plant location problem using a data correcting approach
• Branch and peg algorithms for the simple plant location problem.
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Perspectives of Monge properties in optimization
• A bibliography for some fundamental problem categories in discrete location science
• Solution methods for thep-median problem: An annotated bibliography
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• The Optimal Diversity Management Problem
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• An Efficient Branch and Bound Algorithm for the Warehouse Location Problem
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

This page was built for publication: Data aggregation for \(p\)-median problems