Article ID Journal Published Year Pages File Type
7543438 Discrete Optimization 2018 15 Pages PDF
Abstract
In this paper, we provide complete formulations for these polytopes and show the associated separation problem can be solved in polynomial time. The complete formulations in the original space of variables generally contain an exponential number of inequalities. Alternative extended compact formulations are also presented.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Control and Optimization
Preview
Complete formulations of polytopes related to extensions of assignment matrices
Authors
, , ,