{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T14:31:22Z","timestamp":1774449082927,"version":"3.50.1"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1996,9,1]],"date-time":"1996-09-01T00:00:00Z","timestamp":841536000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Applic"],"published-print":{"date-parts":[[1996,9]]},"DOI":"10.1007\/bf00249646","type":"journal-article","created":{"date-parts":[[2011,11,9]],"date-time":"2011-11-09T02:51:59Z","timestamp":1320807119000},"page":"191-205","source":"Crossref","is-referenced-by-count":54,"title":["A new heuristic algorithm solving the linear ordering problem"],"prefix":"10.1007","volume":"6","author":[{"given":"Stefan","family":"Chanas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prezemys\u0142aw","family":"Kobyla\u0144ski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF00249646_CR1","first-page":"41","volume":"3","author":"S. Chanas","year":"1991","unstructured":"S. Chanas, B. Florkiewicz, and M. Galant-Pater, \u201cHeuristic algorithms for the permutation method of the multiple attribute decision making,\u201d Badania Operacyjne i Decyzje, Nr. 3, pp. 41\u201350, 1991.","journal-title":"Badania Operacyjne i Decyzje"},{"key":"BF00249646_CR2","first-page":"5","volume":"4","author":"S. Chanas","year":"1991","unstructured":"S. Chanas, B. Florkiewicz, and M. Galant-Pater, \u201cComputing aspects of the permutation method in the multiple attribute decision making.\u201d Badania Operacyjne i Decyzje, Nr. 4, pp. 5\u201313, 1991.","journal-title":"Badania Operacyjne i Decyzje"},{"key":"BF00249646_CR3","first-page":"5","volume":"3","author":"S. Chanas","year":"1993","unstructured":"S. Chanas and P. Kobyla\u0144ski, \u201cHeuristic algorithm solving the problem of linear ordering,\u201d Badania Operacyjne i Decyzje, Nr. 3, pp. 5\u20139, 1993.","journal-title":"Badania Operacyjne i Decyzje"},{"key":"BF00249646_CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman: San Francisco, CA, 1979."},{"key":"BF00249646_CR5","doi-asserted-by":"crossref","first-page":"B1190","DOI":"10.1287\/mnsc.20.8.1190","volume":"20","author":"F. Glover","year":"1974","unstructured":"F. Glover, T. Klastorin, and D. Klingman, \u201cOptimal weighted ancestry relationships\u201d, Management Science, vol. 20, pp. B1190-B1193, 1974.","journal-title":"Management Science"},{"issue":"no. 6","key":"BF00249646_CR6","doi-asserted-by":"crossref","first-page":"1195","DOI":"10.1287\/opre.32.6.1195","volume":"32","author":"M. Gr\u00f6tschel","year":"1984","unstructured":"M. Gr\u00f6tschel, M. J\u00fcnger, and G. Reinrlt, \u201cA cutting plane algorithm for the linear ordering problem,\u201d Operations Research, vol. 32, no. 6, pp. 1195\u20131220, 1984.","journal-title":"Operations Research"},{"key":"BF00249646_CR7","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/BF01582009","volume":"33","author":"M. Gr\u00f6tschel","year":"1985","unstructured":"M. Gr\u00f6tschel, M. J\u00fcnger, and G. Reinelt, \u201cOn the acyclic subgraph polytope,\u201d Mathematical Programming, vol. 33, pp. 28\u201342, 1985.","journal-title":"Mathematical Programming"},{"key":"BF00249646_CR8","series-title":"Lecture Notes in Economics and Mathematical Systems","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-48318-9","volume-title":"Multiple Attribute Decision Making, Methods and Applications, A State-of-the-Art-Survey","author":"Ch. Hwang","year":"1981","unstructured":"Ch. Hwang and K. Yoon, \u201cMultiple Attribute Decision Making, Methods and Applications, A State-of-the-Art-Survey,\u201d Lecture Notes in Economics and Mathematical Systems 186, Springer-Verlag: Berlin-Heidelberg-New York, 1981."},{"key":"BF00249646_CR9","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/0377-2217(81)90005-9","volume":"8","author":"R. Kaas","year":"1981","unstructured":"R. Kaas, \u201cA branch and bound algorithm for the acyclic subgraph problem,\u201d European Journal of Operational Research, vol. 8, pp. 355\u2013362, 1981.","journal-title":"European Journal of Operational Research"},{"key":"BF00249646_CR10","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/BF01918332","volume":"12","author":"B. Korte","year":"1968","unstructured":"B. Korte and W. Oberhofer, \u201cZwei Algorithmen zur L\u00f6sung eines komplexen Reihenfolgeproblems,\u201d Unternehmensforschung, vol. 12, pp. 217\u2013231, 1968.","journal-title":"Unternehmensforschung"},{"key":"BF00249646_CR11","series-title":"Report BW26","volume-title":"The acyclic subgraph problem","author":"H.W. Lenstra Jr.","year":"1973","unstructured":"H.W. LenstraJr., \u201cThe acyclic subgraph problem,\u201d Report BW26 (1973), Mathematisch Centrum, Amsterdam."},{"key":"BF00249646_CR12","series-title":"Mathematical Centre Tracts","volume-title":"Sequencing by enumerative methods","author":"J.K. Lenstra","year":"1977","unstructured":"J.K. Lenstra, \u201cSequencing by enumerative methods,\u201d Mathematical Centre Tracts 69 (1977), Mathematisch Centrum, Amsterdam."},{"key":"BF00249646_CR13","unstructured":"P.M. Pardalos and H. Wolkowicz (Eds.), \u201cQuadratic Assignment and related problems,\u201d DIMACS Series, vol. 16, American Mathematical Society, 1994."},{"key":"BF00249646_CR14","volume-title":"Triangulation und Blocktriangulation von Input-Output-Tabellen","author":"H. Wessels","year":"1981","unstructured":"H. Wessels, \u201cTriangulation und Blocktriangulation von Input-Output-Tabellen,\u201d Deutsches Institut f\u00fcr Wirtschaftsforschung: Beitr\u00e4ge zur Strukturforschung, Heft 63, Berlin, 1981."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00249646.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00249646\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00249646","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,3]],"date-time":"2019-04-03T15:56:11Z","timestamp":1554306971000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00249646"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,9]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,9]]}},"alternative-id":["BF00249646"],"URL":"https:\/\/doi.org\/10.1007\/bf00249646","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,9]]}}}