{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T10:59:07Z","timestamp":1648897147239},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,4,9]],"date-time":"2008-04-09T00:00:00Z","timestamp":1207699200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2008,8]]},"DOI":"10.1007\/s11590-008-0084-7","type":"journal-article","created":{"date-parts":[[2008,4,8]],"date-time":"2008-04-08T04:03:24Z","timestamp":1207627404000},"page":"577-585","source":"Crossref","is-referenced-by-count":2,"title":["Some observations about the extreme points of the Generalized Cardinality-Constrained Shortest Path Problem polytope"],"prefix":"10.1007","volume":"2","author":[{"given":"Maria Flavia","family":"Monaco","sequence":"first","affiliation":[]},{"given":"Marcello","family":"Sammarra","sequence":"additional","affiliation":[]},{"given":"Luigi","family":"Moccia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,4,9]]},"reference":[{"key":"84_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, Englewood Cliffs, NJ (1993)"},{"issue":"2","key":"84_CR2","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1287\/opre.48.2.318.12378","volume":"48","author":"C. Barnhart","year":"2000","unstructured":"Barnhart C., Hane C.A., Vance P.H. (2000) Using branch-and-price-and-cut to solve origin\u2013destination integer multicommodity flow problems Oper. Res. 48(2):318\u2013326.","journal-title":"Oper. Res."},{"key":"84_CR3","first-page":"191","volume":"26","author":"M. Desrochers","year":"1988","unstructured":"Desrochers, M., Soumis, F.: A generalized permanent labeling algorithm for the shortest path problem with time windows. INFOR 26, 191\u2013212 (1988)","journal-title":"INFOR"},{"issue":"1","key":"84_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/1097-0037(200008)36:1<1::AID-NET1>3.0.CO;2-B","volume":"36","author":"G. Dahl","year":"2000","unstructured":"Dahl, G., Realfsen, B.: The cardinality-constrained shortest path problem in 2-graphs. Networks 36(1), 1\u20138 (2000)","journal-title":"Networks"},{"issue":"1","key":"84_CR5","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1111\/1475-3995.00003","volume":"8","author":"I. Dumitrescu","year":"2001","unstructured":"Dumitrescu, I., Boland, N.: Algorithms for the weight constrained shortest path problem. Int. Trans. Oper. Res. 8(1), 15\u201329 (2001)","journal-title":"Int. Trans. Oper. Res."},{"issue":"3","key":"84_CR6","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1002\/net.10090","volume":"42","author":"I. Dumitrescu","year":"2003","unstructured":"Dumitrescu, I., Boland, N.: Improved preprocessing, labeling and scaling algorithms for the weight-constrained shortest path problem. Networks 42(3), 135\u2013153 (2003)","journal-title":"Networks"},{"key":"84_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"key":"84_CR8","volume-title":"Knapsack Problems\u2014Algorithms and Computer Implementations","author":"S. Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Knapsack Problems\u2014Algorithms and Computer Implementations. Wiley, New York (1990)"},{"key":"84_CR9","unstructured":"Moccia, L., Cordeau, J.-F., Monaco, M.F., Sammarra, M.: Formulations and solution algorithms for a Dynamic Generalized Assignment Problem, Technical Report CIRRELT-2007-16, Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation, Universit\u00e9 de Montr\u00e8al, Canada (2007)"},{"key":"84_CR10","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-008-0084-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-008-0084-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-008-0084-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T11:15:02Z","timestamp":1559560502000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-008-0084-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,4,9]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,8]]}},"alternative-id":["84"],"URL":"https:\/\/doi.org\/10.1007\/s11590-008-0084-7","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,4,9]]}}}