{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T18:12:13Z","timestamp":1763057533308},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T00:00:00Z","timestamp":1267488000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1007\/s10878-010-9306-x","type":"journal-article","created":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T23:03:05Z","timestamp":1267484585000},"page":"572-593","source":"Crossref","is-referenced-by-count":11,"title":["Revised GRASP with path-relinking for the linear ordering problem"],"prefix":"10.1007","volume":"22","author":[{"given":"W. Art","family":"Chaovalitwongse","sequence":"first","affiliation":[]},{"given":"Carlos A. S.","family":"Oliveira","sequence":"additional","affiliation":[]},{"given":"Bruno","family":"Chiarini","sequence":"additional","affiliation":[]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[]},{"given":"Mauricio G. C.","family":"Resende","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,3,2]]},"reference":[{"key":"9306_CR1","doi-asserted-by":"crossref","unstructured":"Belloni A, Lucena A (2004) Lagrangian heuristics for the linear ordering problem, pp\u00a037\u201363","DOI":"10.1007\/978-1-4757-4137-7_3"},{"key":"9306_CR2","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1137\/S0895480196300145","volume":"12","author":"G Bolotashvili","year":"1999","unstructured":"Bolotashvili G, Kovalev M, Girlich E (1999) New facets of the linear ordering polytope. SIAM J Discrete Math 12:326\u2013336","journal-title":"SIAM J Discrete Math"},{"key":"9306_CR3","first-page":"241","volume-title":"Handbook of combinatorial optimization","author":"RE Burkard","year":"1998","unstructured":"Burkard RE, \u00c7ela E, Pardalos PM, Pitsoulis LS (1998) The quadratic assignment problem. In: Pardalos PM, Du D-Z (eds) Handbook of combinatorial optimization. Kluwer Academic, Dordrecht, pp\u00a0241\u2013338"},{"key":"9306_CR4","unstructured":"Campos V, Laguna M, Mart\u00ed R (1998) Scatter search for the linear ordering problem. Tech rep, Graduate School of Business, University of Colorado, Boulder, CO\u00a080309, USA"},{"key":"9306_CR5","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1023\/A:1012793906010","volume":"21","author":"V Campos","year":"2001","unstructured":"Campos V, Glover F, Laguna M, Mart\u00ed R (2001) An experimental evaluation of a scatter search for the linear ordering problem. J Glob Optim 21:397\u2013414","journal-title":"J Glob Optim"},{"key":"9306_CR6","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1287\/ijoc.1030.0057","volume":"17","author":"V Campos","year":"2005","unstructured":"Campos V, Laguna M, Mart\u00ed R (2005) Context-independent scatter and tabu search for permutation problems. INFORMS J Comput 17:111\u2013122","journal-title":"INFORMS J Comput"},{"key":"9306_CR7","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF00249646","volume":"6","author":"S Chanas","year":"1996","unstructured":"Chanas S, Kobyla\u0144ski P (1996) A new heuristic algorithm solving the linear ordering problem. Comput Optim Appl 6:191\u2013205","journal-title":"Comput Optim Appl"},{"key":"9306_CR8","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1023\/A:1024427114516","volume":"7","author":"W Chaovalitwongse","year":"2003","unstructured":"Chaovalitwongse W, Kim D-K, Pardalos PM (2003) Grasp with a new local search scheme for vehicle routing problems with time windows. J Combin Optim 7:179\u2013207","journal-title":"J Combin Optim"},{"key":"9306_CR9","doi-asserted-by":"crossref","first-page":"487","DOI":"10.2307\/1907514","volume":"26","author":"HB Chenery","year":"1958","unstructured":"Chenery HB, Watanabe T (1958) International comparisons of the structure of production. Econometrica 26:487\u2013521","journal-title":"Econometrica"},{"key":"9306_CR10","first-page":"254","volume-title":"Supply chain and finance","author":"B Chiarini","year":"2004","unstructured":"Chiarini B, Chaovalitwongse W, Pardalos PM (2004) A new algorithm for the triangulation of input-output tables. In: Migdalas A, Pardalos PM, Baourakis G (eds) Supply chain and finance. World Scientific, Singapore, pp\u00a0254\u2013273"},{"key":"9306_CR11","unstructured":"Christof T, Reinelt G (1997) Low-dimensional linear ordering polytopes"},{"key":"9306_CR12","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1145\/347476.347478","volume":"47","author":"G Even","year":"2000","unstructured":"Even G, Naor J, Rao S, Schieber B (2000) Divide-and-conquer approximation algorithms via spreading metrics. J ACM 47:585\u2013616","journal-title":"J ACM"},{"key":"9306_CR13","first-page":"1","volume":"2","author":"TA Feo","year":"1995","unstructured":"Feo TA, Resende MGC (1995) Greedy randomized adaptive search procedures. J Glob Optim 2:1\u201327","journal-title":"J Glob Optim"},{"key":"9306_CR14","unstructured":"Festa P, Resende MGC (2000) GRASP: An annotated bibliography. Tech rep, AT&T Labs Research, Florham Park, NJ\u00a007733, USA"},{"key":"9306_CR15","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York"},{"key":"9306_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu search","author":"F Glover","year":"1997","unstructured":"Glover F, Laguna M (1997) Tabu search. Kluwer Academic, Dordrecht"},{"key":"9306_CR17","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans MX, Williamson DP (1995) Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J ACM 42:1115\u20131145","journal-title":"J ACM"},{"key":"9306_CR18","unstructured":"Gonz\u00e1lez CG, P\u00e9rez-Brito D (2001) A variable neighborhood search for solving the linear ordering problem. In: Proceedings of the MIC\u20192001-4th metaheuristics international conference, pp\u00a0181\u2013185"},{"key":"9306_CR19","doi-asserted-by":"crossref","unstructured":"Greistorfer P (2004) Experimental pool design: input, output and combination strategies for scatter search, pp\u00a0279\u2013300","DOI":"10.1007\/978-1-4757-4137-7_13"},{"key":"9306_CR20","doi-asserted-by":"crossref","first-page":"1195","DOI":"10.1287\/opre.32.6.1195","volume":"2","author":"M Gr\u00f6tschel","year":"1984","unstructured":"Gr\u00f6tschel M, J\u00fcnger M, Reinelt G (1984) A cutting plane algorithm for the linear ordering problem. Oper Res 2:1195\u20131220","journal-title":"Oper Res"},{"key":"9306_CR21","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01582010","volume":"33","author":"M Gr\u00f6tschel","year":"1985","unstructured":"Gr\u00f6tschel M, J\u00fcnger M, Reinelt G (1985) Facets of the linear ordering polytope. Math Programm 33:43\u201360","journal-title":"Math Programm"},{"key":"9306_CR22","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1109\/SFCS.1989.63542","volume-title":"Proceedings of the 30th annual symposium on foundations of computer science","author":"M Hansen","year":"1989","unstructured":"Hansen M (1989) Approximation algorithms for geometric embeddings in the plane with applications to parallel processing problems. In: Proceedings of the 30th annual symposium on foundations of computer science. IEEE Comput Soc, Los Alamitos, pp\u00a0604\u2013609"},{"key":"9306_CR23","first-page":"1053","volume-title":"Lecture notes in computer science","author":"G Huang","year":"2003","unstructured":"Huang G, Lim A (2003) Designing a hybrid genetic algorithm for the linear ordering problem. In: Cant\u00fa-Paz E, Foster JA, Deb K et al. (eds) Lecture notes in computer science, vol\u00a02723. Springer, Berlin, pp\u00a01053\u20131064"},{"key":"9306_CR24","series-title":"Research and Exposition in Mathematics","volume-title":"Polyhedral combinatorics and the acyclic subdigraph problem","author":"M J\u00fcnger","year":"1985","unstructured":"J\u00fcnger M (1985) Polyhedral combinatorics and the acyclic subdigraph problem. Research and Exposition in Mathematics, vol\u00a07. Heldermann, Berlin"},{"key":"9306_CR25","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1287\/ijoc.11.1.44","volume":"11","author":"M Laguna","year":"1998","unstructured":"Laguna M, Mart\u00ed R (1998) GRASP and path relinking for 2-layer straight line crossing minimization. INFORMS J Comput 11:44\u201352","journal-title":"INFORMS J Comput"},{"key":"9306_CR26","doi-asserted-by":"crossref","first-page":"1217","DOI":"10.1016\/S0305-0548(98)00104-X","volume":"26","author":"M Laguna","year":"1999","unstructured":"Laguna M, Mart\u00ed R, Campos V (1999) Intensification and diversification with elite tabu search solutions for the linear ordering problem. Comput Oper Res 26:1217\u20131230","journal-title":"Comput Oper Res"},{"key":"9306_CR27","doi-asserted-by":"crossref","first-page":"1237","DOI":"10.1109\/TC.2002.1039850","volume":"51","author":"G Lee","year":"2002","unstructured":"Lee G, Lo S-C, Chen ALP (2002) Data allocation on wireless broadcast channels for efficient query processing. IEEE Trans Comput 51:1237\u20131252","journal-title":"IEEE Trans Comput"},{"key":"9306_CR28","volume-title":"Input-output economics","author":"W Leontief","year":"1986","unstructured":"Leontief W (1986) Input-output economics. Oxford University Press, London"},{"key":"9306_CR29","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0166-218X(92)00151-B","volume":"50","author":"J Leung","year":"1994","unstructured":"Leung J, Lee J (1994) More facets from fences for linear ordering and acyclic subgraphs polytopes. Discrete Appl Math 50:185\u2013200","journal-title":"Discrete Appl Math"},{"key":"9306_CR30","series-title":"International series in operations research & management sciences","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/0-306-48056-5_12","volume-title":"Handbook of metaheuristics","author":"R Mart\u00ed","year":"2003","unstructured":"Mart\u00ed R (2003) Multi-start methods. In: Glover F, Kochenberger GA (eds) Handbook of metaheuristics. International series in operations research & management sciences. Kluwer Academic, Dordrecht, pp\u00a0355\u2013368, Chap\u00a012"},{"key":"9306_CR31","unstructured":"Mitchell JE (1997) Computational experience with an interior point cutting plane algorithm. Tech rep, Mathematical Sciences, Rensellaer Polytechnic Institute, Troy, NY\u00a012180-3590, USA"},{"key":"9306_CR32","unstructured":"Mitchell JE (2002) Generating linear ordering problems. http:\/\/www.rpi.edu\/~mitchj\/generators\/linord"},{"key":"9306_CR33","first-page":"345","volume-title":"High performance optimization","author":"JE Mitchell","year":"2000","unstructured":"Mitchell JE, Borchers B (2000) Solving linear ordering problems with a combined interior point\/simplex cutting plane algorithm. In: Frenk H et al. (eds) High performance optimization. Kluwer Academic, Dordrecht, pp\u00a0345\u2013366, Chap\u00a014. http:\/\/www.rpi.edu\/mitchj\/papers\/combined.html"},{"key":"9306_CR34","unstructured":"Newman A (2000) Approximating the maximum acyclic subgraph. Master\u2019s thesis, Massachusetts Institute of Technology"},{"key":"9306_CR35","first-page":"195","volume-title":"Lecture notes in computer science","author":"A Newman","year":"2004","unstructured":"Newman A (2004) Cuts and orderings: On semidefinite relaxations for the linear ordering problem. In: Jansen K, Khanna S, Rolim JDP, Ron D (eds) Lecture notes in computer science, vol\u00a03122. Springer, Berlin, pp\u00a0195\u2013206"},{"key":"9306_CR36","doi-asserted-by":"crossref","unstructured":"Newman A, Vempala S (2001) Fences are futile: on relaxations for the linear ordering problem. In: Proceedings of the eighth conference on integer programming and combinatorial optimization (IPCO), pp\u00a0333\u2013347","DOI":"10.1007\/3-540-45535-3_26"},{"key":"9306_CR37","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1137\/S0097539702413197","volume":"34","author":"S Rao","year":"2004","unstructured":"Rao S, Richa AW (2004) New approximation techniques for some linear ordering problems. SIAM J Comput 34:388\u2013404","journal-title":"SIAM J Comput"},{"key":"9306_CR38","series-title":"Research and exposition in mathematics","volume-title":"The linear ordering problem: algorithms and applications","author":"G Reinelt","year":"1985","unstructured":"Reinelt G (1985) The linear ordering problem: algorithms and applications. Research and exposition in mathematics, vol\u00a08. Heldermann, Berlin"},{"key":"9306_CR39","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BF02573963","volume":"10","author":"G Reinelt","year":"1993","unstructured":"Reinelt G (1993) A note on small linear ordering polytope. Discrete Comput Geom 10:67\u201378","journal-title":"Discrete Comput Geom"},{"key":"9306_CR40","unstructured":"Reinelt G (2002) Linear ordering library (LOLIB). http:\/\/www.iwr.uni-heildelberg.de\/iwr\/comopt\/soft\/LOLIB\/LOLIB.html"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9306-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-010-9306-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9306-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:16Z","timestamp":1559276296000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-010-9306-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3,2]]},"references-count":40,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["9306"],"URL":"https:\/\/doi.org\/10.1007\/s10878-010-9306-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3,2]]}}}