{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:28:15Z","timestamp":1759667295886},"reference-count":15,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"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":[[1999,2]]},"DOI":"10.1016\/s0377-2217(97)00401-3","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:21:01Z","timestamp":1049502061000},"page":"635-645","source":"Crossref","is-referenced-by-count":17,"title":["Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures"],"prefix":"10.1016","volume":"112","author":[{"given":"Ali","family":"Amiri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erik","family":"Rolland","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reza","family":"Barkhi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(97)00401-3_BIB1","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF02022997","article-title":"Path assignment for call routing: An application of tabu search","volume":"41","author":"Anderson","year":"1993","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(97)00401-3_BIB2","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1016\/0377-2217(79)90228-5","article-title":"A survey of various tactics for generating Lagrangean multipliers in the context of Lagrangean duality","volume":"3","author":"Bazaraa","year":"1979","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00401-3_BIB3","unstructured":"Cox, L.A., L. Davis, L., Qui, Y., 1991. Dynamic anticipatory routing in circuit-switched telecommunications networks. In: Davis, L. (Ed.), Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York"},{"key":"10.1016\/S0377-2217(97)00401-3_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","article-title":"Lagrangean relaxation methods for solving integer programming","volume":"27","author":"Fisher","year":"1981","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00401-3_BIB5","unstructured":"Ford, L.R., Jr., Fulkerson, D.R., 1962. Flows in Networks. Princeton Univ. Press, Princeton, NJ"},{"key":"10.1016\/S0377-2217(97)00401-3_BIB6","unstructured":"Garey, M.R., Johnson, D.S., 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness, p. 215 W.H. Freeman, New York"},{"key":"10.1016\/S0377-2217(97)00401-3_BIB7","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0305-0548(78)90018-7","article-title":"On obtaining the `Best' multipliers for a Lagrangean relaxation for integer programming","volume":"5","author":"Gavish","year":"1978","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(97)00401-3_BIB8","unstructured":"Gerla, M., 1973. The design of store-and-forward (S\/F) networks for computer communications, Ph.D. Dissertation, Computer Science Dept., Univ. of California, Los Angeles"},{"key":"10.1016\/S0377-2217(97)00401-3_BIB9","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/BF01580223","article-title":"Validation of subgradient optimization","volume":"5","author":"Held","year":"1974","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(97)00401-3_BIB10","unstructured":"Kleinrock, L., 1964. Communications Nets: Stochastic Message Flow and Delay. Dover, New York"},{"key":"10.1016\/S0377-2217(97)00401-3_BIB11","unstructured":"Kleinrock, L., 1976. Queueing Systems, vols. 1 & 2. Wiley\/Interscience, New York"},{"key":"10.1016\/S0377-2217(97)00401-3_BIB12","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1287\/mnsc.39.4.492","article-title":"Bandwidth packing: A tabu search approach","volume":"39","author":"Laguna","year":"1993","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00401-3_BIB13","doi-asserted-by":"crossref","first-page":"1277","DOI":"10.1287\/mnsc.42.9.1277","article-title":"An integer programming approach to the bandwidth packing problem","volume":"42","author":"Park","year":"1996","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00401-3_BIB14","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/BF02109857","article-title":"A column generation algorithm for bandwidth packing","volume":"2","author":"Parker","year":"1995","journal-title":"Telecommunications Systems"},{"key":"10.1016\/S0377-2217(97)00401-3_BIB15","first-page":"593","article-title":"A general method of solving extremum problems","volume":"8","author":"Poljack","year":"1967","journal-title":"Soviet Math. Doklady"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797004013?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797004013?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T16:56:51Z","timestamp":1556384211000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221797004013"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,2]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1999,2]]}},"alternative-id":["S0377221797004013"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(97)00401-3","relation":{},"ISSN":["0377-2217"],"issn-type":[{"type":"print","value":"0377-2217"}],"subject":[],"published":{"date-parts":[[1999,2]]}}}