{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T09:07:14Z","timestamp":1766135234477},"reference-count":23,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s0377-2217(02)00262-x","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T11:56:01Z","timestamp":1034596561000},"page":"221-230","source":"Crossref","is-referenced-by-count":17,"title":["A penalty function heuristic for the resource constrained shortest path problem"],"prefix":"10.1016","volume":"142","author":[{"given":"Pasquale","family":"Avella","sequence":"first","affiliation":[]},{"given":"Maurizio","family":"Boccia","sequence":"additional","affiliation":[]},{"given":"Antonio","family":"Sforza","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00262-X_BIB1","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1002\/net.3230130212","article-title":"Shortest chain subject to side conditions","volume":"13","author":"Aneja","year":"1983","journal-title":"Networks"},{"issue":"4","key":"10.1016\/S0377-2217(02)00262-X_BIB2","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/net.3230190402","article-title":"An algorithm for the resource constrained shortest path problem","volume":"19","author":"Beasley","year":"1989","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(02)00262-X_BIB3","unstructured":"Bienstock, D., 1998. Experiments with a network design algorithm using \u03b5-approximate linear programs, Technical Report, Columbia University"},{"key":"10.1016\/S0377-2217(02)00262-X_BIB4","unstructured":"Bienstock, D., 1999. Approximately solving large-scale linear programs. I. Strengthening lower bounds and accelerating convergence, Technical Report, Columbia University"},{"key":"10.1016\/S0377-2217(02)00262-X_BIB5","unstructured":"Boccia, M., Sforza, A., 1999. Path design for the fleet of low emission vehicles of the ATENA Project, Technical Report, University of Naples"},{"key":"10.1016\/S0377-2217(02)00262-X_BIB6","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connection with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numerical Mathematics"},{"key":"10.1016\/S0377-2217(02)00262-X_BIB7","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1016\/S0377-2217(97)00149-5","article-title":"Two engineering applications of a constrained shortest-path model","volume":"103","author":"Elimam","year":"1997","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00262-X_BIB8","series-title":"Proceedings of the 25th STOC","first-page":"698","article-title":"Approximate max-flow min-(multi)cut theorems and their applications","author":"Garg","year":"1993"},{"key":"10.1016\/S0377-2217(02)00262-X_BIB9","doi-asserted-by":"crossref","unstructured":"Goldberg, A., Oldham, J., Plotkin, S., Stein, C., 1998. An implementation of a combinatorial approximation algorithm for minimum multicommodity flow, IPCO","DOI":"10.1007\/3-540-69346-7_26"},{"key":"10.1016\/S0377-2217(02)00262-X_BIB10","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1137\/0804004","article-title":"Fast approximate schemes for convex programs with many blocks and coupling constraints","volume":"4","author":"Grigoriadis","year":"1994","journal-title":"SIAM Journal on Optimization"},{"key":"10.1016\/S0377-2217(02)00262-X_BIB11","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/net.3230260202","article-title":"An exponential-function reduction method for block-angular convex programs","volume":"26","author":"Grigoriadis","year":"1995","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(02)00262-X_BIB12","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1007\/BF02592195","article-title":"Approximate minimum-cost multicommodity flows in O(\u03b5\u22122KNM) time","volume":"75","author":"Grigoriadis","year":"1996","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(02)00262-X_BIB13","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1002\/net.3230100403","article-title":"A dual, algorithm for the constrained shortest path problem","volume":"10","author":"Handler","year":"1980","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(02)00262-X_BIB14","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1002\/net.3230140109","article-title":"Algorithms for finding paths with multiple constraints","volume":"14","author":"Jaffe","year":"1984","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(02)00262-X_BIB15","unstructured":"Jensen, P.A., Berry, R.C., 1971. A constrained shortest path algorithm, Paper presented at the 39th National ORSA Meeting, Dallas, TX, USA. Abstract given in ORSA Bulletin 19, B-139"},{"key":"10.1016\/S0377-2217(02)00262-X_BIB16","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0022-247X(66)90020-5","article-title":"The shortest route problem with constraints","volume":"14","author":"Joksch","year":"1966","journal-title":"Journal of Mathematical and Analytical Applications"},{"key":"10.1016\/S0377-2217(02)00262-X_BIB17","series-title":"Proceedings of the 23th STOC","first-page":"101","article-title":"Fast approximation algorithms for multicommodities flow problems","author":"Leighton","year":"1991"},{"key":"10.1016\/S0377-2217(02)00262-X_BIB18","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1002\/net.3230160204","article-title":"Implementation of algorithms for k-shortest loopless paths","volume":"16","author":"Perko","year":"1986","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(02)00262-X_BIB19","series-title":"Proceedings of the 27th Annual ACM Symposium on Theory of Computing","first-page":"18","article-title":"Adding multiple cost constraints to combinatorial optimization problems","author":"Plotkin","year":"1995"},{"key":"10.1016\/S0377-2217(02)00262-X_BIB20","unstructured":"Witzgall, C., Goldman, A.J., 1965. Most profitable routing before maintenance. Paper presented at the 27th National ORSA Meeting, Boston, MA, USA. Abstract given in ORSA Bulletin 13, B-82"},{"key":"10.1016\/S0377-2217(02)00262-X_BIB21","unstructured":"XPRESS-MP, 2000. Optimisation Subroutine Library, XOSL, Reference Manual, Release 12, Dash Associates"},{"key":"10.1016\/S0377-2217(02)00262-X_BIB22","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","article-title":"Finding the k-shortest, loopless paths in a network","volume":"17","author":"Yen","year":"1971","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(02)00262-X_BIB23","unstructured":"ZIB, MP-TESTDATA, 1988. Maximum Flow Problem. Instances available from http:\/\/elib.zib.de\/pub\/mp-testdata\/maxflow\/index.html"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722170200262X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722170200262X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T14:51:39Z","timestamp":1555167099000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S037722170200262X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S037722170200262X"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00262-x","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}