Sebastian J. Miller

New Valid Inequalities and Facets for the Simple Plant Location Problem

  • Laura Galli
  • Adam N. Letchford
  • Sebastian J. Miller
    • Categories Polyhedra, Production and Logistics

    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 … Read more

    An aggressive reduction scheme for the simple plant location problem

  • Adam N. Letchford
  • Sebastian J. Miller
    • Categories Combinatorial Optimization, Integer Programming, Network Optimization Tags ,

    Pisinger et al. introduced the concept of `aggressive reduction’ for large-scale combinatorial optimisation problems. The idea is to spend much time and effort in reducing the size of the instance, in the hope that the reduced instance will then be small enough to be solved by an exact algorithm. We present an aggressive reduction scheme … Read more