{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T00:09:14Z","timestamp":1649030954968},"reference-count":7,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1994,5,1]],"date-time":"1994-05-01T00:00:00Z","timestamp":767750400000},"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":[[1994,5]]},"DOI":"10.1016\/0305-0548(94)90105-8","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T12:15:45Z","timestamp":1056975345000},"page":"573-586","source":"Crossref","is-referenced-by-count":1,"title":["Exchange heuristics to improve the clarity of base\/time plots"],"prefix":"10.1016","volume":"21","author":[{"given":"Katherine J.","family":"Toussaint","sequence":"first","affiliation":[]},{"given":"Bruce L.","family":"Golden","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(94)90105-8_BIB1","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1287\/inte.22.3.73","article-title":"A planning heuristic for military airlift","volume":"22","author":"Rappoport","year":"1992","journal-title":"Interfaces"},{"key":"10.1016\/0305-0548(94)90105-8_BIB2","series-title":"The Visual Display of Quantitative Information","author":"Tufte","year":"1983"},{"key":"10.1016\/0305-0548(94)90105-8_BIB3","article-title":"Exchange heuristics to improve the clarity of base\/time plots","author":"Toussaint","year":"1991"},{"key":"10.1016\/0305-0548(94)90105-8_BIB4","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0305-0548(91)90027-O","article-title":"A new heuristic for the linear placement problem","volume":"18","author":"Suryanarayanan","year":"1991","journal-title":"Computers Ops Res"},{"key":"10.1016\/0305-0548(94)90105-8_BIB5","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0021-9991(90)90201-B","article-title":"Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing","volume":"90","author":"Dueck","year":"1990","journal-title":"J. Comput. Physics"},{"key":"10.1016\/0305-0548(94)90105-8_BIB6","article-title":"New optimization heuristics, the great deluge algorithm and the record-to-record travel","author":"Dueck","year":"1990"},{"key":"10.1016\/0305-0548(94)90105-8_BIB7","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1016\/0360-8352(90)90122-3","article-title":"A conceptual solution to the aircraft gate assignment problem using 0,1 linear programming","volume":"19","author":"Bihr","year":"1990","journal-title":"Computers Indust. Engng"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894901058?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894901058?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T13:26:47Z","timestamp":1552915607000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054894901058"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,5]]},"references-count":7,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1994,5]]}},"alternative-id":["0305054894901058"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(94)90105-8","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1994,5]]}}}