Variable formulation search for the cutwidth minimization problem

Applied Soft Computing Journal

Volumn 13, Issue 5, 2013, Pages 2242-2252

  Pardo, Eduardo G ^a   Mladenović, Nenad ^b   Pantrigo, Juan J ^a   Duarte, Abraham ^a  

^a UNIVERSIDAD REY JUAN CARLOS   (Spain)

^b BRUNEL UNIVERSITY   (United Kingdom)

Author keywords

Cutwidth Minimization Problem; Discrete optimization; Formulation Space Search; Variable Formulation Search; Variable Neighbourhood Search

Indexed keywords

DISCRETE OPTIMIZATION; MINIMIZATION PROBLEMS; SPACE SEARCH; VARIABLE FORMULATION; VARIABLE NEIGHBOURHOOD SEARCH;

SOFT COMPUTING; SOFTWARE ENGINEERING;

OPTIMIZATION;

EID: 84875134472     PISSN: 15684946     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.asoc.2013.01.016     Document Type: Article

References (50)

1. D. Adolphson, and T.C. Hu Optimal linear ordering SIAM Journal on Applied Mathematics 25 1973 403 423
2. D.V. Andrade, and M.G.C. Resende GRASP with evolutionary path-relinking Seventh Metaheuristics International Conference (MIC). 2007
3. D.V. Andrade, and M.G.C. Resende GRASP with path-relinking for network migration scheduling Proceedings of International Network Optimization Conference (INOC). 2007
4. H.M. Azamathulla, A. Ab.Ghani, and S.Y. Fei Short communication: anfis-based approach for predicting sediment transport in clean sewer Applied Soft Computing 12 2012 1227 1230
5. H.M. Azamathulla, and F.C. Wu Support vector machine approach for longitudinal dispersion coefficients in natural streams Applied Soft Computing 11 2011 2902 2905
6. G. Blin, G. Fertin, D. Hermelin, and S. Vialette Fixed-parameter algorithms for protein similarity search under mRNA structure constraints Journal of Discrete Algorithms 6 2008 618 626
7. C. Blum, J. Puchinger, G.R. Raidl, and A. Roli Hybrid metaheuristics in combinatorial optimization: a survey Applied Soft Computing 11 2011 4135 4151
8. R.A. Botafogo Cluster analysis for hypertext systems 16th Annual International ACM-SIGIR Conference on Research and Development in Information Retrieval 1993 116 125
9. S. Butenko, O. Yezerska, B. Balasundaram, Variable objective search, Journal of Heuristics, http://dx.doi.org/10.1007/s10732-011-9174-2, in press.
10. M.J. Chung, F. Makedon, I.H. Sudborough, and J. Turner Polynomial time algorithms for the M in Cut problem on degree restricted trees SFCS'82: Proceedings of the 23rd Annual Symposium on Foundations of Computer Science IEEE Computer Society, Washington, DC, USA 1982 262 271 (Pubitemid 13468525)
11. J. Cohoon, and S. Sahni Exact algorithms for special cases of the board permutation problem Proceedings of the Allerton Conference on Communication, Control and Computing 1983 246 255 (Pubitemid 14659330)
12. J. Cohoon, and S. Sahni Heuristics for backplane ordering Journal of VLSI and Computer Systems 2 1987 37 61
13. J. Díaz, A. Gibbons, G.E. Pantziou, M.J. Serna, P.G. Spirakis, and J. Toran Parallel algorithms for the minimum cut and the minimum length tree layout problems Theoretical Computer Science 181 1997 267 287 (Pubitemid 127454108)
14. J. Díaz, J. Petit, and M.J. Serna A survey of graph layout problems ACM Computing Surveys (CSUR) 34 2002 313 356
15. A. Duarte, L.F. Escudero, R. Martí, N. Mladenović, J.J. Pantrigo, J. Sánchez-Oro, Variable Neighborhood Search for the Vertex Separation Problem, Technical Report, Universidad Rey Juan Carlos, 2012.
16. A. Duarte, R. Martí, M. Resende, and R. Silva Grasp with path relinking heuristics for the antibandwidth problem Networks 2011 171 189
17. T. Feo, and M.G.C. Resende Greedy randomized adaptive search procedures Journal of Global Optimization 1995 109 133
18. M.R. Garey, and D.S. Johnson Computers and Intractability: A Guide to the Theory of NP-Completeness 1979 W.H. Freeman USA
19. F. Gavril Some NP-complete problems on graphs Proceedings of the Eleventh Conference on Information Sciences and Systems Baltimore, MD 1977 91 95
20. M. Gendreau, and J.Y. Potvin 2nd ed. Handbook of Metaheuristics (International Series in Operations Research & Management Science) vol. 146 2010 Springer New York, USA
21. F. Glover, and G.A. Kochenberger Handbook of Metaheuristics (International Series in Operations Research & Management Science) 2003 Springer New York, USA
22. P. Hansen, N. Mladenović, J. Brimberg, and J.A. Moreno Pérez Variable neighbourhood search 2nd ed. Handbook of Metaheuristics 2010 Springer New York, USA pp. 61-86
23. P. Hansen, N. Mladenović, and J.A. Moreno Pérez Variable neighbourhood search: algorithms and applications Annals of Operations Research 175 2008 367 407
24. L.H. Harper Optimal numberings and isoperimetric problems on graphs Journal of Combinatorial Theory 1966 385 393
25. A. Hertz, M. Plumettaz, and N. Zufferey Variable space search for graph coloring Discrete Applied Mathematics 156 2008 2551 2560
26. D. Karger A randomized fully polynomial time approximation scheme for the all-terminal network reliability problem SIAM Journal on Computing 29 1999 492 514
27. Y. Kochetov, P. Kononova, and M. Paschenko Formulation space search approach for the teachers/class timetabling problem Yugoslav journal of Operations Research 2008 1 11
28. A. Lim, J.B.R. Lin, and F. Xiao Ant colony optimization with hill climbing for the bandwidth minimization problem Applied Soft Computing 6 2006 180 188 (Pubitemid 43069240)
29. C. LA3pez, and J. Beasley A heuristic for the circle packing problem with a variety of containers European Journal of Operational Research 214 2011 512 525
30. J. Luttamaguzi, M. Pelsmajer, Z. Shen, B. Yang, Integer programming solutions for several optimization problems in graph theory, Technical Report, Center for Discrete Mathematics and Theoretical Computer Science, DIMACS, 2005.
31. F. Makedon, and I.H. Sudborough On minimizing width in linear layouts Discrete Applied Mathematics 23 1989 243 265
32. F.S. Makedon, C.H. Papadimitriou, and I.H. Sudborough Topological bandwidth SIAM Journal on Algebraic and Discrete Methods 6 1985 418 444
33. R. Martí, J.J. Pantrigo, A. Duarte, and E.G. Pardo Branch and bound for the cutwidth minimization problem Computers & Operations Research 40 2013 137 149
34. N. Mladenović, and P. Hansen Variable Neighborhood Search Computers & Operations Research 24 1997 1097 1100
35. N. Mladenović, F. Plastria, and D. Urošević Reformulation descent applied to circle packing problems Computers & Operations Research 32 2005 2419 2434 (Pubitemid 40118819)
36. N. Mladenović, F. Plastria, and D. Urošević Formulation space search for circle packing problems T. Stützle, M. Birattari, H. Hoos, Engineering Stochastic Local Search Algorithms, Designing, Implementing and Analyzing Effective Heuristics, vol. 4638 of Lecture Notes In Computer Science 2007 Springer Berlin/Heidelberg 212 216
37. P. Mutzel A polyhedral approach to planar augmentation and related problems ESA'95: Proceedings of the Third Annual European Symposium on Algorithms 1995 Springer-Verlag London, UK 494 507
38. J.J. Pantrigo, R. Martí, A. Duarte, and E.G. Pardo Scatter search for the cutwidth minimization problem Annals of Operations Research 199 2012 10.1007/s10479-011-0907-2
39. J. Petit Experiments on the minimum linear arrangement problem ACM Journal of Experimental Algorithmics 2003 8
40. E. Piñana, I. Plana, V. Campos, and R. Martí GRASP and path relinking for the matrix bandwidth m inimization European Journal of Operational Research 153 2004 200 210
41. A. Raspaud, H. Schröder, O. Sýkora, L. Torok, and I. Vrt'o Antibandwidth and cyclic antibandwidth of meshes and hypercubes 7th International Colloquium on Graph Theory-ICGT 05 Discrete Mathematics 309 2009 3541 3552
42. M.G.C. Resende, D.V. Andrade, Method and system for Network Migration Scheduling, United States Patent Application Publication US2009/0168665, 2009.
43. M.G.C. Resende, R. Martí, M. Gallego, and A. Duarte Grasp and path relinking for the max-min diversity problem Computers and Operations Research 37 2010 498 508
44. J. Rolim, O. Sýkora, and I. Vrt'o Optimal cutwidths and bisection widths of 2- and 3-dimensional meshes Graph-Theoretic Concepts in Computer Science, vol. 1017 of Lecture Notes In Computer Science 1995 Springer Berlin/Heidelberg 252 264 (Pubitemid 126004131)
45. J. Sanchez-Oro, M. Laguna, A. Duarte, R. Martí, Scatter Search for the Profile minimization problem, Technical Report, Universidad Rey Juan Carlos, 2012.
46. T. Schiavinotto, and T. Stützle The linear ordering problem: instances, search space analysis and algorithms Journal of Mathematical Modelling and Algorithms 3 2004 367 402 (Pubitemid 40317584)
47. F. Shahrokhi, O. Sýkora, L.A. Székely, and I. Vrt'o On bipartite drawings and the linear arrangement problem SIAM Journal on Computing 30 2001 1773 1789 (Pubitemid 34125436)
48. K. Takagi, and N. Takagi Minimum Cut Linear Arrangement of p-q dags for VLSI layout of adder trees. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E82-A 1999 767 774
49. D.M. Thilikos, M.J. Serna, and H.L. Bodlaender Cutwidth II: algorithms for partial w-trees of bounded degree Journal of Algorithms 56 2005 25 49 (Pubitemid 40786385)
50. M. Yannakakis A polynomial algorithm for the M in-Cut linear arrangement of trees Journal of the ACM (JACM) 32 1985 950 988 (Pubitemid 15580696)