Optimization Online


New Valid Inequalities and Facets for the Simple Plant Location Problem

Laura Galli (laura.galli***at***unipi.it)
Adam N. Letchford (A.N.Letchford***at***lancaster.ac.uk)
Sebastian J. Miller (sebmiller64***at***hotmail.co.uk)

Abstract: The Simple Plant Location Problem is a well-known (and NP-hard) combinatorial optimisation problem, with applications in logistics. We present a new family of valid inequalities for the associated family of polyhedra, and show that it contains an exponentially large number of new facet-defining members. We also present a new procedure, called facility augmentation, which enables one to derive even more valid and facet-defining inequalities.

Keywords: facility location; combinatorial optimisation; branch-and-cut; polyhedral combinatorics

Category 1: Combinatorial Optimization (Polyhedra )

Category 2: Applications -- OR and Management Sciences (Production and Logistics )

Citation: Accepted to appear in European Journal of Operational Research, March 2018.


Entry Submitted: 08/04/2015
Entry Accepted: 08/28/2015
Entry Last Modified: 03/06/2018

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society