{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:34:12Z","timestamp":1725485652890},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540434757"},{"type":"electronic","value":"9783540460169"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46016-0_26","type":"book-chapter","created":{"date-parts":[[2007,6,7]],"date-time":"2007-06-07T03:05:14Z","timestamp":1181185514000},"page":"242-251","source":"Crossref","is-referenced-by-count":0,"title":["Solving Optimal Location of Traffic Counting Points at Urban Intersections in CLP(FD)"],"prefix":"10.1007","author":[{"given":"Ana Paula","family":"Tom\u00e1s","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,5,7]]},"reference":[{"unstructured":"Andrade M.: M\u00e9todos e T\u00e9cnicas de Recolha de Dados de Tr\u00e1fego \u2014 Algoritmo para a Defini\u00e7\u00e3o da Matriz Origem-Destino. Msc. Thesis, Faculty of Engineering, University of Porto, Portugal, 2000.","key":"26_CR1"},{"key":"26_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BFb0033845","volume-title":"An Open-Ended Finite Domain Constraint Solver","author":"M. Carlsson","year":"1997","unstructured":"Carlsson M., Ottosson G., Carlson B.: An Open-Ended Finite Domain Constraint Solver. In Proceedings of PLILP\u201997, LNCS 1292, 191\u2013206, Springer-Verlag, 1997."},{"issue":"1","key":"26_CR3","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1287\/trsc.35.1.50.10140","volume":"35","author":"L. Bianco","year":"2001","unstructured":"Bianco L., Confessore G., and Reverberi P.: A Network Based Model for Traffic Sensor Location with Implications on O\/D Matrix Estimates. J. Transportation Science, 35(1), 50\u201360, 2001.","journal-title":"J. Transportation Science"},{"doi-asserted-by":"crossref","unstructured":"Cook W., Cunningham W., Pulleyblank W., and Schrijver A.: Combinatorial Optimization. John Wiley & Sons, 1998, Chapter 8.","key":"26_CR4","DOI":"10.1002\/9781118033142"},{"unstructured":"Cormen H., Leiserson C., Rivest R.: Introduction to Algorithms, MIT Press, 1990.","key":"26_CR5"},{"issue":"1","key":"26_CR6","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1023\/A:1009749006768","volume":"2","author":"E. Freuder","year":"1997","unstructured":"Freuder E.: In Pursuit of the Holy Grail, Constraints, 2(1), 57\u201362, 1997.","journal-title":"Constraints"},{"unstructured":"Hadley G.: Linear Programming. Addison-Wesley, 1969.","key":"26_CR7"},{"unstructured":"Hillier S. H., Lieberman G. J.: Introduction to Operations Research. McGraw-Hill, 6th Ed, 1995.","key":"26_CR8"},{"doi-asserted-by":"crossref","unstructured":"Marriott K., and Stuckey P.: Programming with Constraints \u2014 An Introduction, The MIT Press, 1998.","key":"26_CR9","DOI":"10.7551\/mitpress\/5625.001.0001"},{"unstructured":"Mansfield L. E.: Linear Algebra with Geometric Applications, Marcel Dekker, 1976.","key":"26_CR10"},{"issue":"2","key":"26_CR11","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0191-2615(97)00016-7","volume":"32B","author":"H. Yang","year":"1998","unstructured":"Yang H., and Zhou J.: Optimal Traffic Counting Locations for Origin-Destination Matrix Estimation. J. Transportation Research, 32B(2), 109\u2013126, 1998.","journal-title":"J. Transportation Research"},{"unstructured":"Tom\u00e1s A. P., Andrade M., and Pires da Costa A.: Obtaining OD Data at Optimal Cost at Urban Roundabouts, Internal Report DCC-2-2001, DCC-FC & LIACC, University of Porto, 2001. http:\/\/www.ncc.up.pt\/fcup\/DCC\/Pubs\/treports.html . Presented at CSOR\u201901 Workshop (part of EPIA\u201901), Porto, December 2001.","key":"26_CR12"},{"unstructured":"Tom\u00e1s A. P.: A Note on Sensor Location for Traffic Counting at Roundabouts \u2014 Solutions for a Particular Cost Function, Internal Report DCC-3-2001, DCC-FC & LIACC, University of Porto, 2001.","key":"26_CR13"}],"container-title":["Lecture Notes in Computer Science","MICAI 2002: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46016-0_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T19:46:49Z","timestamp":1556480809000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46016-0_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540434757","9783540460169"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-46016-0_26","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}