The p-Median Problem

Boris Goldengorin, Dmitry Krushinsky and Panos M. Pardalos
Additional contact information
Boris Goldengorin: University of Groningen
Dmitry Krushinsky: University of Groningen
Panos M. Pardalos: University of Gainesville

Chapter Chapter 2 in Cell Formation in Industrial Engineering, 2013, pp 25-73 from Springer

Abstract: Abstract This chapter focuses on the p-median problem (PMP) and its properties. We consider a pseudo-Boolean formulation of the PMP, demonstrate its advantages and derive the most compact MILP formulation for the PMP within the class of mixed-Boolean linear programming formulations. Further, we develop two applications of the pseudo-Boolean approach: a construction of PMP instances that are expected to be complex for any solution algorithm and a definition of an equivalence relation for PMP instances. By equivalence we mean that solving one instance gives a solution for all the instances from its equivalence class. The proposed equivalence relation can be extended to any other problem modelled via the PMP, for example, the cell formation problem.

Keywords: Travel Salesman Problem; Mixed Integer Linear Programming; Permutation Matrix; Cost Matrix; Hasse Diagram (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-1-4614-8002-0_2

Ordering information: This item can be ordered from
http://www.springer.com/9781461480020

DOI: 10.1007/978-1-4614-8002-0_2

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().