{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T22:16:29Z","timestamp":1768342589111,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642298271","type":"print"},{"value":"9783642298288","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29828-8_19","type":"book-chapter","created":{"date-parts":[[2012,5,14]],"date-time":"2012-05-14T03:59:40Z","timestamp":1336967980000},"page":"292-306","source":"Crossref","is-referenced-by-count":6,"title":["Solving the Longest Simple Path Problem with Constraint-Based Techniques"],"prefix":"10.1007","author":[{"given":"Quang Dung","family":"Pham","sequence":"first","affiliation":[]},{"given":"Yves","family":"Deville","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","volume-title":"Network flows: theory, algorithms, and applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows: theory, algorithms, and applications. Prentice-Hall, Inc., Upper Saddle River (1993)"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Dooms, G.: The CP(Graph) Computation Domains in Constraint Programming. Ph.D. thesis, UCLouvain, Belgium (2006)","DOI":"10.1007\/11564751_18"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Feillet, D., Dejax, P., Gendreau, M., Gueguen, C.: An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems. Networks, 216\u2013229 (2004)","DOI":"10.1002\/net.20033"},{"key":"19_CR4","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A guide to the Theory of NP-Completeness, 1st edn. W.H. Freeman (1979)"},{"key":"19_CR5","unstructured":"Gondran, M., Minoux, M.: Graphes et algorithmes, 3e \u00e9dition revue et augment\u00e9e. Collection de la Direction des \u00c9tudes et Recherches d\u2019\u00c9lectricit\u00e9 de France, Eyrolles, vol. 37 (1995)"},{"key":"19_CR6","unstructured":"van Hoeve, W.J.: The alldifferent constraint: A survey. In: Sixth Annual Workshop of the ERCIM Working Group on Constraints (2001)"},{"key":"19_CR7","first-page":"421","volume":"18","author":"D. Karger","year":"1993","unstructured":"Karger, D., Motwani, R., Ramkumar, G.: On approximating the longest path in a graph. Algorithmica\u00a018, 421\u2013432 (1993)","journal-title":"Algorithmica"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-642-13520-0_29","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"Q.D. Pham","year":"2010","unstructured":"Pham, Q.D., Deville, Y., Van Hentenryck, P.: Constraint-Based Local Search for Constrained Optimum Paths Problems. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol.\u00a06140, pp. 267\u2013281. Springer, Heidelberg (2010)"},{"key":"19_CR9","unstructured":"Pham, Q.D.: LS(Graph): A constraint-based local search framework for constrained optimum tree and path problems on graphs. Ph.D. thesis, UCLouvain, Belgium (2011)"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Portugal, D., Antunes, C.H., Rocha, R.: A study of genetic algorithms for approximating the longest path in generic graphs. In: Proceedings of SMC 2010, pp. 2539\u20132544 (2010)","DOI":"10.1109\/ICSMC.2010.5641920"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Portugal, D., Rocha, R.: Msp algorithm: Multi-robot patrolling based on territory allocation using balanced graph partitioning. In: Proceedings of SAC 2010, pp. 1271\u20131276 (2010)","DOI":"10.1145\/1774088.1774360"},{"key":"19_CR12","unstructured":"Portugal, D.: Multi-robot patrolling simulation package, \n                  \n                    http:\/\/paloma.isr.uc.pt\/davidbsp\/"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Schmidt, K., Schmidt, E.G.: A longest-path problem for evaluating the worst-case packet delay of switched ethernet. In: Proceedings of SIES 2010, pp. 205\u2013208 (2010)","DOI":"10.1109\/SIES.2010.5551398"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1007\/978-3-540-45193-8_47","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"M. Sellmann","year":"2003","unstructured":"Sellmann, M., Gellermann, T., Wright, R.: Cost-Based Filtering for Shorter Path Constraints. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 694\u2013708. Springer, Heidelberg (2003)"},{"issue":"2","key":"19_CR15","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R. Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth-first search and linear graph algorithms. SIAM J. Comput.\u00a01(2), 146\u2013160 (1972)","journal-title":"SIAM J. Comput."},{"key":"19_CR16","unstructured":"Tseng, I.L., Chen, H.W., Lee, C.I.: Obstacle-aware longest-path routing with parallel milp solvers. In: Proceedings of WCECS-ICCS, vol.\u00a02, pp. 827\u2013831 (2010)"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Wong, W.Y., Lau, T.P., King, I.: Information retrieval in p2p networks using genetic algorithm. In: Proceedings of the 14th Int. World Wide Web Conference, Special Interest Tracks and Posters, pp. 922\u2013923 (2005)","DOI":"10.1145\/1062745.1062799"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29828-8_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:17:41Z","timestamp":1620112661000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29828-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642298271","9783642298288"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29828-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}