branch-and-cut – Page 12 – Optimization Online

A Family of Facets for the p-Median Polytope

Published: 2000/12/13

Ismael de Farias

(Mixed) Integer Linear Programming, Branch and Cut Algorithms, Transportation branch-and-cut, cardinality constrained programming, facility location, mixed-integer programming, p-median

We present a nontrivial family of facet-defining inequalities for the p-median polytope. We incorporate the inequalities in a branch-and-cut scheme, and we report computational results that demonstrate their effectiveness. CitationDepartment of Industrial Engineering, State University of New York at Buffalo, submittedArticleDownload View PDF

A Family of Inequalities for the Generalized Assignment Polytope

Published: 2000/12/12

0-1 Programming, Branch and Cut Algorithms branch-and-cut, generalized assignment, integer programming

We present a family of inequalities that are valid for the generalized assignment polytope. Although the inequalities are not facet-defining in general, they define facets of a polytope of a relaxation. We report computational results on the use of the inequalities in a branch-and-cut scheme that demonstrate their effectiveness. CitationDepartment of Industrial Engineering, State University … Read more