Formulations for piecewise-convex problems

We study Mixed-Integer Non-Linear Programming with piecewise- convex functions and compare two different formulations: the incre- mental and the multiple-choice model. We show with computational re- sults that the continuous relaxation of the two formulations is equiv- alent for two pieces but not for four.