{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T10:37:00Z","timestamp":1764153420451,"version":"3.46.0"},"reference-count":67,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T00:00:00Z","timestamp":1760745600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T00:00:00Z","timestamp":1760745600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach. Intell. Res."],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s11633-024-1532-2","type":"journal-article","created":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T00:32:01Z","timestamp":1760747521000},"page":"1153-1166","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Degree-aware Progressive Contrastive Learning for Graph Combinatorial Optimization Problems"],"prefix":"10.1007","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-3389-9875","authenticated-orcid":false,"given":"Shiyun","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Yang","family":"Wu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9190-3509","authenticated-orcid":false,"given":"Yifan","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,18]]},"reference":[{"issue":"5","key":"1532_CR1","doi-asserted-by":"publisher","first-page":"C589","DOI":"10.1137\/14100018X","volume":"37","author":"R A Rossi","year":"2015","unstructured":"R. A. Rossi, D. F. Gleich, A. H. Gebremedhin. Parallel maximum clique algorithms with applications to network analysis. SIAM Journal on Scientific Computing, vol. 37, no. 5, pp. C589\u2013C616, 2015. DOI: https:\/\/doi.org\/10.1137\/14100018X.","journal-title":"SIAM Journal on Scientific Computing"},{"issue":"11","key":"1532_CR2","doi-asserted-by":"publisher","first-page":"1168","DOI":"10.1109\/34.42855","volume":"11","author":"R Horaud","year":"1989","unstructured":"R. Horaud, T. Skordas. Stereo correspondence through feature grouping and maximal cliques. IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 11, no. 11, pp. 1168\u20131180, 1989. DOI: https:\/\/doi.org\/10.1109\/34.42855.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"1532_CR3","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2005.29","volume-title":"Proceedings of ACM\/IEEE Conference on Supercomputing","author":"Y Zhang","year":"2005","unstructured":"Y. Zhang, F. N. Abu-Khzam, N. E. Baldwin, E. J. Chesler, M. A. Langston, N. F. Samatova. Genome-scale computational approaches to memory-intensive applications in systems biology. In Proceedings of ACM\/IEEE Conference on Supercomputing, Seattle, USA, 2005. DOI: https:\/\/doi.org\/10.1109\/SC.2005.29."},{"key":"1532_CR4","first-page":"2692","volume-title":"Proceedings of the 28th International Conference on Neural Information Processing Systems","author":"O Vinyals","year":"2015","unstructured":"O. Vinyals, M. Fortunato, N. Jaitly. Pointer networks. In Proceedings of the 28th International Conference on Neural Information Processing Systems, Montreal, Canada, pp. 2692\u20132700, 2015."},{"key":"1532_CR5","volume-title":"Proceedings of the 33rd International Conference on Neural Information Processing Systems","author":"X Chen","year":"2019","unstructured":"X. Chen, Y. Tian. Learning to perform local rewriting for combinatorial optimization. In Proceedings of the 33rd International Conference on Neural Information Processing Systems, Vancouver, Canada, Article number 564, 2019."},{"key":"1532_CR6","doi-asserted-by":"publisher","DOI":"10.1109\/DSW.2018.8439919","volume-title":"Proceedings of IEEE Data Science Workshop","author":"A Nowak","year":"2018","unstructured":"A. Nowak, S. Villar, A. S. Bandeira, J. Bruna. Revised note on learning quadratic assignment with graph neural networks. In Proceedings of IEEE Data Science Workshop, Lausanne, Switzerland, 2018. DOI: https:\/\/doi.org\/10.1109\/DSW.2018.8439919."},{"key":"1532_CR7","doi-asserted-by":"publisher","unstructured":"R. Hu, J. Xu, B. Chen, M. Gong, H. Zhang, H. Huang. TAP-Net: Transport-and-pack using reinforcement learning. ACM Transactions on Graphics, vol. 39, no. 6, Article number 232, 2020. DOI: https:\/\/doi.org\/10.1145\/3414685.3417796.","DOI":"10.1145\/3414685.3417796"},{"key":"1532_CR8","doi-asserted-by":"publisher","unstructured":"J. T\u00f6nshoff, M. Ritzert, H. Wolf, M. Grohe. Graph neural networks for maximum constraint satisfaction. Frontiers in Artificial Intelligence, vol. 3, Article number 580607, 2021. DOI: https:\/\/doi.org\/10.3389\/frai.2020.580607.","DOI":"10.3389\/frai.2020.580607"},{"key":"1532_CR9","volume-title":"Proceedings of the 34th International Conference on Neural Information Processing Systems","author":"N Karalias","year":"2020","unstructured":"N. Karalias, A. Loukas. Erd\u0151s goes neural: An unsupervised learning framework for combinatorial optimization on graphs. In Proceedings of the 34th International Conference on Neural Information Processing Systems, Vancouver, Canada, Article number 559, 2020."},{"key":"1532_CR10","volume-title":"Proceedings of the 35th International Conference on Neural Information Processing Systems","author":"R Wang","year":"2021","unstructured":"R. Wang, Z. Hua, G. Liu, J. Zhang, J. Yan, F. Qi, S. Yang, J. Zhou, X. Yang. A bi-level framework for learning to solve combinatorial optimization on graphs. In Proceedings of the 35th International Conference on Neural Information Processing Systems, Article number 1641, 2021."},{"key":"1532_CR11","volume-title":"Proceedings of the 40th International Conference on Machine Learning","author":"A Ferber","year":"2023","unstructured":"A. Ferber, T. Huang, D. Zha, M. Schubert, B. Steiner, B. Dilkina, Y. Tian. SurCo: Learning linear surrogates for combinatorial nonlinear optimization problems. In Proceedings of the 40th International Conference on Machine Learning, Honolulu, USA, Article number 402, 2023."},{"issue":"4","key":"1532_CR12","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1038\/s42256-022-00468-6","volume":"4","author":"M J A Schuetz","year":"2022","unstructured":"M. J. A. Schuetz, J. K. Brubaker, H. G. Katzgraber. Combinatorial optimization with physics-inspired graph neural networks. Nature Machine Intelligence, vol. 4, no. 4, pp. 367\u2013377, 2022. DOI: https:\/\/doi.org\/10.1038\/s42256-022-00468-6.","journal-title":"Nature Machine Intelligence"},{"key":"1532_CR13","volume-title":"Unsupervised learning for combinatorial optimization needs Meta-Learning","author":"H Wang","year":"2023","unstructured":"H. Wang, P. Li. Unsupervised learning for combinatorial optimization needs Meta-Learning, [Online], Available: https:\/\/arxiv.org\/abs\/2301.03116, 2023."},{"key":"1532_CR14","volume-title":"Proceedings of the 37th International Conference on Neural Information Processing Systems","author":"D Zhang","year":"2024","unstructured":"D. Zhang, H. Dai, N. Malkin, A. Courville, Y. Bengio, L. Pan. Let the flows h]Solving graph combinatorial optimization problems with GFlowNets. In Proceedings of the 37th International Conference on Neural Information Processing Systems, New Orleans, USA, Article number 522, 2024."},{"key":"1532_CR15","volume-title":"Proceedings of the 7th International Conference on Learning Representations","author":"S Amizadeh","year":"2019","unstructured":"S. Amizadeh, S. Matusevych, M. Weimer. Learning to solve circuit-SAT: An unsupervised differentiable approach. In Proceedings of the 7th International Conference on Learning Representations, New Orleans, USA, 2019."},{"key":"1532_CR16","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1007\/978-3-030-24051-6_58","volume-title":"Proceedings of International Conference on Artificial Intelligence, Smart Grid and Smart City Applications","author":"K Sindhu Meena","year":"2020","unstructured":"K. Sindhu Meena, S. Suriya. A survey on supervised and unsupervised learning techniques. In Proceedings of International Conference on Artificial Intelligence, Smart Grid and Smart City Applications, L. Ashok Kumar, L. S. Jayashree, R. Manimegalai, Eds., Cham, Germany: Springer, pp. 627\u2013644, 2020. DOI: https:\/\/doi.org\/10.1007\/978-3-030-24051-6_58."},{"key":"1532_CR17","volume-title":"Annealed training for combinatorial optimization on graphs","author":"H Sun","year":"2022","unstructured":"H. Sun, E. K. Guha, H. Dai. Annealed training for combinatorial optimization on graphs, [Online], Available: https:\/\/arxiv.org\/abs\/2207.11542v1, 2022."},{"key":"1532_CR18","volume-title":"Proceedings of the 36th International Conference on Neural Information Processing Systems","author":"Y Min","year":"2022","unstructured":"Y. Min, F. Wenkel, M. A. Perlmutter, G. Wolf. Can hybrid geometric scattering networks help solve the maximum clique problem? In Proceedings of the 36th International Conference on Neural Information Processing Systems, New Orleans, USA, Article number 1650, 2022."},{"key":"1532_CR19","volume-title":"Proceedings of the 36th International Conference on Neural Information Processing Systems","author":"H Wang","year":"2022","unstructured":"H. Wang, N. Wu, H. Yang, C. Hao, P. Li. Unsupervised learning for combinatorial optimization with principled objective relaxation. In Proceedings of the 36th International Conference on Neural Information Processing Systems, New Orleans, USA, Article number 2280, 2022."},{"key":"1532_CR20","doi-asserted-by":"publisher","first-page":"193907","DOI":"10.1109\/ACCESS.2020.3031549","volume":"8","author":"P H Le-Khac","year":"2020","unstructured":"P. H. Le-Khac, G. Healy, A. F. Smeaton. Contrastive representation learning: A framework and review. IEEE Access, vol. 8, pp. 193907\u2013193934, 2020. DOI: https:\/\/doi.org\/10.1109\/ACCESS.2020.3031549.","journal-title":"IEEE Access"},{"key":"1532_CR21","first-page":"5627","volume-title":"Proceedings of the 39th International Conference on Machine Learning","author":"H Duan","year":"2022","unstructured":"H. Duan, P. Vaezipoor, M. B. Paulus, Y. Ruan, C. Maddison. Augment with care: Contrastive learning for combinatorial problems. In Proceedings of the 39th International Conference on Machine Learning, Baltimore, USA, pp. 5627\u20135642, 2022."},{"key":"1532_CR22","volume-title":"Proceedings of the 40th International Conference on Machine Learning","author":"T Huang","year":"2023","unstructured":"T. Huang, A. Ferber, Y. Tian, B. Dilkina, B. Steiner. Searching large neighborhoods for integer linear programs with contrastive learning. In Proceedings of the 40th International Conference on Machine Learning, Honolulu, USA, Article number 563, 2023."},{"key":"1532_CR23","first-page":"2418","volume-title":"Proceedings of the 27th European Conference on Artificial Intelligence","author":"J Cai","year":"2024","unstructured":"J. Cai, T. Huang, B. Dilkina. Learning backdoors for mixed integer linear programs with contrastive learning. In Proceedings of the 27th European Conference on Artificial Intelligence, Santiago de Compostela, Spain, pp. 2418\u20132425, 2024."},{"issue":"4","key":"1532_CR24","doi-asserted-by":"publisher","first-page":"4367","DOI":"10.1109\/TNNLS.2024.3371592","volume":"35","author":"M Li","year":"2024","unstructured":"M. Li, A. Micheli, Y. G. Wang, S. Pan, P. Li\u00f3, G. Stefano Gnecco, M. Sanguineti. Guest editorial: Deep neural networks for graphs: Theory, models, algorithms, and applications. IEEE Transactions on Neural Networks and Learning Systems, vol. 35, no. 4, pp. 4367\u20134372, 2024. DOI: https:\/\/doi.org\/10.1109\/TNNLS.2024.3371592.","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"issue":"3","key":"1532_CR25","doi-asserted-by":"publisher","first-page":"2751","DOI":"10.1109\/TPAMI.2022.3183143","volume":"45","author":"C Huang","year":"2023","unstructured":"C. Huang, M. Li, F. Cao, H. Fujita, Z. Li, X. Wu. Are graph convolutional networks with random weights feasible? IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 45, no. 3, pp. 2751\u20132768, 2023. DOI: https:\/\/doi.org\/10.1109\/TPAMI.2022.3183143.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"1532_CR26","volume-title":"Proceedings of the 34th International Conference on Neural Information Processing Systems","author":"R Wang","year":"2020","unstructured":"R. Wang, J. Yan, X. Yang. Graduated assignment for joint multi-graph matching and clustering with application to unsupervised graph matching network learning. In Proceedings of the 34th International Conference on Neural Information Processing Systems, Vancouver, Canada, Article number 1671, 2020."},{"issue":"2","key":"1532_CR27","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.ejor.2020.07.063","volume":"290","author":"Y Bengio","year":"2021","unstructured":"Y. Bengio, A. Lodi, A. Prouvost. Machine learning for combinatorial optimization: A methodological tour d\u2019horizon. European Journal of Operational Research, vol. 290, no. 2, pp. 405\u2013421, 2021. DOI: https:\/\/doi.org\/10.1016\/j.ejor.2020.07.063.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"1532_CR28","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1016\/j.ejor.2014.09.064","volume":"242","author":"Q Wu","year":"2015","unstructured":"Q. Wu, J. K. Hao. A review on algorithms for maximum clique problems. European Journal of Operational Research, vol. 242, no. 3, pp. 693\u2013709, 2015. DOI: https:\/\/doi.org\/10.1016\/j.ejor.2014.09.064.","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"1532_CR29","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/0167-6377(90)90057-C","volume":"9","author":"R Carraghan","year":"1990","unstructured":"R. Carraghan, P. M. Pardalos. An exact algorithm for the maximum clique problem. Operations Research Letters, vol. 9, no. 6, pp. 375\u2013382, 1990. DOI: https:\/\/doi.org\/10.1016\/0167-6377(90)90057-C.","journal-title":"Operations Research Letters"},{"issue":"4","key":"1532_CR30","doi-asserted-by":"publisher","first-page":"545","DOI":"10.3390\/a5040545","volume":"5","author":"P Prosser","year":"2012","unstructured":"P. Prosser. Exact algorithms for maximum clique: A computational study. Algorithms, vol. 5, no. 4, pp. 545\u2013587, 2012. DOI: https:\/\/doi.org\/10.3390\/a5040545.","journal-title":"Algorithms"},{"key":"1532_CR31","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/3-540-45066-1_22","volume-title":"Proceedings of the 4th International Conference on Discrete Mathematics and Theoretical Computer Science","author":"E Tomita","year":"2003","unstructured":"E. Tomita, T. Seki. An efficient branch-and-bound algorithm for finding a maximum clique. In Proceedings of the 4th International Conference on Discrete Mathematics and Theoretical Computer Science, Dijon, France, pp. 278\u2013289, 2003. DOI: https:\/\/doi.org\/10.1007\/3-540-45066-1_22."},{"issue":"1","key":"1532_CR32","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s10898-006-9039-7","volume":"37","author":"E Tomita","year":"2007","unstructured":"E. Tomita, T. Kameda. An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments. Journal of Global Optimization, vol. 37, no. 1, pp. 95\u2013111, 2007. DOI: https:\/\/doi.org\/10.1007\/s10898-006-9039-7.","journal-title":"Journal of Global Optimization"},{"issue":"6","key":"1532_CR33","doi-asserted-by":"publisher","first-page":"1286","DOI":"10.1587\/transinf.E96.D.1286","volume":"E96-D","author":"E Tomita","year":"2013","unstructured":"E. Tomita, Y. Sutani, T. Higashi, M. Wakatsuki. A simple and faster branch-and-bound algorithm for finding a maximum clique with computational experiments. IEICE Transactions on Information and Systems, vol. E96-D, no. 6, pp. 1286\u20131298, 2013. DOI: https:\/\/doi.org\/10.1587\/transinf.E96.D.1286.","journal-title":"IEICE Transactions on Information and Systems"},{"issue":"3","key":"1532_CR34","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1016\/0743-7315(92)90072-U","volume":"14","author":"N Funabiki","year":"1992","unstructured":"N. Funabiki, Y. Takefuji, K. C. Lee. A neural network model for finding a near-maximum clique. Journal of Parallel and Distributed Computing, vol. 14, no. 3, pp. 340\u2013344, 1992. DOI: https:\/\/doi.org\/10.1016\/0743-7315(92)90072-U.","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"1","key":"1532_CR35","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1287\/ijoc.11.1.15","volume":"11","author":"K A Smith","year":"1999","unstructured":"K. A. Smith. Neural networks for combinatorial optimization: A review of more than a decade of research. INFORMS Journal on Computing, vol. 11, no. 1, pp. 15\u201334, 1999. DOI: https:\/\/doi.org\/10.1287\/ijoc.11.1.15.","journal-title":"INFORMS Journal on Computing"},{"key":"1532_CR36","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/978-3-030-04221-9_48","volume-title":"Proceedings of the 32nd International Conference on Neural Information Processing Systems","author":"Z Li","year":"2018","unstructured":"Z. Li, Q. Chen, V. Koltun. Combinatorial optimization with graph convolutional networks and guided tree search. In Proceedings of the 32nd International Conference on Neural Information Processing Systems, Montreal, Canada, pp. 537\u2013546, 2018."},{"key":"1532_CR37","volume-title":"Optimal solution predictions for mixed integer programs","author":"J Y Ding","year":"2019","unstructured":"J. Y. Ding, C. Zhang, L. Shen, S. Li, B. Wang, Y. Xu, L. Song. Optimal solution predictions for mixed integer programs, [Online], Available: https:\/\/arxiv.org\/abs\/1906.09575v1, 2019."},{"key":"1532_CR38","volume-title":"Proceedings of the 33rd International Conference on Neural Information Processing Systems","author":"M Gasse","year":"2019","unstructured":"M. Gasse, D. Ch\u00e9telat, N. Ferroni, L. Charlin, A. Lodi. Exact combinatorial optimization with graph convolutional neural networks. In Proceedings of the 33rd International Conference on Neural Information Processing Systems, Vancouver, Canada, Article number 1396, 2019."},{"key":"1532_CR39","volume-title":"A note on learning algorithms for quadratic assignment with graph neural network","author":"A Nowak","year":"2017","unstructured":"A. Nowak, S. Villar, A. S Bandeira, J. Bruna. A note on learning algorithms for quadratic assignment with graph neural network, [Online], Available: https:\/\/arxiv.org\/abs\/1706.07450, 2017."},{"key":"1532_CR40","volume-title":"Graph edit distance computation via graph neural networks","author":"Y Bai","year":"2018","unstructured":"Y. Bai, H. Ding, S. Bian, Y. Sun, W. Wang. Graph edit distance computation via graph neural networks, [Online], Available: https:\/\/arxiv.org\/abs\/1808.05689v3, 2018."},{"key":"1532_CR41","first-page":"6545","volume-title":"Proceedings of the 36th International Conference on Machine Learning","author":"P W Wang","year":"2019","unstructured":"P. W. Wang, P. Donti, B. Wilder, Z. Kolter. SATNet: Bridging deep learning and logical reasoning using a differentiable satisfiability solver. In Proceedings of the 36th International Conference on Machine Learning, Long Beach, USA, pp. 6545\u20136554, 2019."},{"key":"1532_CR42","volume-title":"Proceedings of the 33rd International Conference on Neural Information Processing Systems","author":"M V Pogan\u010di\u010d","year":"2019","unstructured":"M. V. Pogan\u010di\u010d, A. Paulus, V. Musil, G. Martius, M. Rolinek. Differentiation of black-box combinatorial solvers. In Proceedings of the 33rd International Conference on Neural Information Processing Systems, Vancouver, Canada, 2019."},{"key":"1532_CR43","volume-title":"Proceedings of the 5th International Conference on Learning Representations","author":"I Bello","year":"2017","unstructured":"I. Bello, H. Pham, Q. V. Le, M. Norouzi, S. Bengio. Neural combinatorial optimization with reinforcement learning. In Proceedings of the 5th International Conference on Learning Representations, Toulon, France, 2017."},{"key":"1532_CR44","volume-title":"Attention, learn to solve routing problems!","author":"W Kool","year":"2019","unstructured":"W. Kool, H. van Hoof, M. Welling. Attention, learn to solve routing problems! [Online], Available: https:\/\/arxiv.org\/abs\/1803.08475, 2019."},{"key":"1532_CR45","volume-title":"Proceedings of the 34th International Conference on Neural Information Processing Systems","author":"A Delarue","year":"2020","unstructured":"A. Delarue, R. Anderson, C. Tjandraatmadja. Reinforcement learning with combinatorial actions: An application to vehicle routing. In Proceedings of the 34th International Conference on Neural Information Processing Systems, Vancouver, Canada, Article number 52, 2020."},{"key":"1532_CR46","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1109\/ICMLA51294.2020.00013","volume-title":"Proceedings of the 19th IEEE International Conference on Machine Learning and Applications","author":"I Drori","year":"2020","unstructured":"I. Drori, A. Kharkar, W. R. Sickinger, K. Brandon, Q. Ma, S. W. Ge, E. Dolev, B. Dietrich, D. P. Williamson, M. Udell. Learning to solve combinatorial optimization problems on real-world graphs in linear time. In Proceedings of the 19th IEEE International Conference on Machine Learning and Applications, Miami, USA, pp. 19\u201324, 2020. DOI: https:\/\/doi.org\/10.1109\/ICMLA51294.2020.00013."},{"key":"1532_CR47","first-page":"6351","volume-title":"Proceedings of the 31st International Conference on Neural Information Processing Systems","author":"H Dai","year":"2017","unstructured":"H. Dai, E. B. Khalil, Y. Zhang, B. Dilkina, L. Song. Learning combinatorial optimization algorithms over graphs. In Proceedings of the 31st International Conference on Neural Information Processing Systems, Long Beach, USA, pp. 6351\u20136361, 2017."},{"key":"1532_CR48","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3319-93031-2_12","volume-title":"Proceedings of the 15th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"M Deudon","year":"2018","unstructured":"M. Deudon, P. Cournut, A. Lacoste, Y. Adulyasak, L. M. Rousseau. Learning heuristics for the TSP by policy gradient. In Proceedings of the 15th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, Delft, The Netherlands, pp. 170\u2013181, 2018. DOI: https:\/\/doi.org\/10.1007\/978-3319-93031-2_12."},{"key":"1532_CR49","volume-title":"Proceedings of the 33rd International Conference on Neural Information Processing Systems","author":"E Yolcu","year":"2019","unstructured":"E. Yolcu, B. P\u00f3czos. Learning local search heuristics for Boolean satisfiability. In Proceedings of the 33rd International Conference on Neural Information Processing Systems, Vancouver, Canada, Article number 718, 2019."},{"key":"1532_CR50","volume-title":"Proceedings of the 37th International Conference on Neural Information Processing Systems","author":"Z Sun","year":"2024","unstructured":"Z. Sun, Y. Yang. DIFUSCO: Graph-based diffusion solvers for combinatorial optimization. In Proceedings of the 37th International Conference on Neural Information Processing Systems, New Orleans, USA, Article number 164, 2024."},{"key":"1532_CR51","volume-title":"RUN-CSP: Unsupervised learning of message passing networks for binary constraint satisfaction problems","author":"J Toenshoff","year":"2019","unstructured":"J. Toenshoff, M. Ritzert, H. Wolf, M. Grohe. RUN-CSP: Unsupervised learning of message passing networks for binary constraint satisfaction problems, [Online], Available: https:\/\/arxiv.org\/abs\/1909.08387v1, 2019."},{"issue":"4","key":"1532_CR52","doi-asserted-by":"publisher","first-page":"4216","DOI":"10.1109\/TKDE.2021.3131584","volume":"35","author":"L Wu","year":"2023","unstructured":"L. Wu, H. Lin, C. Tan, Z. Gao, S. Z. Li. Self-supervised learning on graphs: Contrastive, generative, or predictive. IEEE Transactions on Knowledge and Data Engineering, vol. 35, no. 4, pp. 4216\u20134235, 2023. DOI: https:\/\/doi.org\/10.1109\/TKDE.2021.3131584.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"1532_CR53","doi-asserted-by":"publisher","first-page":"1150","DOI":"10.1145\/3394486.3403168","volume-title":"Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining","author":"J Qiu","year":"2020","unstructured":"J. Qiu, Q. Chen, Y. Dong, J. Zhang, H. Yang, M. Ding, K. Wang, J. Tang. GCC: Graph contrastive coding for graph neural network pre-training. In Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, New York, USA, pp. 1150\u20131160, 2020. DOI: https:\/\/doi.org\/10.1145\/3394486.3403168."},{"key":"1532_CR54","volume-title":"Proceedings of the 34th International Conference on Neural Information Processing Systems","author":"Y You","year":"2020","unstructured":"Y. You, T. Chen, Y. Sui, T. Chen, Z. Wang, Y. Shen. Graph contrastive learning with augmentations. In Proceedings of the 34th International Conference on Neural Information Processing Systems, Vancouver, Canada, Article number 488, 2020."},{"key":"1532_CR55","doi-asserted-by":"publisher","first-page":"2069","DOI":"10.1145\/3442381.3449802","volume-title":"Proceedings of Web Conference","author":"Y Zhu","year":"2020","unstructured":"Y. Zhu, Y. Xu, F. Yu, Q. Liu, S. Wu, L. Wang. Graph contrastive learning with adaptive augmentation. In Proceedings of Web Conference, Ljubljana, Slovenia, pp. 2069\u20132080, 2020. DOI: https:\/\/doi.org\/10.1145\/3442381.3449802."},{"key":"1532_CR56","volume-title":"Proceedings of the 10th International Conference on Learning Representations","author":"S Thakoor","year":"2022","unstructured":"S. Thakoor, C. Tallec, M. G. Azar, M. Azabou, E. L. Dyer, R. Munos, P. Velickovic, M. Valko. Large-scale representation learning on graphs via bootstrapping. In Proceedings of the 10th International Conference on Learning Representations, 2022."},{"key":"1532_CR57","volume-title":"Proceedings of the 7th International Conference on Learning Representations","author":"P Velickovic","year":"2019","unstructured":"P. Velickovic, W. Fedus, W. L. Hamilton, P. Li\u00f6, Y. Bengio, R. D. Hjelm. Deep graph infomax. In Proceedings of the 7th International Conference on Learning Representations, New Orleans, USA, 2019."},{"key":"1532_CR58","volume-title":"Proceedings of the 8th International Conference on Learning Representations","author":"F Y Sun","year":"2020","unstructured":"F. Y. Sun, J. Hoffmann, V. Verma, J. Tang. InfoGraph: Unsupervised and semi-supervised graph-level representation learning via mutual information maximization. In Proceedings of the 8th International Conference on Learning Representations, Addis Ababa, Ethiopia, 2020."},{"key":"1532_CR59","volume-title":"Proceedings of the 34th International Conference on Neural Information Processing Systems","author":"J B Grill","year":"2020","unstructured":"J. B. Grill, F. Strub, F. Altch\u00e9, C. Tallec, P. H. Richemond, E. Buchatskaya, C. Doersch, B. A. Pires, Z. D. Guo, M. G. Azar, B. Piot, K. Kavukcuoglu, R. Munos, M. Valko. Bootstrap your own latent a new approach to self-supervised learning. In Proceedings of the 34th International Conference on Neural Information Processing Systems, Vancouver, Canada, Article number 1786, 2020."},{"key":"1532_CR60","volume-title":"Proceedings of the 39th Conference on Uncertainty in Artificial Intelligence","author":"Y Jiang","year":"2023","unstructured":"Y. Jiang, Z. Cao, Y. Wu, J. Zhang. Multi-view graph contrastive learning for solving vehicle routing problems. In Proceedings of the 39th Conference on Uncertainty in Artificial Intelligence, Pittsburgh, USA, vol. 216, Article number 93, 2023."},{"key":"1532_CR61","doi-asserted-by":"publisher","unstructured":"M. Li, L. Zhang, L. Cui, L. Bai, Z. Li, X. Wu. BLoG: Bootstrapped graph representation learning with local and global regularization for recommendation. Pattern Recognition, vol. 144, Article number 109874, 2023. DOI: https:\/\/doi.org\/10.1016\/j.patcog.2023.109874.","DOI":"10.1016\/j.patcog.2023.109874"},{"issue":"4","key":"1532_CR62","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s10208-011-9093-5","volume":"11","author":"F M\u00e9moli","year":"2011","unstructured":"F. M\u00e9moli. Gromov\u2013wasserstein distances and the metric approach to object matching. Foundations of Computational Mathematics, vol. 11, no. 4, pp. 417\u2013487, 2011. DOI: https:\/\/doi.org\/10.1007\/s10208-011-9093-5.","journal-title":"Foundations of Computational Mathematics"},{"key":"1532_CR63","doi-asserted-by":"publisher","unstructured":"T. Vayer, L. Chapel, R. Flamary, R. Tavenard, N. Courty. Fused Gromov-Wasserstein distance for structured objects. Algorithms, vol. 13, no. 9, Article number 212, 2020. DOI: https:\/\/doi.org\/10.3390\/a13090212.","DOI":"10.3390\/a13090212"},{"key":"1532_CR64","doi-asserted-by":"publisher","first-page":"1365","DOI":"10.1145\/2783258.2783417","volume-title":"Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"P Yanardag","year":"2015","unstructured":"P. Yanardag, S. V. N. Vishwanathan. Deep graph kernels. In Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Sydney, Australia, pp. 1365\u20131374, 2015."},{"key":"1532_CR65","volume-title":"SNAP datasets: Stanford large network dataset collection","author":"J Leskovec","year":"2014","unstructured":"J. Leskovec, A. Krevl. SNAP datasets: Stanford large network dataset collection, [Online], Available: http:\/\/snap.stanford.edu\/data, 2014."},{"issue":"8\u20139","key":"1532_CR66","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.artint.2007.04.001","volume":"171","author":"K Xu","year":"2007","unstructured":"K. Xu, F. Boussemart, F. Hemery, C. Lecoutre. Random constraint satisfaction: Easy generation of hard (satisfiable) instances. Artificial Intelligence, vol. 171, no. 8\u20139, pp. 514\u2013534, 2007. DOI: https:\/\/doi.org\/10.1016\/j.artint.2007.04.001.","journal-title":"Artificial Intelligence"},{"key":"1532_CR67","volume-title":"Gurobi optimizer reference manual","author":"Gurobi Optimization","year":"2023","unstructured":"Gurobi Optimization, Gurobi optimizer reference manual, [Online], Available: https:\/\/www.gurobi.com, 2023."}],"container-title":["Machine Intelligence Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11633-024-1532-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11633-024-1532-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11633-024-1532-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T10:02:48Z","timestamp":1764151368000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11633-024-1532-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,18]]},"references-count":67,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["1532"],"URL":"https:\/\/doi.org\/10.1007\/s11633-024-1532-2","relation":{},"ISSN":["2731-538X","2731-5398"],"issn-type":[{"type":"print","value":"2731-538X"},{"type":"electronic","value":"2731-5398"}],"subject":[],"published":{"date-parts":[[2025,10,18]]},"assertion":[{"value":"20 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 October 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 October 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declared that they have no conflicts of interest to this work.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations of conflict of interest"}}]}}