TY - JOUR
T1 - The piecewise linear optimization polytope
T2 - New inequalities and intersection with semi-continuous constraints
AU - Zhao, Ming
AU - De Farias, Ismael Regis
PY - 2013/10
Y1 - 2013/10
N2 - We give new facets and valid inequalities for the separable piecewise linear optimization (SPLO) knapsack polytope. We also extend the inequalities to the case in which some of the variables are semi-continuous. Finally, we give computational results that demonstrate their efficiency in solving difficult instances of SPLO and SPLO with semi-continuous constraints.
AB - We give new facets and valid inequalities for the separable piecewise linear optimization (SPLO) knapsack polytope. We also extend the inequalities to the case in which some of the variables are semi-continuous. Finally, we give computational results that demonstrate their efficiency in solving difficult instances of SPLO and SPLO with semi-continuous constraints.
KW - Branch-and-cut
KW - Knapsack problem
KW - Mixed-integer programming
KW - Piecewise linear optimization
KW - Polyhedral method
KW - Semi-continuous variables
KW - Special ordered set
UR - http://www.scopus.com/inward/record.url?scp=84884676023&partnerID=8YFLogxK
U2 - 10.1007/s10107-012-0517-z
DO - 10.1007/s10107-012-0517-z
M3 - Article
AN - SCOPUS:84884676023
VL - 141
SP - 217
EP - 255
JO - Mathematical Programming
JF - Mathematical Programming
SN - 0025-5610
IS - 1-2
ER -