New lower bounds for the facility location problem with clients’ preferences

A bilevel facility location problem in which the clients choose suppliers based on their own preferences is studied. It is shown that the coopertative and anticooperative statements can be reduced to a particular case in which every client has a linear preference order on the set of facilities to be opened. For this case, various reductions of the bilevel problem to integer linear programs are considered. A new statement of the problem is proposed that is based on a family of valid inequalities that are related to the problem on a pair of matrices and the set packing problem. It is shown that this formulation is stronger than the other known formulations from the viewpoint of the linear relaxation and the integrality gap.

[1]  Laurence A. Wolsey,et al.  Production Planning by Mixed Integer Programming , 2010 .

[2]  Laurence A. Wolsey,et al.  Production Planning by Mixed Integer Programming (Springer Series in Operations Research and Financial Engineering) , 2006 .

[3]  M. Padberg,et al.  Solving airline crew scheduling problems by branch-and-cut , 1993 .

[4]  Eddie Cheng,et al.  Antiweb-wheel inequalities and their separation problems over the stable set polytopes , 2002, Math. Program..

[5]  Martin W. P. Savelsbergh,et al.  The relation of time indexed formulations of single machine scheduling problems to the node packing problem , 2002, Math. Program..

[6]  A. Kononov,et al.  Competitive facility location models , 2009 .

[7]  Ralf Borndörfer,et al.  Set packing relaxations of some integer programs , 2000, Math. Program..

[8]  Eddie Cheng,et al.  Wheel inequalities for stable set polytopes , 1997, Math. Program..

[9]  Andrzej J. Osiadacz.  Integer and combinatorial optimization, George L. Nemhauser and Laurence A. Wolsey, Wiley-Interscience Series in Discrete Mathematics and Optimization, New York, 1988, ISBN 0-471-82819-X, 763pp, £71.90 , 1990 .

[10]  Giorgio Gambosi,et al.  Complexity and Approximation , 1999, Springer Berlin Heidelberg.

[11]  Igor Vasil'ev,et al.  A Computational Study of a Cutting Plane Algorithm for University Course Timetabling , 2005, J. Sched..

[12]  Martine Labbé,et al.  A strengthened formulation for the simple plant location problem with order , 2007, Oper. Res. Lett..

[13]  Fabrizio Rossi,et al.  A branch-and-cut algorithm for the maximum cardinality stable set problem , 2001, Oper. Res. Lett..

[14]  Giorgio Gambosi,et al.  Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .

[15]  Manfred W. Padberg,et al.  On the facial structure of set packing polyhedra , 1973, Math. Program..

[16]  Pierre Hansen,et al.  Lower Bounds for the Uncapacitated Facility Location Problem with User Preferences , 2004 .

[17]  Dominique Peeters,et al.  A facility location problem with clients' preference orderings , 1987 .