  


On the pmedian polytope of a special class of graphs
Mourad Baiou (mourad.baioucustsv.univbpclermont.fr) Abstract: In this paper we consider a well known class of valid inequalities for the pmedian and the uncapacitated facility location polytopes, the odd cycle inequalities. It is known that their separation problem is polynomially solvable. We give a new polynomial separation algorithm based on a reduction from the original graph. Then, we define a nontrivial class of graphs, where the odd cycle inequalities together with the linear relaxations of both the pmedian and uncapacitated facility location problems, suffice to describe the associated polytope. To do this, we first give a complete description of the fractional extreme points of the linear relaxation for the pmedian polytope in that class of graphs. Keywords: pmedian problem, facility location Category 1: Combinatorial Optimization (Polyhedra ) Citation: Download: [PDF] Entry Submitted: 03/09/2006 Modify/Update this entry  
Visitors  Authors  More about us  Links  
Subscribe, Unsubscribe Digest Archive Search, Browse the Repository

Submit Update Policies 
Coordinator's Board Classification Scheme Credits Give us feedback 
Optimization Journals, Sites, Societies  