{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:56:31Z","timestamp":1725562591352},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540214595"},{"type":"electronic","value":"9783540246947"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24694-7_75","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T17:40:16Z","timestamp":1280770816000},"page":"727-734","source":"Crossref","is-referenced-by-count":1,"title":["A Preprocessing That Combines Heuristic and Surrogate Constraint Analysis to Fix Variables in TSP"],"prefix":"10.1007","author":[{"given":"M.","family":"Lama","sequence":"first","affiliation":[]},{"given":"D.","family":"Pinto","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"75_CR1","volume-title":"Computers and Intractability, Computers and Intractability","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability, Computers and Intractability. W.H. Freeman, San Francisco (1979)"},{"volume-title":"Encyclopedia of Operations Research and Management Sciences","year":"1997","key":"75_CR2","unstructured":"Gass, S. (ed.): Encyclopedia of Operations Research and Management Sciences. Kluwer Academic Publishers, New York (1997)"},{"key":"75_CR3","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1287\/mnsc.17.9.568","volume":"17","author":"F. Glover","year":"1971","unstructured":"Glover, F.: Flows in Arborescences. Management Science\u00a017, 568\u2013586 (1971)","journal-title":"Management Science"},{"key":"75_CR4","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1287\/opre.16.4.741","volume":"16","author":"F. Glover","year":"1968","unstructured":"Glover, F.: Surrogate Constraints. Operations Research\u00a016, 741\u2013749 (1968)","journal-title":"Operations Research"},{"key":"75_CR5","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1287\/opre.23.3.434","volume":"23","author":"F. Glover","year":"1975","unstructured":"Glover, F.: Surrogate Constraint Duality in Mathematical Programming. Operations Research\u00a023, 434\u2013451 (1975)","journal-title":"Operations Research"},{"key":"75_CR6","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1023\/A:1008621204567","volume":"8","author":"F. Glover","year":"1997","unstructured":"Glover, F., Sherali, H., Lee, Y.: Generating Cuts from Surrogate Constraint Analysis for Zero-One and Multiple Choice Programming. Computational Optimization and Applications\u00a08, 151\u2013172 (1997)","journal-title":"Computational Optimization and Applications"},{"key":"75_CR7","doi-asserted-by":"publisher","first-page":"924","DOI":"10.1287\/opre.18.5.924","volume":"18","author":"H. Greenberg","year":"1970","unstructured":"Greenberg, H., Pierskalla, W.: Surrogate Mathematical Programs. Operations Research\u00a018, 924\u2013939 (1970)","journal-title":"Operations Research"},{"key":"75_CR8","unstructured":"Granot, F., Hammer, P.L.: On the use of boolean functions in 0-1 linear programming. Methods of Operations Research, 154\u2013184 (1971)"},{"key":"75_CR9","first-page":"68","volume":"13","author":"P. Hammer","year":"1975","unstructured":"Hammer, P., Padberg, M., Peled, U.: Constraint Pairing in Integer Programming. INFOR\u00a013, 68\u201381 (1975)","journal-title":"INFOR"},{"key":"75_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1007\/3-540-58601-6_111","volume-title":"Principles and Practice of Constraint Programming","author":"J.N. Hooker","year":"1994","unstructured":"Hooker, J.N.: Logic-based methods for optimization. In: Borning, A. (ed.) PPCP 1994. LNCS, vol.\u00a0874, pp. 336\u2013349. Springer, Heidelberg (1994)"},{"key":"75_CR11","volume-title":"A Framework for combining solution methods","author":"J.N. Hooker","year":"2003","unstructured":"Hooker, J.N.: A Framework for combining solution methods. Carnegie Mellon University, Pittsburgh (2003) (working paper)"},{"key":"75_CR12","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/S0166-218X(99)00100-6","volume":"96-97","author":"J.N. Hooker","year":"1999","unstructured":"Hooker, J.N., Osorio, M.A.: Mixed Logical\/Linear Programming. Discrete Applied Mathematics\u00a096-97, 395\u2013442 (1999)","journal-title":"Discrete Applied Mathematics"},{"key":"75_CR13","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BFb0121015","volume":"22","author":"R.E. Jeroslow","year":"1984","unstructured":"Jeroslow, R.E., Lowe, J.K.: Modeling with integer variables. Mathematical Programming Studies\u00a022, 167\u2013184 (1984)","journal-title":"Mathematical Programming Studies"},{"key":"75_CR14","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/BFb0032050","volume-title":"Proceedings of the 17th International Colloquium on Automata, Languages and Programming","author":"D.S. Johnson","year":"1990","unstructured":"Johnson, D.S.: Local Optimization and the Traveling Salesman Problem. In: Proceedings of the 17th International Colloquium on Automata, Languages and Programming, pp. 446\u2013461. Springer, Berlin (1990)"},{"key":"75_CR15","first-page":"215","volume-title":"Local Search in Combinatorial Optimization","author":"D.S. Johnson","year":"1997","unstructured":"Johnson, D.S., McGeoch, L.A.: The Traveling Salesman Problem: A Case Study in Local Optimization. In: Aarts, E.H.L., Lenstra, J.K. (eds.) Local Search in Combinatorial Optimization, pp. 215\u2013310. John Wiley and Sons, Ltd., Chichester (1997)"},{"key":"75_CR16","first-page":"445","volume-title":"The Traveling Salesman Problem and its Variations","author":"D.S. Johnson","year":"2002","unstructured":"Johnson, D.S., Gutin, G., McGeoch, L.A., Yeo, A., Zhang, W., Zverovich, A.: Experimental Analysis of Heuristics for the ATSP. In: Gutin, G., Punnen, A. (eds.) The Traveling Salesman Problem and its Variations, pp. 445\u2013487. Kluwer Academic Publishers, Dordrecht (2002)"},{"key":"75_CR17","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/BF01588253","volume":"17","author":"M.H. Karwan","year":"1979","unstructured":"Karwan, M.H., Rardin, R.L.: Some relationships between Lagrangean and surrogate duality in integer programming. Mathematical Programming\u00a017, 230\u2013334 (1979)","journal-title":"Mathematical Programming"},{"key":"75_CR18","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1023\/A:1021513321301","volume":"117","author":"M.A. Osorio","year":"2002","unstructured":"Osorio, M.A., Glover, F., Hammer, P.: Cutting and Surrogate Constraint Analysis for Improved Multidimensional Knapsack Solutions. Annals of Operations Research\u00a0117, 71\u201393 (2002)","journal-title":"Annals of Operations Research"},{"key":"75_CR19","unstructured":"Osorio, M.A., Glover, F.: Hard Problem Generation for MKP. In: Proceedings of the XI CLAIO. Concepci\u00f3n, Chile (2002)"},{"key":"75_CR20","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1109\/ENC.2003.1232903","volume-title":"Proceedings of the Fourth Mexican International Conference on Computer Science","author":"M.A. Osorio","year":"2003","unstructured":"Osorio, M.A., Glover, F.: Exploiting Surrogate Constraint Analysis for Fixing Variables in both bounds for Multidimensional Knapsack Problems. In: Ch\u00e1vez, E., Favela, J., Mej\u00b4\u0131a, M., Oliart, A. (eds.) Proceedings of the Fourth Mexican International Conference on Computer Science, pp. 263\u2013267. IEEE Computer Society, New Jersey (2003)"},{"key":"75_CR21","volume-title":"Integer Programming","author":"M. Salkin","year":"1975","unstructured":"Salkin, M.: Integer Programming. Adisson-Wesley Publishing Company, New York (1975)"},{"key":"75_CR22","unstructured":"Tucker, A.: On Directed Graphs and Integer Programs, IBM Mathematical Research Projecft Technical Report, Princeton University (1960)"}],"container-title":["Lecture Notes in Computer Science","MICAI 2004: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24694-7_75","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:56:25Z","timestamp":1558299385000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24694-7_75"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540214595","9783540246947"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24694-7_75","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}