{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T00:17:25Z","timestamp":1758845845101,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,7,7]],"date-time":"2007-07-07T00:00:00Z","timestamp":1183766400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2007,7,7]]},"DOI":"10.1145\/1276958.1277341","type":"proceedings-article","created":{"date-parts":[[2007,12,7]],"date-time":"2007-12-07T19:19:41Z","timestamp":1197055181000},"page":"1904-1911","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["Multiobjective network design for realistic traffic models"],"prefix":"10.1145","author":[{"given":"Nilanjan","family":"Banerjee","sequence":"first","affiliation":[{"name":"University of Massachusetts, Amherst, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajeev","family":"Kumar","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Kharagpur, Kharagpur, WB, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,7,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.942526"},{"volume-title":"IEOR","author":"Atamturk A.","key":"e_1_3_2_1_2_1","unstructured":"A. Atamturk and D. Rajan . Survivable network design: simultaneous routing of flows and slacks. Research Report , IEOR , University of California at Berkeley . A. Atamturk and D. Rajan. Survivable network design: simultaneous routing of flows and slacks. Research Report, IEOR, University of California at Berkeley."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/3468.541346"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-5184-0","volume-title":"Evolutionary Algorithms for Solving Multiojective Problems","author":"Coello C. A. C.","year":"2002","unstructured":"C. A. C. Coello , D. A. V. Veldhuizen , and G. B. Lamont . Evolutionary Algorithms for Solving Multiojective Problems . Boston, MA : Kluwer , 2002 . C. A. C. Coello, D. A. V. Veldhuizen, and G. B. Lamont. Evolutionary Algorithms for Solving Multiojective Problems. Boston, MA: Kluwer, 2002."},{"key":"e_1_3_2_1_5_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2001","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to Algorithms . MIT Press , 2001 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, 2001."},{"key":"e_1_3_2_1_6_1","volume-title":"Multiobjective Optimization Using Evolutionary Algorithms","author":"Deb K.","year":"2001","unstructured":"K. Deb . Multiobjective Optimization Using Evolutionary Algorithms . Chichester, UK : Wiley , 2001 . K. Deb. Multiobjective Optimization Using Evolutionary Algorithms. Chichester, UK: Wiley, 2001."},{"key":"e_1_3_2_1_7_1","volume-title":"Proc. 32nd South-Eastern Int. Conf. Combinatorics, Graph Theory and Computing","author":"Deo N.","year":"2001","unstructured":"N. Deo and P. Micikevicius . Comparison of pr\u00fcfer-like codes for labeled trees . In Proc. 32nd South-Eastern Int. Conf. Combinatorics, Graph Theory and Computing , 2001 . N. Deo and P. Micikevicius. Comparison of pr\u00fcfer-like codes for labeled trees. In Proc. 32nd South-Eastern Int. Conf. Combinatorics, Graph Theory and Computing, 2001."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01096763"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/3468.650319"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1972.8910"},{"key":"e_1_3_2_1_11_1","volume-title":"Computers and Interactability: A Guide to the Theory of NPCompleteness","author":"Garey M. R.","year":"1979","unstructured":"M. R. Garey and D. S. Johnson . Computers and Interactability: A Guide to the Theory of NPCompleteness . San Francisco, LA : Freeman , 1979 . M. R. Garey and D. S. Johnson. Computers and Interactability: A Guide to the Theory of NPCompleteness. San Francisco, LA: Freeman, 1979."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11107-005-2484-2"},{"key":"e_1_3_2_1_13_1","volume-title":"Boston","author":"Hochbaum D. S.","year":"1997","unstructured":"D. S. Hochbaum . Approximation Algorithms for NP- Hard Problems . Boston , MA : PWS , 1997 . D. S. Hochbaum. Approximation Algorithms for NP-Hard Problems. Boston, MA: PWS, 1997."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/24.210272"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2001.934439"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.607086"},{"key":"e_1_3_2_1_17_1","first-page":"2179","volume-title":"Proc. Genetic and Evolutionary Computations Conference (GECCO-03)","author":"Kumar R.","year":"2023","unstructured":"R. Kumar and N. Banerjee . Multicriteria network design using evolutionary algorithm . In Proc. Genetic and Evolutionary Computations Conference (GECCO-03) , LNCS 2023 , pages 2179 -- 2190 . Springer Verlag , 2003. R. Kumar and N. Banerjee. Multicriteria network design using evolutionary algorithm. In Proc. Genetic and Evolutionary Computations Conference (GECCO-03), LNCS 2023, pages 2179--2190. Springer Verlag, 2003."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2002.1006272"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1162\/106365602760234117"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31880-4_56"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.392383"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/952532.952678"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-001-0038-2"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(98)00016-2"}],"event":{"name":"GECCO07: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation","ACM Association for Computing Machinery"],"location":"London England","acronym":"GECCO07"},"container-title":["Proceedings of the 9th annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1276958.1277341","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1276958.1277341","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:52:22Z","timestamp":1750258342000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1276958.1277341"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7,7]]},"references-count":24,"alternative-id":["10.1145\/1276958.1277341","10.1145\/1276958"],"URL":"https:\/\/doi.org\/10.1145\/1276958.1277341","relation":{},"subject":[],"published":{"date-parts":[[2007,7,7]]},"assertion":[{"value":"2007-07-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}