{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:56:18Z","timestamp":1725562578759},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540220671"},{"type":"electronic","value":"9783540248385"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24838-5_32","type":"book-chapter","created":{"date-parts":[[2010,8,8]],"date-time":"2010-08-08T21:34:14Z","timestamp":1281303254000},"page":"432-445","source":"Crossref","is-referenced-by-count":0,"title":["An Improved Time-Sensitive Metaheuristic Framework for Combinatorial Optimization"],"prefix":"10.1007","author":[{"given":"Vinhthuy","family":"Phan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven","family":"Skiena","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"32_CR1","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D. Brelaz","year":"1979","unstructured":"Brelaz, D.: New methods to color the vertices of a graph. Communications of the ACM\u00a022(4), 251\u2013256 (1979)","journal-title":"Communications of the ACM"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"Briggs, P., Cooper, K., Kennedy, K., Torczon, L.: Coloring heuristics for register allocation. In: ASCM Conference on Program Language Design and Implementation, pp. 275\u2013284 (1989)","DOI":"10.1145\/73141.74843"},{"issue":"4","key":"32_CR3","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/88616.88621","volume":"12","author":"F. Chow","year":"1990","unstructured":"Chow, F., Hennessy, J.: The priority-based coloring approach to register allocation. ACM Transactions on Programming Languages and Systems\u00a012(4), 501\u2013536 (1990)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"Lon-Chan Chu and Benjamin W. Wah. Optimization in real time. In: IEEE Real-Time Systems Symposium, pp. 150\u2013159 (1991)","DOI":"10.1109\/REAL.1991.160368"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Csirik, J., Johnson, D.S., Kenyon, C., Orlin, J.B., Shor, P.W., Weber, R.R.: On the sum-of-squares algorithm for bin packing. In: Proceedings of the 32nd Annual ACM Symposium on the Theory of Computing, pp. 208\u2013217 (2000)","DOI":"10.1145\/335305.335331"},{"key":"32_CR6","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T. Feo","year":"1995","unstructured":"Feo, T., Resende, M.: Greedy randomized adaptive search procedures. Journal of Global Optimization\u00a06, 109\u2013133 (1995)","journal-title":"Journal of Global Optimization"},{"key":"32_CR7","volume-title":"[27]","author":"A. Fink","year":"2002","unstructured":"Fink, A., Voss, S.: HotFrame: A Heuristic Optimization Framework. In: [27], Kluwer, Dordrecht (2002)"},{"issue":"3","key":"32_CR8","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/S0164-1212(01)00010-3","volume":"57","author":"M. Fontoura","year":"2001","unstructured":"Fontoura, M., Lucena, C., Andreatta, A., Carvalho, S.E., Ribeiro, C.: Using umlf to enhance framework development: a case study in the local search heuristics domain. J. Syst. Softw.\u00a057(3), 201\u2013206 (2001)","journal-title":"J. Syst. Softw."},{"key":"32_CR9","unstructured":"Galinier, P., Hao, J.: A general approach for constraint solving by local search. In: Proceedings of the Second International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR 2000), Paderborn, Germany (March 2000)"},{"key":"32_CR10","volume-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)"},{"key":"32_CR11","volume-title":"[27]","author":"L. Gaspero Di","year":"2002","unstructured":"Di Gaspero, L., Schaerf, A.: Writing Local Search Algorithms Using EasyLocal++. In: [27], Kluwer, Dordrecht (2002)"},{"issue":"2-3","key":"32_CR12","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"T. Gonzalez","year":"1985","unstructured":"Gonzalez, T.: Clustering to minimize the maximum intercluster distance. Theoretical Computer Science\u00a038(2-3), 293\u2013306 (1985)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"32_CR13","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1287\/ijoc.7.4.417","volume":"7","author":"T. Hu","year":"1995","unstructured":"Hu, T., Kahng, A., Tsao, C.: Old bachelor acceptance: A new class of nonmonotone threshold accepting methods. ORSA Journal on Computing\u00a07(4), 417\u2013425 (1995)","journal-title":"ORSA Journal on Computing"},{"key":"32_CR14","unstructured":"Huang, M., Romeo, F.: Sangiovanni-Vincentelli. An efficient general cooling schedule for simulated annealing. In: ICCAD, pp. 381\u2013384 (1986)"},{"issue":"4","key":"32_CR15","first-page":"109","volume":"22","author":"S. Koenig","year":"2001","unstructured":"Koenig, S.: Agent-centered search. Artificial Intelligence Magazine\u00a022(4), 109\u2013131 (2001)","journal-title":"Artificial Intelligence Magazine"},{"issue":"3","key":"32_CR16","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0004-3702(90)90054-4","volume":"42","author":"R.E. Korf","year":"1990","unstructured":"Korf, R.E.: Real-time heuristic search. Artificial Intelligence\u00a042(3), 189\u2013211 (1990)","journal-title":"Artificial Intelligence"},{"key":"32_CR17","unstructured":"Lam, J., Delosme, J.-M.: An efficient simulated annealing schedule: derivation. Technical Report 8816, Yale University (1988)"},{"key":"32_CR18","unstructured":"Lam, J., Delosme, J.-M.: An efficient simulated annealing schedule: implementation and evaluation. Technical Report 8817, Yale University (1988)"},{"key":"32_CR19","doi-asserted-by":"crossref","unstructured":"Lam, J., Delosme, J.-M.: Performance of a new annealing schedule. In: 1EEE\/ACM Proc. of 25th. Design Automation Conference (DAC), pp. 306\u2013311 (1988)","DOI":"10.1109\/DAC.1988.14775"},{"key":"32_CR20","volume-title":"Proceedings of the Seventh International Conference on Genetic Algorithms (ICGA 1997)","author":"P. Merz","year":"1997","unstructured":"Merz, P., Freisleben, B.: A genetic local search approach to the quadratic assignment problem. In: B\u00e4ck, T. (ed.) Proceedings of the Seventh International Conference on Genetic Algorithms (ICGA 1997), Morgan Kaufmann, San Francisco (1997)"},{"key":"32_CR21","unstructured":"Merz, P., Freisleben, B.: Greedy and local search heuristics for the unconstrained binary quadratic programming problem. Technical Report 99-01, University of Siegen, Germany (1999)"},{"key":"32_CR22","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1145\/582419.582430","volume-title":"Proceedings of the 17th ACM SIGPLAN conference on Objectoriented programming, systems, languages, and applications","author":"L. Michel","year":"2002","unstructured":"Michel, L., Van Hentenryck, P.: A constraint-based architecture for local search. In: Proceedings of the 17th ACM SIGPLAN conference on Objectoriented programming, systems, languages, and applications, pp. 83\u2013100. ACM Press, New York (2002)"},{"key":"32_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/3-540-45643-0_2","volume-title":"Algorithm Engineering and Experiments","author":"V. Phan","year":"2002","unstructured":"Phan, V., Skiena, S., Sumazin, P.: A time-sensitive system for black-box optimization. In: Mount, D.M., Stein, C. (eds.) ALENEX 2002. LNCS, vol.\u00a02409, pp. 16\u201328. Springer, Heidelberg (2002)"},{"key":"32_CR24","doi-asserted-by":"crossref","unstructured":"Phan, V., Skiena, S., Sumazin, P.: A model for analyzing black box optimization. In: Workshop on Algorithms and Data Structures (2003); to be published in Lecture Notes in Computer Science","DOI":"10.1007\/978-3-540-45078-8_37"},{"key":"32_CR25","unstructured":"Selman, B., Kautz, H.A.: An empirical study of greedy local search for satisfiability testing. In: Proceedings of the Eleventh National Conference on Artificial Intelligence(AAAI 1993), Washington DC (1993)"},{"issue":"2","key":"32_CR26","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1109\/49.552073","volume":"15","author":"K. Smith","year":"1997","unstructured":"Smith, K., Palaniswami, M.: Static and dynamic channel assignment using neural networks. IEEE Journal on Selected Areas in Communications\u00a015(2), 238\u2013249 (1997)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"volume-title":"Optimization Software Class Libraries","year":"2002","key":"32_CR27","unstructured":"Voss, S., Woodruff, D. (eds.): Optimization Software Class Libraries. Kluwer, Dordrecht (2002)"},{"key":"32_CR28","volume-title":"[27]","author":"C. Voudouris","year":"2002","unstructured":"Voudouris, C., Dorne, R.: Integrating Heuristic Search and One-Way Constraints in the iOpt Toolkit. In: [27], Kluwer, Dordrecht (2002)"},{"key":"32_CR29","unstructured":"Wolpert, D., Macready, W.: No free lunch theorems for search. Technical Report SFI-TR-95-02-010, Santa Fe (1995)"},{"issue":"1","key":"32_CR30","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"D. Wolpert","year":"1997","unstructured":"Wolpert, D., Macready, W.: No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation\u00a01(1), 67\u201382 (1997)","journal-title":"IEEE Transactions on Evolutionary Computation"}],"container-title":["Lecture Notes in Computer Science","Experimental and Efficient Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24838-5_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:13:29Z","timestamp":1620011609000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24838-5_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540220671","9783540248385"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24838-5_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}