{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:10:38Z","timestamp":1759666238751},"reference-count":13,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"tdm","delay-in-days":5722,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[2000,8]]},"DOI":"10.1002\/1097-0037(200008)36:1<1::aid-net1>3.0.co;2-b","type":"journal-article","created":{"date-parts":[[2002,8,25]],"date-time":"2002-08-25T21:51:59Z","timestamp":1030312319000},"page":"1-8","source":"Crossref","is-referenced-by-count":16,"title":["The cardinality-constrained shortest path problem in 2-graphs"],"prefix":"10.1002","volume":"36","author":[{"given":"Geir","family":"Dahl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bj\ufffdrnar","family":"Realfsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2000]]},"reference":[{"key":"10.1002\/1097-0037(200008)36:1<1::AID-NET1>3.0.CO;2-B-BIB1","volume-title":"Network flows: Theory, algorithms and applications","author":"Ahuja","year":"1993","unstructured":"and Network flows: Theory, algorithms and applications, Prentice-Hall, Englewood Cliffs, NJ, 1993."},{"key":"10.1002\/1097-0037(200008)36:1<1::AID-NET1>3.0.CO;2-B-BIB2","author":"Arge","year":"1994","unstructured":"and Data reduction of piecewise linear curves, Technical report STF33 A94042, SINTEF, Norway, 1994."},{"key":"10.1002\/1097-0037(200008)36:1<1::AID-NET1>3.0.CO;2-B-BIB3","first-page":"168","volume-title":"Data compression","author":"Bhaskaran","year":"1993","unstructured":"and ?Optimal piecewise-linear compression of images,? Data compression, and (Editors), IEEE Computer Society Press, 1993, Chapter 31, pp. 168-177."},{"key":"10.1002\/1097-0037(200008)36:1<1::AID-NET1>3.0.CO;2-B-BIB4","doi-asserted-by":"crossref","first-page":"911","DOI":"10.1002\/nav.3800380609","volume":"38","author":"Burkard","year":"1991","journal-title":"Naval Res Log"},{"key":"10.1002\/1097-0037(200008)36:1<1::AID-NET1>3.0.CO;2-B-BIB5","author":"CPLEX","year":"1994","unstructured":"CPLEX, Using the CPLEX callable library, Technical report, CPLEX Optimization, Inc., 1994."},{"key":"10.1002\/1097-0037(200008)36:1<1::AID-NET1>3.0.CO;2-B-BIB6","author":"Dahl","year":"1996","unstructured":"and Curve approximation and constrained shortest path problems, Technical report 6, University of Oslo, Institute of Informatics, Oslo, Norway, Aug. 1996."},{"key":"10.1002\/1097-0037(200008)36:1<1::AID-NET1>3.0.CO;2-B-BIB7","volume-title":"Computers and intractability. A guide to the theory of NP-completeness","author":"Garey","year":"1979","unstructured":"and Computers and intractability. A guide to the theory of NP-completeness, W.H. Freeman, 1979."},{"key":"10.1002\/1097-0037(200008)36:1<1::AID-NET1>3.0.CO;2-B-BIB8","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/BF02570717","volume":"14","author":"Goodrich","year":"1995","journal-title":"Discr Comput Geomet"},{"key":"10.1002\/1097-0037(200008)36:1<1::AID-NET1>3.0.CO;2-B-BIB9","author":"Gouveia","year":"1996","unstructured":"Using variable redefinition for computing minimum spanning and Steiner trees with hop constraints, Technical report 2, Faculdade de Ci\u00e9ncias da Universidade de Lisboa, Centro de Investiga\u00e7\u00e3o Operacional, Lisbon, Portugal, 1996."},{"key":"10.1002\/1097-0037(200008)36:1<1::AID-NET1>3.0.CO;2-B-BIB10","volume-title":"Adjacency on polytopes in combinatorial optimization","author":"Hausmann","year":"1980","unstructured":"Adjacency on polytopes in combinatorial optimization, Verlag Anton Hain, 1980."},{"key":"10.1002\/1097-0037(200008)36:1<1::AID-NET1>3.0.CO;2-B-BIB11","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0734-189X(86)80027-5","volume":"36","author":"Imai","year":"1986","journal-title":"Comput Vis Graph Image Process"},{"key":"10.1002\/1097-0037(200008)36:1<1::AID-NET1>3.0.CO;2-B-BIB12","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1093\/imanum\/8.2.185","volume":"8","author":"Lyche","year":"1988","journal-title":"IMA J Num Anal"},{"key":"10.1002\/1097-0037(200008)36:1<1::AID-NET1>3.0.CO;2-B-BIB13","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and combinatorial optimization","author":"Nemhauser","year":"1988","unstructured":"and Integer and combinatorial optimization. Wiley, New York, 1988."}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2F1097-0037(200008)36:1%3C1::AID-NET1%3E3.0.CO;2-B","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full\/10.1002\/1097-0037(200008)36:1%3C1::AID-NET1%3E3.0.CO;2-B","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T10:54:22Z","timestamp":1625136862000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/1097-0037(200008)36:1<1::AID-NET1>3.0.CO;2-B"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,8]]}},"URL":"https:\/\/doi.org\/10.1002\/1097-0037(200008)36:1<1::aid-net1>3.0.co;2-b","relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000]]}}}