{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T11:08:45Z","timestamp":1764587325834},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2005,7,1]],"date-time":"2005-07-01T00:00:00Z","timestamp":1120176000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2005,7]]},"DOI":"10.1007\/s10732-005-2135-x","type":"journal-article","created":{"date-parts":[[2005,9,4]],"date-time":"2005-09-04T12:24:56Z","timestamp":1125836696000},"page":"307-336","source":"Crossref","is-referenced-by-count":25,"title":["Parametric Ghost Image Processes for Fixed-Charge Problems: A Study of Transportation Networks"],"prefix":"10.1007","volume":"11","author":[{"given":"Fred","family":"Glover","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2135_CR1","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0305-0483(03)00025-2","volume":"31","author":"V. Adlakha","year":"2003","unstructured":"Adlakha, V. and K. Kowalski. (2003). \u201cA Simple Heuristic for Solving Small Fixed-Charge Transportation Problems.\u201d Omega 31, 205\u2013211.","journal-title":"Omega"},{"key":"2135_CR2","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1137\/1018115","volume":"18","author":"E. Balas","year":"1976","unstructured":"Balas, E. and M.W. Padberg. (1976). \u201cSet Partitioning: A Survey.\u201d SIAM Review 18, 710\u2013760.","journal-title":"SIAM Review"},{"key":"2135_CR3","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1002\/nav.3800080104","volume":"8","author":"M.L. Balinski","year":"1961","unstructured":"Balinski, M.L. (1961). \u201cFixed Cost Transportation Problem.\u201d Naval Research Logistics Quarterly 8, 41\u201354.","journal-title":"Naval Research Logistics Quarterly"},{"key":"2135_CR4","first-page":"443","volume":"29","author":"R.S. Barr","year":"1981","unstructured":"Barr, R.S., F. Glover, and D. Klingman. D. (1981). \u201cA New Optimization Method for Large Scale Fixed Charge Transportation Problems.\u201d Operations Research 29, 443\u2013463.","journal-title":"Operations Research"},{"key":"2135_CR5","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1002\/(SICI)1520-6750(199906)46:4<341::AID-NAV1>3.0.CO;2-A","volume":"46","author":"G.J. Bell","year":"1999","unstructured":"Bell, G.J., B.W Lamar, and C.A. Wallace. (1999). \u201cCapacity Improvement, Penalties, and the Fixed Charge Transportation Problem.\u201d Naval Research Logistics Quarterly 46, 341\u2013355.","journal-title":"Naval Research Logistics Quarterly"},{"key":"2135_CR6","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/nav.3800310115","volume":"31","author":"A.V. Cabot","year":"1984","unstructured":"Cabot, A.V. and S.S Erenguc. (1984). \u201cSome Branch and Bound Procedures for Fixed Charge Transportation Problems,\u201d Naval Research Logistics Quarterly 31, 145\u2013154.","journal-title":"Naval Research Logistics Quarterly"},{"key":"2135_CR7","first-page":"856","volume":"31","author":"A.V. Cabot","year":"1986","unstructured":"Cabot, A.V. and S.S. Erenguc. (1986). \u201cImproved Penalties for Fixed Cost Transportation Problems.\u201d Naval Research Logistics Quarterly 31, 856\u2013869.","journal-title":"Naval Research Logistics Quarterly"},{"issue":"(1)","key":"2135_CR8","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0898-1221(75)90010-3","volume":"1","author":"L. Cooper","year":"1975","unstructured":"Cooper, L. (1975). \u201cThe Fixed Charge Problem-1: A New Heuristic.\u201d Computers and Mathematics with applications 1(1), 89\u201396.","journal-title":"Computers and Mathematics with applications"},{"key":"2135_CR9","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1002\/nav.3800140110","volume":"14","author":"L. Cooper","year":"1967","unstructured":"Cooper, L. and C. Drebes. (1967). \u201cAn Approximation Algorithm for the Fixed Charge Problem.\u201d Naval Research Logistics Quarterly 14, 89\u201396.","journal-title":"Naval Research Logistics Quarterly"},{"key":"2135_CR10","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1287\/mnsc.23.8.789","volume":"23","author":"G. Cornuejols","year":"1977","unstructured":"Cornuejols, G., L. Fisher, and G.L. Nemhauser. (1977). \u201cLocation of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms.\u201d Management Science 23, 789\u2013810.","journal-title":"Management Science"},{"key":"2135_CR11","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0166-218X(00)00310-3","volume":"112","author":"T.G. Crainic","year":"2001","unstructured":"Crainic, T.G., A. Frangioni, and B. Gendron. (2001). \u201cBundle-Based Relaxation Methods for Multicommodity Capacitated Fixed Charge Network Design.\u201d Discrete Applied Mathematics 112, 73\u201399.","journal-title":"Discrete Applied Mathematics"},{"issue":"(5)","key":"2135_CR12","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1023\/B:HEUR.0000045323.83583.bd","volume":"10","author":"T.G. Crainic","year":"2004","unstructured":"Crainic, T.G., B. Gendron, and G. Hernu. 2004. A slope scaling\/Lagrangian perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design. Journal of Heuristics 10(5), 525\u2013545.","journal-title":"Journal of Heuristics"},{"key":"2135_CR13","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1002\/nav.3800160311","volume":"16","author":"D.R. Denzler","year":"1964","unstructured":"Denzler, D.R. (1964). \u201cAn Approximate Algorithm for the Fixed Charge Problem.\u201d Naval Research Logistics Quarterly 16, 411\u2013416.","journal-title":"Naval Research Logistics Quarterly"},{"key":"2135_CR14","doi-asserted-by":"crossref","first-page":"991","DOI":"10.1057\/jors.1991.189","volume":"42","author":"M. Diaby","year":"1991","unstructured":"Diaby, M. (1991). \u201cSuccessive Linear Approximation Procedure for Generalized Fixed-Charge Transportation Problem.\u201d Journal of Operation Research Society 42, 991\u20131001.","journal-title":"Journal of Operation Research Society"},{"key":"2135_CR15","unstructured":"Dongarra, J.J. (2002). \u201cPerformance of Various Computers Using Standard Linear Equations Software.\u201d Research working paper CS-89\u201385, University of Tennessee, Knoxville, TN 37996."},{"issue":"(3)","key":"2135_CR16","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1002\/nav.3800130306","volume":"13","author":"P.S. Dwyer","year":"1966","unstructured":"Dwyer, P.S. (1966). \u201cUse of Completely Reduced Numbers in Solving Transportation Problems with Fixed Charge.\u201d Naval Research Logistics Quarterly 13(3), 289\u2013313.","journal-title":"Naval Research Logistics Quarterly"},{"key":"2135_CR17","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1002\/nav.3800260408","volume":"26","author":"J. Fisk","year":"1979","unstructured":"Fisk, J. and P.G. McKeown. (1979). \u201cThe Pure Fixed Charge Transportation Problem.\u201d Naval Research Logistics Quarterly 26, 631\u2013641.","journal-title":"Naval Research Logistics Quarterly"},{"key":"2135_CR18","doi-asserted-by":"crossref","unstructured":"Gendron, B., J.Y. Potvin, and P. Sorian. (2003a). \u201cA Tabu Search with Slope Scaling for the Multicommodity Capacitated Location Problem with Balancing Requirements.\u201d Annals of Operations Research 122, 193\u2013217.","DOI":"10.1023\/A:1026102724889"},{"key":"2135_CR19","doi-asserted-by":"crossref","unstructured":"Gendron, B., J.Y. Potvin, and P. Sorian. (2003b). \u201cA Parallel Hybrid Heuristic for the Multicommodity Capacitated Location Problem with Balancing Requirements. Parallel Computing 29, 592\u2013606.","DOI":"10.1016\/S0167-8191(03)00044-9"},{"issue":"(8)","key":"2135_CR20","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1016\/0305-0548(94)90012-4","volume":"21","author":"F. Glover","year":"1994","unstructured":"Glover, F. (1994). \u201cOptimization by Ghost Image Processes in Neural Networks.\u201d Computers and Operations Research 21(8) 801\u2013822.","journal-title":"Computers and Operations Research"},{"key":"2135_CR21","unstructured":"Glover, F. 1996. GN2PC: An MS DOS Based Network Optimizing System."},{"key":"2135_CR22","unstructured":"Glover, F., M.M. Amini, and G. Kochenberger. (2003). \u201cDiscrete Optimization via Netform Representations and a New Dynamic Branch and Bound Method.\u201d Working research paper, University of Colorado-Boulder, CO."},{"key":"2135_CR23","doi-asserted-by":"crossref","DOI":"10.1002\/9781118033173","volume-title":"Network Models in Optimization and their Applications in Practice","author":"F. Glover","year":"1992","unstructured":"Glover, F., D. Klingman, and N. Phillips. (1992). Network Models in Optimization and their Applications in Practice. New York:Wiley."},{"key":"2135_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"Glover, F. and M. Laguna. (1997). Tabu Search. Kluwer Academic Publishers. Hingham, MA."},{"key":"2135_CR25","unstructured":"Gottlieb, J. and C. Eckert. (2002). \u201cA Comparison of Two Representations for the Fixed Charge Transportation Problem.\u201d In J.J. Merelo et al. (eds.), Parallel Problem Solving From Nature\u2014PP3NVII, Lecture Notes in Computer Science Vol. 2439. Springer Publishing Company, pp. 77\u201387."},{"key":"2135_CR26","doi-asserted-by":"crossref","first-page":"1529","DOI":"10.1287\/opre.19.6.1529","volume":"19","author":"P. Gray","year":"1971","unstructured":"Gray, P. (1971). \u201cExact Solution of the Fixed Charge Transportation Problem.\u201d Operations Research 19, 1529\u20131538.","journal-title":"Operations Research"},{"key":"2135_CR27","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1002\/nav.3800150306","volume":"15","author":"W.M. Hirsch","year":"1968","unstructured":"Hirsch, W.M. and G.B. Dantzig. (1968). \u201cThe Fixed Charge Problem.\u201d Naval Research Logistics Quarterly 15, 413\u2013424.","journal-title":"Naval Research Logistics Quarterly"},{"key":"2135_CR28","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1080\/05695557608975073","volume":"8","author":"J.L. Kennington","year":"1976","unstructured":"Kennington, J.L. (1976). \u201cThe Fixed Charge Transportation Problem: A Computational Study with a Branch and Bound Code.\u201d AIIE Transaction 8, 241\u2013247.","journal-title":"AIIE Transaction"},{"key":"2135_CR29","doi-asserted-by":"crossref","first-page":"1116","DOI":"10.1287\/mnsc.22.10.1116","volume":"22","author":"J.L. Kennington","year":"1976","unstructured":"Kennington, J.L. and E. Unger. (1976). \u201cA New Branch and Bound Algorithm for the Fixed Charge Transportation Problem.\u201d Management Science 22, 1116\u20131126.","journal-title":"Management Science"},{"key":"2135_CR30","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1002\/net.3230210606","volume":"21","author":"D.B. Khang","year":"1991","unstructured":"Khang, D.B. and O. Fujiwara. (1991). \u201cApproximation Solution of Capacitated Fixed-Charge Minimum Cost Network Flow Problems.\u201d Networks 21, 689\u2013704.","journal-title":"Networks"},{"key":"2135_CR31","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0167-6377(99)00004-8","volume":"24","author":"D. Kim","year":"1999","unstructured":"Kim, D. and P.M. Pardalos. (1999). \u201c\u00c4 Solution Approach to the Fixed-Charge Network Flow Problem Using a Dynamic Slope Scaling Procedure.\u201d Operations Research Letters 24, 195\u2013203.","journal-title":"Operations Research Letters"},{"key":"2135_CR32","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1002\/(SICI)1097-0037(200005)35:3<216::AID-NET5>3.0.CO;2-E","volume":"35","author":"D. Kim","year":"2000","unstructured":"Kim, D. and P.M. Pardalos. (2000). \u201cDynamic Slope Scaling and Trust Interval Techniques for Solving Concave Piecewise Linear Network Flow Problems.\u201d Networks 35, 216\u2013222.","journal-title":"Networks"},{"key":"2135_CR33","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1287\/mnsc.20.5.814","volume":"5","author":"D. Klingman","year":"1974","unstructured":"Klingman, D., A. Napier, and J. Stutz. (1974). \u201cNETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Network Problems.\u201d Management Science 5, 814\u2013821.","journal-title":"Management Science"},{"issue":"(1)","key":"2135_CR34","first-page":"1","volume":"9","author":"H.W. Kuhn","year":"1961","unstructured":"Kuhn, H.W. and W.J Baumol. (1961). \u201cAn Approximate Algorithm for the Fixed Charge Transportation Problem.\u201d Naval Research Logistics Quarterly 9(1), 1\u201316.","journal-title":"Naval Research Logistics Quarterly"},{"key":"2135_CR35","doi-asserted-by":"crossref","first-page":"1431","DOI":"10.1287\/mnsc.43.10.1431","volume":"43","author":"B.W. Lamar","year":"1997","unstructured":"Lamar, B.W. and C.A. Wallace. (1997). \u201cRevised Modified Penalties for Fixed Charge Transportation Problems.\u201d Management Science 43, 1431\u20131436.","journal-title":"Management Science"},{"key":"2135_CR36","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0166-218X(87)90021-7","volume":"18","author":"H.P.L. Luna","year":"1987","unstructured":"Luna, H.P.L., N. Ziviani, and R.M.B. Cabral. (1987). \u201cThe Telephonic Switching Center Network Problem: Formalization and Computational Experience.\u201d Discrete and Applied Mathematics 18, 199\u2013210.","journal-title":"Discrete and Applied Mathematics"},{"key":"2135_CR37","doi-asserted-by":"crossref","first-page":"1183","DOI":"10.1287\/opre.23.6.1183","volume":"23","author":"P.G. McKeown","year":"1975","unstructured":"McKeown, P.G. (1975). A Vertex Ranking Procedure for Solving the Linear Fixed Charge Problem.\u201d Operations Research 23, 1183\u20131191.","journal-title":"Operations Research"},{"key":"2135_CR38","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1002\/nav.3800280409","volume":"28","author":"P.G. McKeown","year":"1981","unstructured":"McKeown, P.G. (1981). \u201cA Branch-and-Bound Algorithm for Solving Fixed Charge Problems.\u201d Naval Research Logistics Quarterly 28, 607\u2013617.","journal-title":"Naval Research Logistics Quarterly"},{"key":"2135_CR39","first-page":"9","volume":"17","author":"P.G. McKeown","year":"1990","unstructured":"McKeown, P.G. and C.T. Ragsdale. (1990). \u201cA Computational Study of Using Preprocessing and Stronger Formulations to Solve General Fixed Charge Problem.\u201d Operations Research 17, 9\u201316.","journal-title":"Operations Research"},{"key":"2135_CR40","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1002\/nav.3800270409","volume":"2","author":"P.G. McKeown","year":"1980","unstructured":"McKeown, P.G. and P. Sinha. (1980). \u201cAn Easy Solution to Special Class of Fixed Charge Problems.\u201d Naval Research Logistics Quarterly 2, 621\u2013624.","journal-title":"Naval Research Logistics Quarterly"},{"key":"2135_CR41","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230150102","volume":"15","author":"A. Mirzain","year":"1985","unstructured":"Mirzain, A. (1985). \u201cLagrangian Relaxation for the Star-Star Concentrator Location Problem: Approximation Algorithm and Bounds.\u201d Networks 15, 1\u201320.","journal-title":"Networks"},{"key":"2135_CR42","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1287\/opre.16.2.268","volume":"16","author":"K.G. Murty","year":"1968","unstructured":"Murty, K.G. (1968). \u201cSolving the Fixed Charge Problem by Ranking Extreme Points.\u201d Operations Research 16, 268\u2013279.","journal-title":"Operations Research"},{"key":"2135_CR43","unstructured":"Nozick, L. and M. Turnquist. (1998a). \u201cTwo-Echelon Inventory Allocation and Distribution Center Location Analysis.\u201d In Proceedings of Tristan III (Transportation Science Section of INFORMS), San Juan, Puerto Rico."},{"key":"2135_CR44","doi-asserted-by":"crossref","unstructured":"Nozick, L. and M. Turnquist. (1998b). \u201cIntegrating Inventory Impacts into a Fixed Charge Model for Locating Distribution Centers.\u201d Transportation Research Part E 31 E (3), 173\u2013186.","DOI":"10.1016\/S1366-5545(98)00010-6"},{"key":"2135_CR45","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1002\/net.10068","volume":"41","author":"F. Ortega","year":"2003","unstructured":"Ortega, F. and L.A. Wolsey. (2003). \u201cA Branch-and-Cut Algorithm for the Single-Commodity, Uncapacitated, Fixed-Charge Network Flow Problem.\u201d Networks 41, 143\u2013158.","journal-title":"Networks"},{"key":"2135_CR46","doi-asserted-by":"crossref","first-page":"1092","DOI":"10.1287\/mnsc.36.9.1092","volume":"36","author":"U.S. Palekar","year":"1990","unstructured":"Palekar, U.S., M.K. Karwan, and S. Zionts. (1990). \u201cA Branch and Bound Method for the Fixed Charge Transportation Problem.\u201d Management Science 36, 1092\u20131105.","journal-title":"Management Science"},{"key":"2135_CR47","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1287\/opre.18.6.992","volume":"18","author":"B. Rothfarb","year":"1970","unstructured":"Rothfarb, B., H. Frank, D.M. Rosembaun, and K. Steiglitz. (1970). \u201cOptimal Design of Offshore Natural-Gas Pipeline Systems.\u201d Operations Research 18, 992\u20131020.","journal-title":"Operations Research"},{"key":"2135_CR48","unstructured":"Rousseau, J.M. (1973). \u201cA Cutting Plane Method for the Fixed Cost Problem.\u201d Doctoral dissertation Massachusetts Institute of Technology. Cambridge, MA."},{"key":"2135_CR49","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0377-2217(89)90229-4","volume":"43","author":"J.E. Schaffer","year":"1989","unstructured":"Schaffer, J.E. (1989). \u201cUse of Penalties in the Branch-and-Bound Procedure for the Fixed Charge Transportation Problem.\u201d European Journal of Operations Research 43, 305\u2013312.","journal-title":"European Journal of Operations Research"},{"issue":"(2)","key":"2135_CR50","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1002\/1520-6750(199004)37:2<327::AID-NAV3220370210>3.0.CO;2-U","volume":"32","author":"U.S. Shetty","year":"1990","unstructured":"Shetty, U.S. (1990). \u201cA Relaxation Decomposition Algorithm for the Fixed Charge Network Problem.\u201d Naval Research Logistics Quarterly 32(2), 327\u2013340.","journal-title":"Naval Research Logistics Quarterly"},{"issue":"(2)","key":"2135_CR51","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1002\/nav.3800170209","volume":"7","author":"D.I. Steinberg","year":"1970","unstructured":"Steinberg, D.I. (1970). \u201cThe Fixed Charge Problem.\u201d Naval Research Logistics Quarterly 7(2), 217\u2013236.","journal-title":"Naval Research Logistics Quarterly"},{"key":"2135_CR52","unstructured":"Steinberg, D.I. (1977). \u201cDesigning a Heuristic for the Fixed Charge Transportation Problem.\u201d Reprints in Mathematics and the Mathematical Sciences. Southern Illinois University at Edwardsville, Edwardsville. IL"},{"key":"2135_CR53","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/S0377-2217(97)00284-1","volume":"106","author":"M. Sun","year":"1998","unstructured":"Sun, M., J.E. Aronson., P.G. McKeown, and D. Drinka. (1998). \u201cA Tabu Search Heuristic Procedure for the Fixed Charge Transportation Problem.\u201d European Journal of Operational Research 106, 441\u2013456.","journal-title":"European Journal of Operational Research"},{"issue":"(1\u20134)","key":"2135_CR54","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/BF02023003","volume":"41","author":"M. Sun","year":"1993","unstructured":"Sun, M. and P.G. McKeown. (1993). Tabu Search Applied to the General Fixed Charge Problems.\u201d Annals of Operations Research 41(1\u20134), 405\u2013420.","journal-title":"Annals of Operations Research"},{"issue":"(3)","key":"2135_CR55","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1287\/mnsc.22.5.587","volume":"22","author":"W.E. Walker","year":"1976","unstructured":"Walker, W.E. (1976). \u201cA Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem.\u201d Management Science 22(3), 587\u2013596.","journal-title":"Management Science"},{"key":"2135_CR56","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1287\/ijoc.7.4.468","volume":"7","author":"D. Woodruff","year":"1995","unstructured":"Woodruff, D. (1995). \u201cGhost Image Processing for Minimum Covariance Determinant Estimators.\u201d ORSA Journal on Computing 7, 468\u2013473.","journal-title":"ORSA Journal on Computing"},{"key":"2135_CR57","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1016\/0377-2217(89)90441-4","volume":"42","author":"D. Wright","year":"1989","unstructured":"Wright, D. and C. Haehling von Lanzenauer. (1989). \u201cSolving the Fixed Charge Problem with Lagrangian Relaxation and Cost Allocation Heuristics.\u201d European Journal of Operations Research 42, 304\u2013312.","journal-title":"European Journal of Operations Research"},{"key":"2135_CR58","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0377-2217(91)90084-9","volume":"52","author":"D. Wright","year":"1991","unstructured":"Wright, D. and C. Haehling von Lanzenauer. (1991). \u201cCOLE: A New Heuristic Approach for Fixed Charge Problem Computational Results.\u201d European Journal of Operations Research 52, 235\u2013246.","journal-title":"European Journal of Operations Research"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-005-2135-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-005-2135-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-005-2135-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T08:20:55Z","timestamp":1586420455000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-005-2135-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,7]]},"references-count":58,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2005,7]]}},"alternative-id":["2135"],"URL":"https:\/\/doi.org\/10.1007\/s10732-005-2135-x","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,7]]}}}