{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T21:22:37Z","timestamp":1770499357778,"version":"3.49.0"},"reference-count":27,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1990,1,1]],"date-time":"1990-01-01T00:00:00Z","timestamp":631152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[1990,1]]},"DOI":"10.1016\/0305-0548(90)90051-8","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"465-473","source":"Crossref","is-referenced-by-count":27,"title":["Methods for the one-dimensional space allocation problem"],"prefix":"10.1016","volume":"17","author":[{"given":"David","family":"Romero","sequence":"first","affiliation":[]},{"given":"Adolfo","family":"S\u00e1nchez-Flores","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(90)90051-8_BIB1","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1145\/321765.321775","article-title":"Placement of records on a secondary storage device to minimize access time","volume":"20","author":"Grossman","year":"1973","journal-title":"J. Ass. Comput. Mach."},{"key":"10.1016\/0305-0548(90)90051-8_BIB2","series-title":"Complexity of Computer Computations","first-page":"111","article-title":"An N log N algorithm to distribute N records in a sequential access file","author":"Pratt","year":"1972"},{"key":"10.1016\/0305-0548(90)90051-8_BIB3","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/0020-0190(81)90061-2","article-title":"An approximation algorithm for reducing expected head movement in linear storage devices","volume":"13","author":"Troya","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0305-0548(90)90051-8_BIB4","article-title":"Variations sur l'effet Condorcet","author":"Romero","year":"1978"},{"key":"10.1016\/0305-0548(90)90051-8_BIB5","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/0307-904X(88)90027-3","article-title":"Classification by ordering a (sparse) matrix: a \u201csimulated annealing\u201d approach","volume":"12","author":"Doyle","year":"1988","journal-title":"Appl. Math. Modell."},{"key":"10.1016\/0305-0548(90)90051-8_BIB6","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1051\/ro\/1982160302631","article-title":"Deux probl\u00e8mes d'affectation non lin\u00e9aires","volume":"16","author":"Beghin-Picavet","year":"1982","journal-title":"RAIRO Rech. Op\u00e9rat."},{"key":"10.1016\/0305-0548(90)90051-8_BIB7","doi-asserted-by":"crossref","first-page":"952","DOI":"10.1287\/opre.27.5.952","article-title":"Some layout problems on the line with interdistance constraints and costs","volume":"27","author":"Chan","year":"1979","journal-title":"Opns Res."},{"key":"10.1016\/0305-0548(90)90051-8_BIB8","doi-asserted-by":"crossref","first-page":"812","DOI":"10.1287\/opre.17.5.812","article-title":"One-dimensional space allocation: an ordering algorithm","volume":"17","author":"Simmons","year":"1969","journal-title":"Opns Res."},{"key":"10.1016\/0305-0548(90)90051-8_BIB9","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","article-title":"Some simplified NP-complete graph problems","volume":"1","author":"Garey","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0305-0548(90)90051-8_BIB10","first-page":"139","article-title":"On solving a one-dimensional space allocation problem with integer programming","volume":"14","author":"Love","year":"1976","journal-title":"INFOR"},{"key":"10.1016\/0305-0548(90)90051-8_BIB11","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1287\/opre.29.2.371","article-title":"On the one-dimensional space allocation problem","volume":"29","author":"Picard","year":"1981","journal-title":"Opns Res."},{"key":"10.1016\/0305-0548(90)90051-8_BIB12","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"10.1016\/0305-0548(90)90051-8_BIB13","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF00940812","article-title":"Thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm","volume":"45","author":"\u010cern\u00fd","year":"1985","journal-title":"J. Optim. Theory Applic."},{"key":"10.1016\/0305-0548(90)90051-8_BIB14","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1038\/329215a0","article-title":"New optimization methods from physics and biology","volume":"329","author":"Bounds","year":"1987","journal-title":"Nature"},{"key":"10.1016\/0305-0548(90)90051-8_BIB15","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1137\/0125042","article-title":"Optimal linear ordering","volume":"25","author":"Adolphson","year":"1973","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0305-0548(90)90051-8_BIB16","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1287\/mnsc.9.4.586","article-title":"The quadratic assignment problem","volume":"9","author":"Lawler","year":"1963","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(90)90051-8_BIB17","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800030106","article-title":"Various optimizers for single-state production","volume":"3","author":"Smith","year":"1956","journal-title":"Naval Res. Log. Q."},{"key":"10.1016\/0305-0548(90)90051-8_BIB18","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1137\/0115060","article-title":"Finite-state processes and dynamic programming","volume":"15","author":"Karp","year":"1967","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0305-0548(90)90051-8_BIB19","article-title":"On the one-dimensional space allocation problem","author":"Picard","year":"1978"},{"key":"10.1016\/0305-0548(90)90051-8_BIB20","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/S0019-9958(72)90211-2","article-title":"Minimizing expected travel time on geometrical patterns by optimal probability rearrangements","volume":"20","author":"Bergmans","year":"1972","journal-title":"Inform. Cont."},{"key":"10.1016\/0305-0548(90)90051-8_BIB21","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","article-title":"Equation of state calculations by fast computing machines","volume":"21","author":"Metropolis","year":"1953","journal-title":"J. Chem. Phys."},{"key":"10.1016\/0305-0548(90)90051-8_BIB22","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1137\/1026105","article-title":"The N-city travelling salesman problem: statistical mechanics and the Metropolis algorithm","volume":"26","author":"Bonomi","year":"1984","journal-title":"SIAM Rev."},{"key":"10.1016\/0305-0548(90)90051-8_BIB23","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0377-2217(84)90231-5","article-title":"A thermodynamically motivated simulation procedure for combinatorial optimization problems","volume":"17","author":"Burkard","year":"1984","journal-title":"Eur. J. Opl Res."},{"key":"10.1016\/0305-0548(90)90051-8_BIB24","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/S0377-2217(87)80148-0","article-title":"Some experiments with simulated annealing for coloring graphs","volume":"32","author":"Chams","year":"1987","journal-title":"Eur. J. Opl Res."},{"key":"10.1016\/0305-0548(90)90051-8_BIB25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02242185","article-title":"A simulated annealing approach to the multiconstraint zero-one knapsack problem","volume":"40","author":"Drexl","year":"1988","journal-title":"Computing"},{"key":"10.1016\/0305-0548(90)90051-8_BIB26","article-title":"Simulated annealing applied to a single machine scheduling problem with sequence dependent set up times and due dates","author":"Perusch","year":"1986"},{"key":"10.1016\/0305-0548(90)90051-8_BIB27","first-page":"A85","article-title":"Euclidean matching problems and the Metropolis algorithm","volume":"30","author":"Weber","year":"1986","journal-title":"Zt. Opns Res."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054890900518?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054890900518?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T17:20:32Z","timestamp":1552929632000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054890900518"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,1]]},"references-count":27,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1990,1]]}},"alternative-id":["0305054890900518"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(90)90051-8","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1990,1]]}}}