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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Garey, M., Johnson, L.: Some simplified NP-complete graph problems. Theoret. Comput. Sci. 1(3), 237–267 (1976)
Díaz, J., Petit, J., Serna, M.: A survey of graph layout problems. ACM. Comput. Surv. (CSUR) 34(3), 313–356 (2002)
Andrade, D.V., Resende, M.G.C.: GRASP with path-relinking for network migration scheduling. In: Proceedings of the International Network Optimization Conference (INOC 2007), Citeseer, (2007)
Luttamaguzi, J., Pelsmajer, M., Shen, Z., Yang, B.: Integer programming solutions for several optimization problems in graph theory, In: 20th International Conference on Computers and Their Applications (CATA 2005), 2005
Fortet, R.: Applications de l’algébre de boole en recherche opérationnelle. Rev. Fr. de Rech. Opérationelle 4, 17–26 (1960)
Chen, D.-S., Batson, R.G., Dang, Y.: Applied Integer Programming: Modeling and Solution. Wiley, (2010)
Martí, R., Pantrigo, J.J., Duarte, A., Pardo, E.G.: Branch and bound for the cutwidth minimization problem. Comput. Oper. Res. 40(1), 137–149 (2013)
Acknowledgments
This research project has been partly financed by the CONACyT, the COTACyT, the DGEST and the University of Luxembourg. Additionally, we thank the IBM Academic Initiative for the support of this research project with the optimization software CPLEX, version 12.1.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this chapter
Cite this chapter
López-Locés, M.C. et al. (2014). A New Integer Linear Programming Model for the Cutwidth Minimization Problem of a Connected Undirected Graph. In: Castillo, O., Melin, P., Pedrycz, W., Kacprzyk, J. (eds) Recent Advances on Hybrid Approaches for Designing Intelligent Systems. Studies in Computational Intelligence, vol 547. Springer, Cham. https://doi.org/10.1007/978-3-319-05170-3_35
Download citation
DOI: https://doi.org/10.1007/978-3-319-05170-3_35
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-05169-7
Online ISBN: 978-3-319-05170-3
eBook Packages: EngineeringEngineering (R0)