Polyhedral results for the uncapacitated facility location problem: Lifting and separation

Conference · Sat Dec 31 04:00:00 EST 1994

OSTI ID:35747

Aardal, K; Gerards, A M.H.; Van Hoesel, C P.M.

The uncapacitated facility location problem is a basic problem in combinatorial optimization with many applications. Polyhedral techniques have been applied to the problem in a few studies, but little is known about the separation problem based on these inequalities. We first study a general class of inequalities developed by Cho, Johnson, Padberg and Rao, referred to as the class of combinatorial inequalities, and various liftings that have been proposed for these inequalities. These liftings either give rise to 0/1 coefficients or fractional coefficients, all having the same value. In some cases, the lifting coefficients can be determined analytically. We show that this is not possible for all combinatorial inequalities. Based on this observation we show examples how some well-known sub-classes of facets can be lifted using a more general scheme. We also discuss the separation problem based on the class of combinatorial inequalities, and the consequences of the lifting scheme for separation.

• OSTI ID: 35747
• Report Number(s): CONF-9408161--
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
ALGORITHMS
EFFICIENCY
MATRICES
NUMERICAL SOLUTION