{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T00:03:10Z","timestamp":1752451390645,"version":"3.41.2"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1023\/a:1022371615202","type":"journal-article","created":{"date-parts":[[2003,3,28]],"date-time":"2003-03-28T17:25:21Z","timestamp":1048872321000},"page":"143-171","source":"Crossref","is-referenced-by-count":27,"title":["Removing Node Overlapping in Graph Layout Using Constrained Optimization"],"prefix":"10.1007","volume":"8","author":[{"given":"Kim","family":"Marriott","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Stuckey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"Tam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weiqing","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5115499_CR1","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0377-2217(89)90355-X","volume":"39","author":"E. H. L. Aarts","year":"1989","unstructured":"Aarts, E. H. L., & Korst, J. H. M. (1989). Boltzmann machines for traveling salesman problems. European Journal of Operational Research, 39: 79\u201395.","journal-title":"European Journal of Operational Research"},{"key":"5115499_CR2","doi-asserted-by":"crossref","unstructured":"Adorf, H., & Johnston, M. (1990). A discrete stochastic neural network algorithm for constraint satisfaction problems. In Proceedings of the International Joint Conference on Neural Networks, pages 917\u2013924.","DOI":"10.1109\/IJCNN.1990.137951"},{"key":"5115499_CR3","doi-asserted-by":"crossref","unstructured":"B\u00f6hringer, K., & Paulisch, F. N. (1990). Using constraints to achieve stability in automatic graph layout algorithms. In CHI'90 Proceedings, pages 43\u201351, ACM.","DOI":"10.1145\/97243.97250"},{"key":"5115499_CR4","doi-asserted-by":"crossref","unstructured":"Borning, A., Marriott, K., Stuckey, P., & Xiao, Y. (1997). Solving linear arithmetic constraints for user interface applications. In Proceedings of the 1997 ACM Symposium on User Interface Software and Technology, pages 87\u201396.","DOI":"10.1145\/263407.263518"},{"key":"5115499_CR5","unstructured":"Davenport, A., Tsang, E. P. K., Wang, C. J., & Zhu, K. (1994). GENET: A connectionist architecture for solving constraint satisfaction problems by iterative improvement. In Proceedings of AAAI'94, pages 325\u2013330."},{"key":"5115499_CR6","unstructured":"di Battista, T., Eades, P., Tamassia, R., & Tollis, I. G. (1999). Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall."},{"key":"5115499_CR7","doi-asserted-by":"crossref","unstructured":"Dozier, G., Bowen, J., & Bahler, D. (1994). Solving small and large scale constraint satisfaction problems using a heuristic-based microgenetic algorithm. In Proceedings of the IEEE International Conference on Evolutionary Computation, pages 306\u2013311.","DOI":"10.1109\/ICEC.1994.349934"},{"key":"5115499_CR8","unstructured":"Eades, P., Lai, W., Misue, K., & Sugiyama, K. (1991). Preserving the mental map of a diagram. Technical Report IIAS-RR-91-16E, International Institute for Advanced Study of Social Information Science, Fujitsu Laboratories"},{"key":"5115499_CR9","unstructured":"He, W., & Marriott, K. (1998). Removing node overlapping using constrained optimization. In Australasian Computer Science Conference, pages 169\u2013180, Springer-Verlag."},{"key":"5115499_CR10","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1006\/jvlc.1998.0094","volume":"9","author":"M. L. Huang","year":"1998","unstructured":"Huang, M. L., Eades, P., & Wang, J. (1998). On-line animated visualization of huge graphs using a modified spring algorithm. Journal of Visual Languages and Computing, 9: 623\u2013645.","journal-title":"Journal of Visual Languages and Computing"},{"key":"5115499_CR11","doi-asserted-by":"crossref","unstructured":"Lee, J. H. M., Leung, H. F., & Won, H. W. (1995). Extending GENET for non-binary CSP's. In Proceedings of Seventh International Conference on Tools with Artificial Intelligence, pages 338\u2013343.","DOI":"10.1109\/TAI.1995.479651"},{"key":"5115499_CR12","doi-asserted-by":"crossref","unstructured":"Lee, J. H. M., Leung, H. F., & Won, H. W. (1996). Towards a more efficient stochastic constraint solver. In Proceedings of Principles and Practice of Constraint Programming (CP96), LNCS 1118, pages 338\u2013352.","DOI":"10.1007\/3-540-61551-2_85"},{"key":"5115499_CR13","unstructured":"Leunberger, D. G. (1994). Linear and Nonlinear Programming. Addison-Wesley Publishing Company."},{"issue":"11","key":"5115499_CR14","doi-asserted-by":"crossref","first-page":"1183","DOI":"10.1002\/spe.4380251102","volume":"25","author":"P. L\u00fcders","year":"1995","unstructured":"L\u00fcders, P., Ernst, R., & Stille, S. (1995). An approach to automatic display layout using combinatorial optimization. Software-Practice and Experience, 25(11): 1183\u20131202.","journal-title":"Software-Practice and Experience"},{"key":"5115499_CR15","unstructured":"Lyons, K. A. (1996). Cluster busting in anchored graph drawing. Ph.D. thesis, Department of Computing & Information Science Queen's University."},{"issue":"1","key":"5115499_CR16","first-page":"99","volume":"8","author":"A. K. Mackworth","year":"1997","unstructured":"Mackworth, A. K. (1997). Consistency in networks of relations. AI Journal, 8(1): 99\u2013118.","journal-title":"AI Journal"},{"key":"5115499_CR17","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0004-3702(92)90007-K","volume":"58","author":"S. Minton","year":"1992","unstructured":"Minton, S., Johnston, M. D., Phillips, A. B., & Laird, P. (1992). Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence, 58: 161\u2013205.","journal-title":"Artificial Intelligence"},{"key":"5115499_CR18","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1006\/jvlc.1995.1010","volume":"6","author":"K. Misue","year":"1995","unstructured":"Misue, K., Eades, P., Lai, W., & Sugiyama, K. (1995). Layout adjustment and the mental map. Journal of Visual Languages and Computing, 6: 183\u2013210.","journal-title":"Journal of Visual Languages and Computing"},{"key":"5115499_CR19","first-page":"371","volume-title":"Proceedings of International Symposium on Graph Drawing, GD'96","author":"A. Papakostas","year":"1997","unstructured":"Papakostas, A., Six, J. M., & Tollis, I. G. (1997). Experimental and theoretical results in interactive orthogonal graph drawing. In Proceedings of International Symposium on Graph Drawing, GD'96, LNCS 1190, pages 371\u2013386, New York: Springer."},{"issue":"S1","key":"5115499_CR20","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1002\/spe.4380201307","volume":"20","author":"F. N. Paulisch","year":"1990","unstructured":"Paulisch, F. N., & Tichy, W. F. (1990). Edge: an extendible graph editor. Software-Practice and Experience, 20(S1): 63\u201388.","journal-title":"Software-Practice and Experience"},{"key":"5115499_CR21","volume-title":"Nonlinear Programming for Operations Research","author":"D. M. Simmons","year":"1975","unstructured":"Simmons, D. M. (1975). Nonlinear Programming for Operations Research. Englewood Cliffs, NJ: Prentice-Hall."},{"key":"5115499_CR22","doi-asserted-by":"crossref","unstructured":"Storey, M. D., & M\u00fcller, H. A. (1995). Graph layout adjustment strategies. In Symposium on Graph Drawing, GD'95, LNCS 1027, pages 487\u2013499, Springer-Verlag.","DOI":"10.1007\/BFb0021833"},{"key":"5115499_CR23","unstructured":"Tsang, E. (1993). Foundations of Constraint Satisfaction. Academic Press."},{"issue":"2","key":"5115499_CR24","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1016\/S0377-2217(98)00099-X","volume":"11","author":"C. Voudoris","year":"1999","unstructured":"Voudoris, C., & Tsang, E., (1999). Guided local search and its application to the travelling saleman problem. European Journal of Operational Research, 11(2): 469\u2013499.","journal-title":"European Journal of Operational Research"},{"key":"5115499_CR25","unstructured":"Voudouris, C. (1997). Guided local search for combinatorial optimization problems. Ph.D. thesis, Department of Computer Science, University of Essex."},{"key":"5115499_CR26","unstructured":"Voudouris, C., & Tsang, E. (1996). Partial constraint satisfaction problems and guided local search. In Proceedings of Practical Application of Constraint Technology, PACT96, pages 337\u2013356."},{"key":"5115499_CR27","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1016\/S0377-2217(98)00099-X","volume":"113","author":"C. Voudouris","year":"1999","unstructured":"Voudouris, C., & Tsang, E. (1999). Guided local search and its application to the traveling salesman problem. European Journal of Operational Research, 113: 469\u2013499.","journal-title":"European Journal of Operational Research"},{"key":"5115499_CR28","unstructured":"Walsh, G. R. (1975). Methods of Optimization. John Wiley and Sons."},{"key":"5115499_CR29","unstructured":"Wang, C., & Tsang, E. (1991). Solving satisfaction problems using neural-networks. In Proceedings of IEE Second International Conference on Artificial Neural Networks, pages 295\u2013299."}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1022371615202.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1022371615202\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1022371615202.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:41:28Z","timestamp":1752378088000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1022371615202"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["5115499"],"URL":"https:\/\/doi.org\/10.1023\/a:1022371615202","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"type":"print","value":"1383-7133"},{"type":"electronic","value":"1572-9354"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}