A new integer linear programming model for the cutwidth minimization problem of a connected undirected graph

Abstract

In this chapter we propose a new integer linear programming model based on precedences for the cutwidth minimization problem (CWP). A review of the literature indicates that this model is the only one reported for this problem. The results of the experiments with standard instances shows that the solution of the problem with the proposed model outperforms in quality and efficiency to the one reported in the state of the art. Our model increases the number of optimal solutions by 38.46% and the gap reduction by 45.56%. Moreover, this quality improvement is reached with a time solution reduction of 41.73%. It is considered that the approach used in this work can be used in other linear ordering problems.