Data aggregation for p-median problems

Authors:
Bader F. Albdaiwi;Diptesh Ghosh;Boris Goldengorin
Affiliations:
Department of Mathematics and Computer Science, Kuwait University, Kuwait, Kuwait;P&QM Area, Indian Institute of Management, Ahmedabad, India;Department of Operations, University of Groningen, Groningen, The Netherlands
Venue:
Journal of Combinatorial Optimization
Year:
2011

Citing 10
Cited 4

Perspectives of Monge properties in optimization

Discrete Applied Mathematics
A linear algorithm for the pos/neg-weighted 1-median problem on a cactus

Computing
Solving the Simple Plant Location Problem using a Data Correcting Approach

Journal of Global Optimization
Branch and peg algorithms for the simple plant location problem

Computers and Operations Research
Pseudo-boolean optimization

Discrete Applied Mathematics
Clustering For Data Mining: A Data Recovery Approach (Chapman & Hall/Crc Computer Science)

Clustering For Data Mining: A Data Recovery Approach (Chapman & Hall/Crc Computer Science)
Solution methods for the p-median problem: An annotated bibliography

Networks
Computational study of large-scale p-Median problems

Mathematical Programming: Series A and B
The Optimal Diversity Management Problem

Operations Research
Equivalent instances of the simple plant location problem

Computers & Mathematics with Applications

The problem of margin calculation and its reduction via the p-Median problem model

AIC'09 Proceedings of the 9th WSEAS international conference on Applied informatics and communications
A computational study of the pseudo-Boolean approach to the p-median problem applied to cell formation

INOC'11 Proceedings of the 5th international conference on Network optimization
Complexity evaluation of benchmark instances for the p-median problem

Mathematical and Computer Modelling: An International Journal
Flexible PMP Approach for Large-Size Cell Formation

Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we use a pseudo-Boolean formulation of the p-median problem and using data aggregation, provide a compact representation of p-median problem instances. We provide computational results to demonstrate this compactification in benchmark instances. We then use our representation to explain why some p-median problem instances are more difficult to solve to optimality than other instances of the same size. We also derive a preprocessing rule based on our formulation, and describe equivalent p-median problem instances, which are identical sized instances which are guaranteed to have identical optimal solutions.