{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:17:35Z","timestamp":1725484655898},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540434009"},{"type":"electronic","value":"9783540459958"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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":[[2002]]},"DOI":"10.1007\/3-540-45995-2_25","type":"book-chapter","created":{"date-parts":[[2007,5,29]],"date-time":"2007-05-29T22:33:34Z","timestamp":1180478014000},"page":"248-262","source":"Crossref","is-referenced-by-count":6,"title":["Pipeline Transportation of Petroleum Products with No Due Dates"],"prefix":"10.1007","author":[{"given":"Ruy Luiz","family":"Milidi\u00fa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Artur Alves","family":"Pessoa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo Sany","family":"Laber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,14]]},"reference":[{"key":"25_CR1","unstructured":"R. Ahuja, T. Magnanti, and J. Orlin. Network Flows: Theory, Algorithms and Applications. Prentice Hall, 1993."},{"key":"25_CR2","unstructured":"Eduardo Camponogara. A-teams para um problema de transporte de derivados de petr\u00f3leo. Master\u2019s thesis, Departamento de Ci\u00eancia da Computa\u00e7\u00e3o, IMECC-UNICAMP, December 1995."},{"key":"25_CR3","unstructured":"T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to algorithms. MIT Press and McGraw-Hill Book Company, 6th edition, 1992."},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"R.W. Floyd","year":"1962","unstructured":"R.W. Floyd. Algorithm 97: Shortest path. Communications of ACM, 5:345, 1962.","journal-title":"Communications of ACM"},{"key":"25_CR5","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979."},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Christopher A. Hane and H. Donald Ratliff. Sequencing inputs to multicommodity pipelines. Annals of Operations Research, 57, 1995. Mathematics of Industrial Systems I.","DOI":"10.1007\/BF02099692"},{"key":"25_CR7","unstructured":"Ruy L. Milidi\u00fa, Eduardo S. Laber, Artur A. Pessoa, and Pablo A. Rey. Petroleum products scheduling in pipelines. In The International Workshop on Harbour, Maritime & Industrial Logistics Modeling and Simulation, september 1999."},{"key":"25_CR8","volume-title":"Anais do XXXIII SBPO","author":"R. L. Milidi\u00fa","year":"2001","unstructured":"Ruy L. Milidi\u00fa, Artur A. Pessoa, Viviane Braconi, Eduardo S. Laber, and Pablo A. Rey. Um algoritmo grasp para o problema de transporte de derivados de petr\u00f3leo em oleodutos (to appear). In Anais do XXXIII SBPO, Campos do Jord\u00e3o, SP, Brazil, november 2001."},{"key":"25_CR9","series-title":"Technical Report","volume-title":"Pipeline transportation of petroleum products","author":"R. L. Milidi\u00fa","year":"2000","unstructured":"Ruy L. Milidi\u00fa, Artur A. Pessoa, and Eduardo S. Laber. Pipeline transportation of petroleum products. Technical Report 37, Departamento de Inform\u00e1tica, PUCRJ, Rio de Janeiro, Brasil, September 2000."},{"key":"25_CR10","unstructured":"Ruy L. Milidi\u00fa, Artur A. Pessoa, and Eduardo S. Laber. Transporting petroleum products in pipelines (abstract). In ISMP 2000-17th International Symposium on Mathematical Programming, pages 134\u2013135, Atlanta, Georgia, USA, August 2000."},{"issue":"2","key":"25_CR11","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R. E. Tarjan","year":"1972","unstructured":"R. E. Tarjan. Depth-first search and linear graph algorithms. SIAM Journal on Computing, 1(2):146\u2013160, 1972.","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","LATIN 2002: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45995-2_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T08:30:28Z","timestamp":1556440228000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45995-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540434009","9783540459958"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-45995-2_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]}}}