{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T06:55:09Z","timestamp":1760424909682},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441397"},{"type":"electronic","value":"9783540457121"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45712-7_8","type":"book-chapter","created":{"date-parts":[[2008,5,6]],"date-time":"2008-05-06T16:28:06Z","timestamp":1210091286000},"page":"77-87","source":"Crossref","is-referenced-by-count":18,"title":["Direct Representation and Variation Operators for the Fixed Charge Transportation Problem"],"prefix":"10.1007","author":[{"given":"Christoph","family":"Eckert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jens","family":"Gottlieb","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,10,4]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"B. Freisleben and P. Merz. New genetic local search operators for the traveling salesman problem. In Proc. of PPSN IV, 890\u2013899, 1996","DOI":"10.1007\/3-540-61723-X_1052"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"J. Gottlieb and C. Eckert. A comparison of two representations for the fixed charge transportation problem. In Proc. of PPSN VI, 345\u2013354, 2000","DOI":"10.1007\/3-540-45356-3_34"},{"key":"8_CR3","unstructured":"J. Gottlieb, B. A. Julstrom, G. R. Raidl and F. Rothlauf. Pr\u00fcfer numbers: a poor representation of spanning trees for evolutionary search. In Proc. of Genetic and Evolutionary Computation Conference, 343\u2013350, 2001"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"J. Gottlieb and L. Paulmann. Genetic algorithms for the fixed charge transportation problem. In Proc. of 5th IEEE Int. Conf. on Evol. Comp., 330\u2013335, 1998","DOI":"10.1109\/ICEC.1998.699754"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"J. Gottlieb and G. R. Raidl. Characterizing locality in decoder-based EAs for the multidimensional knapsack problem. In Proc. of Artificial Evolution, 38\u201352, 1999","DOI":"10.1007\/10721187_3"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BF02283688","volume":"25","author":"G. M. Guisewite","year":"1990","unstructured":"G. M. Guisewite and P. M. Pardalos. Minimum concave-cost network flow problems: Applications, complexity, and algorithms. Annals of Operations Research, Vol. 25, 75\u2013100, 1990","journal-title":"Annals of Operations Research"},{"issue":"2","key":"8_CR7","first-page":"239","volume":"4","author":"Y. Li","year":"1998","unstructured":"Y. Li, M. Gen and K. Ida. Fixed charge transportation problem by spanning treebased genetic algorithm. Beijing Mathematics, Vol. 4, No. 2, 239\u2013249, 1998","journal-title":"Beijing Mathematics"},{"key":"8_CR8","unstructured":"G. L. Nemhauser and L. A. Wolsey. Integer and combinatorial optimization. Wiley, 1998"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"C. C. Palmer and A. Kershenbaum. Representing trees in genetic algorithms. In Proc. of 1st IEEE Conf. on Evolutionary Computation, 379\u2013384, 1994","DOI":"10.1109\/ICEC.1994.349921"},{"key":"8_CR10","unstructured":"G. R. Raidl and J. Gottlieb. On the importance of phenotypic duplicate elimination in decoder-based evolutionary algorithms. In Late Breaking Papers at the Genetic and Evolutionary Computation Conference, 204\u2013211, 1999"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/S0377-2217(97)00284-1","volume":"106","author":"M. Sun","year":"1998","unstructured":"M. Sun, J. E. Aronson, P. G. McKeown and D. Drinka. A tabu search heuristic procedure for the fixed charge transportation problem. European Journal of Operational Research, Vol. 106, 441\u2013456, 1998","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"8_CR12","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1109\/21.87092","volume":"21","author":"G. A. Vignaux","year":"1991","unstructured":"G. A. Vignaux and Z. Michalewicz. A genetic algorithm for the linear transportation problem. IEEE Transactions on Systems, Man, and Cybernetics, Vol. 21, No. 2, 445\u2013452, 1991","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2014 PPSN VII"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45712-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T00:35:13Z","timestamp":1557534913000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45712-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441397","9783540457121"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-45712-7_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}