{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T18:37:33Z","timestamp":1693593453361},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,6,12]],"date-time":"2008-06-12T00:00:00Z","timestamp":1213228800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2009,4]]},"DOI":"10.1007\/s10479-008-0364-8","type":"journal-article","created":{"date-parts":[[2008,6,11]],"date-time":"2008-06-11T16:52:06Z","timestamp":1213203126000},"page":"101-117","source":"Crossref","is-referenced-by-count":6,"title":["Theoretical insights into the augmented-neural-network approach for combinatorial optimization"],"prefix":"10.1007","volume":"168","author":[{"given":"Anurag","family":"Agarwal","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,6,12]]},"reference":[{"issue":"3","key":"364_CR1","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1016\/S0377-2217(02)00605-7","volume":"151","author":"A. Agarwal","year":"2003","unstructured":"Agarwal, A., Jacob, V., & Pirkul, H. (2003). Augmented neural networks for task scheduling. European Journal of Operational Research, 151(3), 481\u2013502.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"364_CR2","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1287\/ijoc.1040.0108","volume":"18","author":"A. Agarwal","year":"2006","unstructured":"Agarwal, A., Jacob, V., & Pirkul, H. (2006). An improved augmented neural-networks approach for scheduling problems. INFORMS Journal on Computing, 18(1), 119\u2013128.","journal-title":"INFORMS Journal on Computing"},{"issue":"3","key":"364_CR3","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1023\/A:1022452626305","volume":"25","author":"S. I. Birbil","year":"2003","unstructured":"Birbil, S. I., & Fang, S. C. (2003). An electromagnetism-like mechanism for global optimization. Journal of Global Optimization, 25(3), 263\u2013282.","journal-title":"Journal of Global Optimization"},{"issue":"3\u20134","key":"364_CR4","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1016\/S0360-8352(97)00247-7","volume":"33","author":"R. W. Cheng","year":"1997","unstructured":"Cheng, R. W., & Gen, M. (1997). Parallel machine scheduling problems using memetic algorithms. Computers & Industrial Engineering, 33(3\u20134), 761\u2013764.","journal-title":"Computers & Industrial Engineering"},{"issue":"1","key":"364_CR5","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1023\/A:1009642405419","volume":"4","author":"P. Chu","year":"1998","unstructured":"Chu, P., & Beasley, J. (1998). A genetic algorithm for the multidimensional knapsack problem. Journal of Heuristics, 4(1), 63\u201386.","journal-title":"Journal of Heuristics"},{"issue":"7","key":"364_CR6","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1002\/nav.20102","volume":"52","author":"S. Colak","year":"2005","unstructured":"Colak, S., & Agarwal, A. (2005). Non-greedy heuristics and augmented neural networks for the open-shop scheduling problem. Naval Research Logistics, 52(7), 631\u2013644.","journal-title":"Naval Research Logistics"},{"key":"364_CR7","unstructured":"Colak, S., Agarwal, A., & Erenguc, S. S. (2006). Resource constrained project scheduling problem: a hybrid neural approach. In: J. Weglarz & J. Jozefowska (Eds.), Topics in modern scheduling (pp.\u00a0297\u2013318)."},{"issue":"2","key":"364_CR8","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1016\/j.ejor.2004.08.020","volume":"169","author":"D. Debels","year":"2006","unstructured":"Debels, D., Reyck, B. D., Leus, R., & Vanhoucke, M. (2006). A hybrid scatter search\/electromagnetism meta-heuristic for project scheduling. European Journal of Operational Research, 169(2), 638\u2013653.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"364_CR9","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1016\/j.ejor.2004.08.016","volume":"169","author":"J. A. D\u00edaz","year":"2006","unstructured":"D\u00edaz, J. A., & Fern\u00e1ndez, E. (2006). Scatter search and Path Relinking for the capacitated p-Median problem. European Journal of Operational Research, 169(2), 570\u2013585.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"364_CR10","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1162\/106454699568728","volume":"5","author":"M. Dorigo","year":"1999","unstructured":"Dorigo, M., Caro, G. D., & Gambardella, L. M. (1999). Ant algorithms for discrete optimization. Artificial Life, 5(2), 137\u2013172.","journal-title":"Artificial Life"},{"issue":"3","key":"364_CR11","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"Glover, F. (1989). Tabu search\u2014Part I. ORSA Journal on Computing, 1(3), 190\u2013206.","journal-title":"ORSA Journal on Computing"},{"key":"364_CR12","volume-title":"Genetic algorithms in search, optimization and machine learning","author":"D. E. Goldberg","year":"1989","unstructured":"Goldberg, D. E. (1989). Genetic algorithms in search, optimization and machine learning. Dordrecht: Kluwer Academic."},{"issue":"1","key":"364_CR13","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K. Helsgaun","year":"2000","unstructured":"Helsgaun, K. (2000). An effective implementation of the Lin-Kernighan traveling salesman heuristic. European Journal of Operational Research, 126(1), 106\u2013130.","journal-title":"European Journal of Operational Research"},{"key":"364_CR14","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220, 671\u2013680.","journal-title":"Science"},{"issue":"1","key":"364_CR15","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.ejor.2005.01.065","volume":"174","author":"R. Kolisch","year":"2006","unstructured":"Kolisch, R., & Hartmann, S. (2006). Experimental investigation of heuristics for resource-constrained project scheduling: An update. European Journal of Operational Research, 174(1), 23\u201337.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"364_CR16","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S. Lin","year":"1973","unstructured":"Lin, S., & Kernighan, B. W. (1973). An effective heuristic algorithm for the traveling salesman problem. Operations Research, 21(2), 498\u2013516.","journal-title":"Operations Research"},{"issue":"2","key":"364_CR17","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/j.ejor.2004.08.004","volume":"169","author":"R. Mart\u00ed","year":"2006","unstructured":"Mart\u00ed, R., Laguna, M., & Glover, F. (2006). Principles of scatter search. European Journal of Operational Research, 169(2), 359\u2013372.","journal-title":"European Journal of Operational Research"},{"key":"364_CR18","volume-title":"Elements of artificial neural networks","author":"K. Mehrotra","year":"1997","unstructured":"Mehrotra, K., Mohan, C. K., & Ranka, S. (1997). Elements of artificial neural networks. Cambridge: MIT Press."},{"issue":"5","key":"364_CR19","doi-asserted-by":"crossref","first-page":"1325","DOI":"10.1016\/j.cor.2003.11.006","volume":"32","author":"J. A. Pacheco","year":"2005","unstructured":"Pacheco, J. A. (2005). A scatter search approach for the minimum sum-of-squares clustering problem. Computers & Operations Research, 32(5), 1325\u20131335.","journal-title":"Computers & Operations Research"},{"key":"364_CR20","volume-title":"Handbook of applied optimization","author":"L. S. Pitsoulis","year":"2001","unstructured":"Pitsoulis, L. S., & Resende, M. G. C. (2001). Greedy randomized adaptive search procedures. In P. M. Pardalos & M. G. C. Resende (Eds.), Handbook of applied optimization. London: Oxford University Press."},{"issue":"1","key":"364_CR21","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1162\/evco.1998.6.1.45","volume":"6","author":"C. R. Reeves","year":"1998","unstructured":"Reeves, C. R., & Yamada, T. (1998). Genetic algorithms, path relinking and the flowshop sequencing problem. Evolutionary Computation, 6(1), 45\u201360.","journal-title":"Evolutionary Computation"},{"key":"364_CR22","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/0-387-23667-8_20","volume-title":"Metaheuristic optimization via memory and evolution: Tabu search and scatter search","author":"C. Rego","year":"2005","unstructured":"Rego, C. (2005). RAMP: A new metaheuristic framework for combinatorial optimization. In C. Rego & B.\u00a0Alidaee (Eds.), Metaheuristic optimization via memory and evolution: Tabu search and scatter search (pp.\u00a0441\u2013460). Dordrecht: Kluwer Academic."},{"issue":"1\u20132","key":"364_CR23","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0166-218X(01)00255-4","volume":"118","author":"C. C. Ribeiro","year":"2002","unstructured":"Ribeiro, C. C., & Souza, M. C. (2002). Variable neighborhood search for the degree-constrained minimum spanning tree problem. Discrete Applied Mathematics, 118(1\u20132), 43\u201354.","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"364_CR24","doi-asserted-by":"crossref","first-page":"2033","DOI":"10.1016\/j.ejor.2005.12.009","volume":"177","author":"R. Ruiz","year":"2006","unstructured":"Ruiz, R., & Stutzle, T. (2006). A simple and effective iterated greedy algorithm for the permutation flowshop problem. European Journal of Operational Research, 177(3), 2033\u20132049.","journal-title":"European Journal of Operational Research"},{"key":"364_CR25","unstructured":"Stutzle, T. (1998). Applying iterated local search to the permutation flowshop problem. Technical Report AIDA\u201398\u201304, FG Intellektik, TU Darmstadt."},{"issue":"2","key":"364_CR26","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/j.ejor.2004.04.008","volume":"165","author":"V. Valls","year":"2005","unstructured":"Valls, V., Ballestin, F., & Quintanilla, M. S. (2005). Justification and RCPSP: a technique that pays. European Journal of Operational Research, 165(2), 375\u2013386.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"364_CR27","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"D. H. Wolpert","year":"1997","unstructured":"Wolpert, D. H., & Macready, W. G. (1997). No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, 1(1), 67\u201382.","journal-title":"IEEE Transactions on Evolutionary Computation"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0364-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-008-0364-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0364-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:07:47Z","timestamp":1559153267000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-008-0364-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,12]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,4]]}},"alternative-id":["364"],"URL":"https:\/\/doi.org\/10.1007\/s10479-008-0364-8","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,6,12]]}}}