{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T12:06:00Z","timestamp":1749729960152,"version":"3.37.3"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,6,15]],"date-time":"2022-06-15T00:00:00Z","timestamp":1655251200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,6,15]],"date-time":"2022-06-15T00:00:00Z","timestamp":1655251200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62006095","62066015"],"award-info":[{"award-number":["62006095","62066015"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Hunan Natural Science Foundation of China","award":["2020JJ4511"],"award-info":[{"award-number":["2020JJ4511"]}]},{"name":"Research Foundation of Education Bureau of Hunan Province, China","award":["20B470","20A396"],"award-info":[{"award-number":["20B470","20A396"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Process Lett"],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1007\/s11063-022-10900-y","type":"journal-article","created":{"date-parts":[[2022,6,15]],"date-time":"2022-06-15T03:33:08Z","timestamp":1655263988000},"page":"631-644","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Heavy-Head Sampling for Fast Imitation Learning of Machine Learning Based Combinatorial Auction Solver"],"prefix":"10.1007","volume":"55","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1669-0013","authenticated-orcid":false,"given":"Chen","family":"Peng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bolin","family":"Liao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,15]]},"reference":[{"issue":"1","key":"10900_CR1","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1287\/ited.2013.0115","volume":"14","author":"AM Newman","year":"2013","unstructured":"Newman AM, Weiss M (2013) A survey of linear and mixed-integer optimization tutorials. Inf Trans Educ 14(1):26\u201338","journal-title":"Inf Trans Educ"},{"key":"10900_CR2","volume-title":"Combinatorial auctions","author":"C Peter","year":"2006","unstructured":"Peter C, Yoav S, Richard S (2006) Combinatorial auctions. MIT Press, Cambridge"},{"issue":"2","key":"10900_CR3","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1002\/net.21967","volume":"76","author":"C Triki","year":"2020","unstructured":"Triki C, Piya S, Fu LL (2020) Integrating production scheduling and transportation procurement through combinatorial auctions. Networks 76(2):147\u2013163","journal-title":"Networks"},{"issue":"6","key":"10900_CR4","doi-asserted-by":"publisher","first-page":"1548","DOI":"10.1007\/s10458-017-9370-z","volume":"31","author":"W Song","year":"2017","unstructured":"Song W et al (2017) A multi-unit combinatorial auction based approach for decentralized multi-project scheduling. Auton Agents Multi-Agent Syst 31(6):1548\u20131577","journal-title":"Auton Agents Multi-Agent Syst"},{"issue":"6","key":"10900_CR5","doi-asserted-by":"publisher","first-page":"1935","DOI":"10.3390\/s21061935","volume":"21","author":"BH Zaidi","year":"2021","unstructured":"Zaidi BH et al (2021) Incentive based load shedding management in a microgrid using combinatorial auction with IoT infrastructure. Sensors 21(6):1935","journal-title":"Sensors"},{"issue":"2","key":"10900_CR6","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s10922-019-09506-y","volume":"28","author":"A Ehsanfar","year":"2020","unstructured":"Ehsanfar A, Grogan PT (2020) Auction-based algorithms for routing and task scheduling in federated networks. J Netw Syst Manag 28(2):271\u2013297","journal-title":"J Netw Syst Manag"},{"issue":"2","key":"10900_CR7","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1287\/trsc.2018.0835","volume":"53","author":"Z Zhang","year":"2019","unstructured":"Zhang Z et al (2019) Exact algorithms for the vehicle routing problem with time windows and combinatorial auction. Transp Sci 53(2):427\u2013441","journal-title":"Transp Sci"},{"key":"10900_CR8","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2021.3075202","author":"L Hou","year":"2021","unstructured":"Hou L et al (2021) A simultaneous multi-round auction design for scheduling multiple charges of battery electric vehicles on highways. IEEE Trans Intell Transp Syst. https:\/\/doi.org\/10.1109\/TITS.2021.3075202","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"10900_CR9","doi-asserted-by":"crossref","unstructured":"Leyton-Brown K, Pearson M, Shoham Y (2000) Towards a universal test suite for combinatorial auction algorithms. In: Proceedings of the 2nd ACM conference on electronic commerce. association for computing machinery, Minneapolis, Minnesota, USA, EC \u201900, pp. 66\u201376","DOI":"10.1145\/352871.352879"},{"key":"10900_CR10","unstructured":"Balcan MF et al (2018) Learning to branch. In: International conference on machine learning. PMLR, Stockholm, Sweden, 80: 344\u2013353"},{"issue":"2","key":"10900_CR11","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.ejor.2020.07.063","volume":"290","author":"Y Bengio","year":"2020","unstructured":"Bengio Y, Lodi A, Prouvost A (2020) Machine learning for combinatorial optimization: a methodological tour d\u2019horizon. Eur J Oper Res 290(2):405\u2013421","journal-title":"Eur J Oper Res"},{"key":"10900_CR12","unstructured":"Gasse M et al (2019) Exact combinatorial optimization with graph convolutional neural networks. In: Proceedings of the 33rd international conference on neural information processing systems. Curran Associates Inc., Red Hook, NY, USA"},{"issue":"7587","key":"10900_CR13","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1038\/nature16961","volume":"529","author":"D Silver","year":"2016","unstructured":"Silver D et al (2016) Mastering the game of Go with deep neural networks and tree search. Nature 529(7587):484\u2013489","journal-title":"Nature"},{"key":"10900_CR14","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3095122","author":"W Li","year":"2021","unstructured":"Li W, Chiu PWY, Li Z (2021) A novel neural approach to infinity-norm joint-velocity minimization of kinematically redundant robots under joint limits. IEEE Trans Neural Netw Learn Syst. https:\/\/doi.org\/10.1109\/TNNLS.2021.3095122","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"issue":"12","key":"10900_CR15","doi-asserted-by":"publisher","first-page":"10787","DOI":"10.1109\/TIE.2019.2959481","volume":"67","author":"W Li","year":"2020","unstructured":"Li W, Song C, Li Z (2020) An accelerated recurrent neural network for visual servo control of a robotic flexible endoscope with joint limit constraint. IEEE Trans Ind Electron 67(12):10787\u201310797","journal-title":"IEEE Trans Ind Electron"},{"key":"10900_CR16","doi-asserted-by":"publisher","first-page":"3693","DOI":"10.1007\/s11063-021-10541-7","volume":"53","author":"P Verma","year":"2021","unstructured":"Verma P, Parouha RP (2021) An advanced hybrid algorithm for engineering design optimization. Neural Process Lett 53:3693","journal-title":"Neural Process Lett"},{"key":"10900_CR17","doi-asserted-by":"publisher","first-page":"4549","DOI":"10.1007\/s11063-021-10612-9","volume":"53","author":"A Pooya","year":"2021","unstructured":"Pooya A et al (2021) Neural network for a novel disturbance optimal control model for inventory and production planning in a four-echelon supply chain with reverse logistic. Neural Process Lett 53:4549","journal-title":"Neural Process Lett"},{"issue":"2","key":"10900_CR18","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1287\/ijoc.11.2.173","volume":"11","author":"JT Linderoth","year":"1999","unstructured":"Linderoth JT, Savelsbergh MW (1999) A computational study of search strategies for mixed integer programming. Inf J Comput 11(2):173\u2013187","journal-title":"Inf J Comput"},{"issue":"8","key":"10900_CR19","doi-asserted-by":"publisher","first-page":"7209","DOI":"10.1109\/TIE.2020.3007099","volume":"68","author":"L Jin","year":"2021","unstructured":"Jin L et al (2021) Perturbed manipulability optimization in a distributed network of redundant robots. IEEE Trans Ind Electron 68(8):7209\u20137220","journal-title":"IEEE Trans Ind Electron"},{"issue":"11","key":"10900_CR20","doi-asserted-by":"publisher","first-page":"3360","DOI":"10.1109\/TNNLS.2019.2891252","volume":"30","author":"L Xiao","year":"2019","unstructured":"Xiao L, Li K, Duan M (2019) Computing time-varying quadratic optimization with finite-time convergence and noise tolerance: a unified framework for zeroing neural network. IEEE Trans Neural Netw Learn Syst 30(11):3360\u20133369","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"issue":"5","key":"10900_CR21","doi-asserted-by":"publisher","first-page":"2605","DOI":"10.1109\/TII.2018.2867169","volume":"15","author":"L Xiao","year":"2019","unstructured":"Xiao L et al (2019) Zeroing neural dynamics for control design: comprehensive analysis on stability, robustness, and convergence speed. IEEE Trans Ind Inform 15(5):2605\u20132616","journal-title":"IEEE Trans Ind Inform"},{"key":"10900_CR22","first-page":"3293","volume":"27","author":"H He","year":"2014","unstructured":"He H, Daume H III, Eisner JM (2014) Learning to search in branch and bound algorithms. Adv Neural Inf Process Syst 27:3293\u20133301","journal-title":"Adv Neural Inf Process Syst"},{"key":"10900_CR23","unstructured":"Song J et al (2019) Learning to search via retrospective imitation. arXiv:1804.00846"},{"key":"10900_CR24","unstructured":"Baltean-Lugojan R et al (2018) Selecting cutting planes for quadratic semidefinite outer-approximation via trained neural networks. Technical report, CPLEX Optimization, IBM"},{"key":"10900_CR25","unstructured":"Tang Y, Agrawal S, Faenza Y (2020) Reinforcement learning for integer programming: learning to cut. In: International conference on machine learning. PMLR, Virtual Event, pp 9367\u20139376"},{"key":"10900_CR26","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/978-3-030-18500-8_64","volume-title":"Operations research proceedings 2018","author":"G Hendel","year":"2019","unstructured":"Hendel G, Miltenberger M, Witzig J (2019) Adaptive algorithmic behavior for solving mixed integer programs using bandit algorithms. In: Fortz B, Labb\u00e9 M (eds) Operations research proceedings 2018. Springer, Cham, pp 513\u2013519"},{"key":"10900_CR27","doi-asserted-by":"crossref","unstructured":"Khalil EB et al (2017) Learning to run heuristics in tree search. In: Proceedings of the 26th international joint conference on artificial intelligence. AAAI Press, Melbourne, Australia, IJCAI\u201917, pp. 659\u2013666","DOI":"10.24963\/ijcai.2017\/92"},{"key":"10900_CR28","first-page":"18087","volume":"33","author":"P Gupta","year":"2020","unstructured":"Gupta P et al (2020) Hybrid models for learning to branch. Adv Neural Inf Process Syst 33:18087\u201318097","journal-title":"Adv Neural Inf Process Syst"},{"key":"10900_CR29","doi-asserted-by":"crossref","unstructured":"Khalil E et al (2016) Learning to branch in mixed integer programming. In: Proceedings of the thirtieth AAAI conference on artificial intelligence. AAAI Press, Phoenix, Arizona, AAAI\u201916, pp. 724\u2013731","DOI":"10.1609\/aaai.v30i1.10080"},{"key":"10900_CR30","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/978-3-642-38189-8_18","volume-title":"Facets of combinatorial optimization: festschrift for Martin Gr\u00f6tschel","author":"T Achterberg","year":"2013","unstructured":"Achterberg T, Wunderling R (2013) Mixed integer programming: analyzing 12 years of progress. In: J\u00fcnger M, Reinelt G (eds) Facets of combinatorial optimization: festschrift for Martin Gr\u00f6tschel. Springer, Berlin, Heidelberg, pp 449\u2013481"},{"issue":"2","key":"10900_CR31","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s11750-017-0451-6","volume":"25","author":"A Lodi","year":"2017","unstructured":"Lodi A, Zarpellon G (2017) On learning and branching: a survey. TOP 25(2):207\u2013236","journal-title":"TOP"},{"issue":"1","key":"10900_CR32","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1287\/ijoc.2016.0723","volume":"29","author":"AM Alvarez","year":"2017","unstructured":"Alvarez AM, Louveaux Q, Wehenkel L (2017) A machine learning-based approximation of strong branching. Inf J Comput 29(1):185\u2013195","journal-title":"Inf J Comput"},{"key":"10900_CR33","unstructured":"Lu J, Kumar MP (2019) Neural network branching for neural network verification. In: International conference on learning representations"},{"key":"10900_CR34","unstructured":"Prouvost A et al (2020) Ecole: A Gym-like library for machine learning in combinatorial optimization solvers. ArXiv Prepr arXiv:2011.06069"},{"key":"10900_CR35","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/BFb0120886","volume-title":"Combinatorial optimization","author":"E Balas","year":"1980","unstructured":"Balas E, Ho A (1980) Set covering algorithms using cutting planes, heuristics, and subgradient optimization: a computational study. In: Padberg MW (ed) Combinatorial optimization. Springer, Berlin, Heidelberg, pp 37\u201360"},{"key":"10900_CR36","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1007\/s40815-021-01208-5","volume":"24","author":"A Hashemi","year":"2021","unstructured":"Hashemi A et al (2021) A new direct coefficient-based heuristic algorithm for set covering problems. Int J Fuzzy Syst 24:1131","journal-title":"Int J Fuzzy Syst"},{"issue":"2","key":"10900_CR37","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1016\/j.ejor.2020.07.033","volume":"289","author":"P Avella","year":"2021","unstructured":"Avella P et al (2021) Weak flow cover inequalities for the capacitated facility location problem. Eur J Oper Res 289(2):485\u2013494","journal-title":"Eur J Oper Res"},{"issue":"3","key":"10900_CR38","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1016\/0377-2217(91)90261-S","volume":"50","author":"G Cornuejols","year":"1991","unstructured":"Cornuejols G, Sridharan R, Thizy JM (1991) A comparison of heuristics and relaxations for the capacitated plant location problem. Eur J Oper Res 50(3):280\u2013297","journal-title":"Eur J Oper Res"},{"key":"10900_CR39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-42849-9","volume-title":"Decision diagrams for optimization","author":"D Bergman","year":"2016","unstructured":"Bergman D et al (2016) Decision diagrams for optimization. Springer, Cham, Germany"},{"issue":"1","key":"10900_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3414473","volume":"18","author":"A Grzesik","year":"2022","unstructured":"Grzesik A et al (2022) Polynomial-time algorithm for maximum weight independent set on P 6-free graphs. ACM Trans Algorithms TALG 18(1):1\u201357","journal-title":"ACM Trans Algorithms TALG"},{"key":"10900_CR41","unstructured":"Gamrath G et al (2020) The SCIP optimization suite 7.0. Technical Report 20-10, Zuse Institute Berlin"}],"container-title":["Neural Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11063-022-10900-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11063-022-10900-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11063-022-10900-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,6]],"date-time":"2023-03-06T14:26:56Z","timestamp":1678112816000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11063-022-10900-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,15]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["10900"],"URL":"https:\/\/doi.org\/10.1007\/s11063-022-10900-y","relation":{},"ISSN":["1370-4621","1573-773X"],"issn-type":[{"type":"print","value":"1370-4621"},{"type":"electronic","value":"1573-773X"}],"subject":[],"published":{"date-parts":[[2022,6,15]]},"assertion":[{"value":"24 May 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 June 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}