Equivalent instances of the simple plant location problem

Authors:
Bader F. AlBdaiwi;Boris Goldengorin;Gerard Sierksma
Affiliations:
Department of Mathematics and Computer Science, Kuwait University, Kuwait;Department of Operations, University of Groningen, The Netherlands;Department of Operations, University of Groningen, The Netherlands
Venue:
Computers & Mathematics with Applications
Year:
2009

Citing 5
Cited 1

Perspectives of Monge properties in optimization

Discrete Applied Mathematics
The Data-Correcting Algorithm for the Minimization of Supermodular Functions

Management Science
Solving the Simple Plant Location Problem using a Data Correcting Approach

Journal of Global Optimization
Graph theory: An algorithmic approach (Computer science and applied mathematics)

Graph theory: An algorithmic approach (Computer science and applied mathematics)
Tolerance based algorithms for the ATSP

WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science

Data aggregation for p-median problems

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.09

Visualization

Abstract

In this paper we deal with a pseudo-Boolean representation of the simple plant location problem. We define instances of this problem that are equivalent, in the sense that each feasible solution has the same goal function value in all such instances. We further define a collection of polytopes whose union describes the set of instances equivalent to a given instance. We use the concept of equivalence to develop a method by which we can extend the set of instances that we can solve using our knowledge of polynomially solvable special cases.