A family of facets for the uncapacitated p-median polytope

Research output: Contribution to journalArticlepeer-review

21 Scopus citations

Abstract

A nontrivial family of facet-defining inequalities for the uncapacitated p-median polytope is presented. The inequalities in a branch-and-cut scheme was incorporated and computational results that demonstrate their effectiveness were presented.

Original languageEnglish
Pages (from-to)161-167
Number of pages7
JournalOperations Research Letters
Volume28
Issue number4
DOIs
StatePublished - May 2001

Keywords

  • Branch-and-cut
  • Cardinality constrained programming
  • Facility location
  • Mixed-integer programming
  • p-median

Fingerprint Dive into the research topics of 'A family of facets for the uncapacitated p-median polytope'. Together they form a unique fingerprint.

Cite this