{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T22:50:26Z","timestamp":1769813426934,"version":"3.49.0"},"reference-count":23,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1999,7,1]],"date-time":"1999-07-01T00:00:00Z","timestamp":930787200000},"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,7]]},"DOI":"10.1016\/s0377-2217(98)00045-9","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T19:21:01Z","timestamp":1049484061000},"page":"51-68","source":"Crossref","is-referenced-by-count":45,"title":["A repeated matching heuristic for the single-source capacitated facility location problem"],"prefix":"10.1016","volume":"116","author":[{"given":"Mikael","family":"R\u00f6nnqvist","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Suda","family":"Tragantalerngsak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Holt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(98)00045-9_BIB1","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1287\/opre.39.3.456","article-title":"Parallel savings based heuristics for the delivery problem","volume":"39","author":"Altinkemer","year":"1991","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(98)00045-9_BIB2","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/0377-2217(84)90211-X","article-title":"A heuristic Lagrangean algorithm for the capacitated plant location problem","volume":"15","author":"Barcelo","year":"1984","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(98)00045-9_BIB3","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0377-2217(93)90118-7","article-title":"Lagrangean heuristic for location problem","volume":"65","author":"Beasley","year":"1993","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(98)00045-9_BIB4","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1057\/jors.1988.173","article-title":"Lagrangian relaxation and single source capacitated facility location problem","volume":"39","author":"Darby-Dowman","year":"1988","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(98)00045-9_BIB5","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/net.3230110407","article-title":"A shortest augmenting path method for solving minimal perfect matching problems","volume":"11","author":"Derigs","year":"1981","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(98)00045-9_BIB6","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF02240072","article-title":"On the use of optimal fractional matchings for solving the (integer) matching problem","volume":"36","author":"Derigs","year":"1986","journal-title":"Computing"},{"key":"10.1016\/S0377-2217(98)00045-9_BIB7","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0305-0548(91)90028-P","article-title":"A new heuristic for the fleet size and mix vehicle routing problem","volume":"18","author":"Desrochers","year":"1991","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0377-2217(98)00045-9_BIB8","first-page":"305","article-title":"A solution procedure for a special type of capacitated warehouse location problem","volume":"13","author":"Fisk","year":"1978","journal-title":"The Logistics and Transportation Review"},{"key":"10.1016\/S0377-2217(98)00045-9_BIB9","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1287\/opre.26.6.992","article-title":"A dual-based procedure for uncapacitated facility location","volume":"26","author":"Erlenkotter","year":"1978","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(98)00045-9_BIB10","first-page":"71","article-title":"A matching algorithm with application to bus operations","volume":"4","author":"Forbes","year":"1991","journal-title":"Australasian Journal of Combinatorics"},{"key":"10.1016\/S0377-2217(98)00045-9_BIB11","doi-asserted-by":"crossref","unstructured":"Forbes, M.A., 1992. Vehicle and Crew Scheduling in Public Transport. Ph.D. Dissertation, Department of Mathematics, University of Queensland, Brisbane","DOI":"10.14264\/uql.2015.549"},{"key":"10.1016\/S0377-2217(98)00045-9_BIB12","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1057\/jors.1986.84","article-title":"A Lagrangian relaxation heuristic for capacitated facility location with single source constraints","volume":"37","author":"Klincewicz","year":"1986","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(98)00045-9_BIB13","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1287\/trsc.24.3.169","article-title":"Fleet size planning when outside carrier services are available","volume":"24","author":"Klincewicz","year":"1990","journal-title":"Transportation Science"},{"key":"10.1016\/S0377-2217(98)00045-9_BIB14","unstructured":"Martello, S., Toth, P., 1990. Knapsack Problems: Algorithms and Computer Implementations. Wiley, New York"},{"key":"10.1016\/S0377-2217(98)00045-9_BIB15","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.1057\/jors.1983.242","article-title":"An algorithm for the fixed-charge assigning users to sources problem","volume":"34","author":"Neebe","year":"1983","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(98)00045-9_BIB16","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0305-0548(87)90022-0","article-title":"Efficient algorithm for the capacitated concentrator location problem","volume":"14","author":"Pirkul","year":"1987","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0377-2217(98)00045-9_BIB17","unstructured":"Ryan, D.M., 1980. ZIP \u2013 A zero\u2013one integer programming package for scheduling. Department of Theoretical and Applied Mechanics, University of Auckland"},{"key":"10.1016\/S0377-2217(98)00045-9_BIB18","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","article-title":"Algorithms for the vehicle routing and scheduling problem with time window constraints","volume":"35","author":"Solomon","year":"1987","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(98)00045-9_BIB19","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1016\/0377-2217(86)90246-8","article-title":"A heuristic Lagrangian algorithm for the capacitated plant location problem \u2013 A comment","volume":"23","author":"Sridharan","year":"1986","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(98)00045-9_BIB20","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0377-2217(93)90219-D","article-title":"A Lagrangian heuristic for the capacitated plant location problem with single source constraints","volume":"66","author":"Sridharan","year":"1993","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(98)00045-9_BIB21","doi-asserted-by":"crossref","first-page":"955","DOI":"10.1287\/opre.16.5.955","article-title":"Heuristic method for estimating the general vertex median of weighted graph","volume":"16","author":"Teitz","year":"1968","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(98)00045-9_BIB22","doi-asserted-by":"crossref","first-page":"1156","DOI":"10.1057\/jors.1994.185","article-title":"A repeated matching heuristic for the vehicle routing problem","volume":"45","author":"Wark","year":"1994","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(98)00045-9_BIB23","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0377-2217(96)00225-1","article-title":"Aircrew schedule generation using repeated matching","volume":"102","author":"Wark","year":"1997","journal-title":"European Journal of Operational Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221798000459?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221798000459?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T09:20:26Z","timestamp":1556097626000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221798000459"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,7]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,7]]}},"alternative-id":["S0377221798000459"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(98)00045-9","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1999,7]]}}}