{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T09:44:58Z","timestamp":1760607898794,"version":"3.40.5"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,7,1]],"date-time":"1999-07-01T00:00:00Z","timestamp":930787200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Heuristics"],"published-print":{"date-parts":[[1999,7]]},"DOI":"10.1023\/a:1009647225748","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T22:47:08Z","timestamp":1040597228000},"page":"123-143","source":"Crossref","is-referenced-by-count":15,"title":["Solution of the Cumulative Assignment Problem With a Well-Structured Tabu Search Method"],"prefix":"10.1007","volume":"5","author":[{"given":"Mauro","family":"Dell'amico","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Lodi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Maffioli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"230973_CR1","first-page":"91","volume-title":"Local Search in Combinatorial Optimization","author":"E. Aarts","year":"1997","unstructured":"Aarts, E., J.H.M. Korst, and P.J.M. van Laarhoven. (1997). \u201cSimulated Annealing.\u201d In E. Aarts and J.K. Lenstra (eds.), Local Search in Combinatorial Optimization. Chichester: J. Wiley & Sons, pp. 91\u2013120."},{"key":"230973_CR2","volume-title":"Local Search in Combinatorial Optimization","author":"E. Aarts","year":"1997","unstructured":"Aarts, E. and J.K. Lenstra (eds.). (1997). Local Search in Combinatorial Optimization. Chichester: J. Wiley & Sons."},{"key":"230973_CR3","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0166-218X(89)90014-0","volume":"23","author":"E. Balas","year":"1989","unstructured":"Balas, E. and E.J. Saltzman. (1989). \u201cFacets of the Three-Index Assignment Polytope,\u201d Discrete Applied Mathematics 23, 201\u2013229.","journal-title":"Discrete Applied Mathematics"},{"key":"230973_CR4","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1287\/opre.39.1.150","volume":"39","author":"E. Balas","year":"1991","unstructured":"Balas, E. and E.J. Saltzman. (1991). \u201cAn Algorithm for the Three-Index Assignment Problem,\u201d Operations Research 39, 150\u2013161.","journal-title":"Operations Research"},{"key":"230973_CR5","first-page":"85","volume":"32","author":"R.E. Burkard","year":"1993","unstructured":"Burkard, R.E. and R. Rudolf. (1993). \u201cComputational Investigation on Three-Dimensional Axial Assignment Problems,\u201d Belgian J. Oper. Res. Statist. Comput. Sci. 32, 85\u201398.","journal-title":"Belgian J. Oper. Res. Statist. Comput. Sci"},{"key":"230973_CR6","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0166-218X(95)00031-L","volume":"65","author":"R.E. Burkard","year":"1996","unstructured":"Burkard, R.E., R. Rudolf, and G.J. Woeginger. (1996). \u201cThree-Dimensional Axial Assignment Problems with Decomposable Coefficients,\u201d Discrete Applied Mathematics 65, 123\u2013139.","journal-title":"Discrete Applied Mathematics"},{"key":"230973_CR7","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/BFb0120697","volume":"3","author":"P. Camerini","year":"1975","unstructured":"Camerini, P., L. Fratta, and F. Maffioli. (1975). \u201cOn Improving Relaxation Methods by Modified Gradient Techniques,\u201d Math. Prog. Study 3, 26\u201334.","journal-title":"Math. Prog. Study"},{"key":"230973_CR8","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1016\/0377-2217(80)90164-2","volume":"5","author":"P.M. Camerini","year":"1980","unstructured":"Camerini, P.M., G. Galbiati, and F. Maffioli. (1980). \u201cComplexity of Spanning Tree Problems: Part I,\u201d European J. Oper. Res. 5, 346\u2013352.","journal-title":"European J. Oper. Res"},{"key":"230973_CR9","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1002\/(SICI)1097-0037(199605)27:3<175::AID-NET2>3.0.CO;2-F","volume":"27","author":"M. Dell'Amico","year":"1996","unstructured":"Dell'Amico, M., M. Labb\u00e9, and F. Maffioli. (1996). \u201cComplexity of Spanning Tree Problems with Leaf-Dependent Objective Function,\u201d Networks 27, 175\u2013181.","journal-title":"Networks"},{"doi-asserted-by":"crossref","unstructured":"Dell'Amico, M. and F. Maffioli. (1996). \u201cANewTabu Search Approach to the 0\u20131 Equicut Problem.\u201d In I.H. Osman and P. Kelly (eds.), Meta-Heuristics: Theory and Applications. Kluwer Academic Publishers, pp. 361\u2013377.","key":"230973_CR10","DOI":"10.1007\/978-1-4613-1361-8_23"},{"key":"230973_CR11","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/S0166-218X(97)00120-0","volume":"76","author":"M. Dell'Amico","year":"1997","unstructured":"Dell'Amico, M. and S. Martello. (1997a). \u201cThe K-Cardinality Assignment Problem,\u201d Discrete Applied Mathematics 76, 103\u2013121.","journal-title":"Discrete Applied Mathematics"},{"key":"230973_CR12","first-page":"355","volume-title":"Annotated Bibliographies in Combinatorial Optimization","author":"M. Dell'Amico","year":"1997","unstructured":"Dell'Amico, M. and S. Martello. (1997b). \u201cLinear Assignment.\u201d In M. Dell'Amico, F. Maffioli, and S. Martello (eds.), Annotated Bibliographies in Combinatorial Optimization. Chichester: J. Wiley & Sons, pp. 355\u2013371."},{"key":"230973_CR13","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1016\/S0305-0548(98)00012-4","volume":"25","author":"M. Dell'Amico","year":"1997","unstructured":"Dell'Amico, M., F. Maffioli, and M. Trubian. (1997). \u201cNew Bounds for Optimum Traffic Assignment in Satellite Communication,\u201d Computers & Operations Research 25, 729\u2013743.","journal-title":"Computers & Operations Research"},{"key":"230973_CR14","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1016\/S0377-2217(97)00287-7","volume":"106","author":"M. Dell'Amico","year":"1997","unstructured":"Dell'Amico, M. and M. Trubian. (1997). \u201cSolution of LargeWeighted Equicut Problems,\u201d European J. Oper. Res. 106, 500\u2013521.","journal-title":"European J. Oper. Res."},{"key":"230973_CR15","doi-asserted-by":"crossref","first-page":"1055","DOI":"10.1287\/opre.41.6.1055","volume":"41","author":"M. Fischetti","year":"1993","unstructured":"Fischetti, M., G. Laporte, and S. Martello. (1993). \u201cThe Delivery Man Problem and Cumulative Matroids,\u201d Operations Research 41, 1055\u20131064.","journal-title":"Operations Research"},{"key":"230973_CR16","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R. and D.S. Johnson. (1979). Computers and Intractability: A Guide to the Theory of NP-completeness. San Francisco: W.H. Freeman."},{"doi-asserted-by":"crossref","unstructured":"Glover, F. (1997). \u201cA Template for Scatter Search and Path Relinking.\u201d In J.K. Hao, E. Lutton, E. Ronald, M. Schoenauer, and D. Snyers (eds.), Artificial Evolution XI, Lecture Notes in Computer Science, Vol. 1363, pp. 1\u201345.","key":"230973_CR17","DOI":"10.1007\/BFb0026589"},{"key":"230973_CR18","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. Hingham: Kluwer Academic Publishers."},{"key":"230973_CR19","volume-title":"Master Thesis","author":"O. Haas","year":"1995","unstructured":"Haas, O. (1995). \u201cThe Cumulative Assignment Problem\u2014Local Search and Heuristics.\u201d Master Thesis, Department of Mathematics, University of Kaiserslautern, Germany."},{"key":"230973_CR20","first-page":"70","volume-title":"Modern Heuristic Techniques for Combinatorial Problems","author":"M. Laguna","year":"1993","unstructured":"Laguna, M. and F. Glover. (1993). \u201cTabu Search.\u201d In C.R. Reeves (ed.), Modern Heuristic Techniques for Combinatorial Problems. Oxford: Blackwell Scientific Publications, pp. 70\u2013141."},{"unstructured":"Lawler, E. (1976). Combinatorial Optimization: Networks and Matroids. Holt, Reinehart and Winston.","key":"230973_CR21"},{"key":"230973_CR22","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1287\/opre.16.2.422","volume":"16","author":"W.P. Pierskalla","year":"1968","unstructured":"Pierskalla, W.P. (1968). \u201cThe Multidimensional Assignment Problem,\u201d Operations Research 16, 422\u2013431.","journal-title":"Operations Research"},{"doi-asserted-by":"crossref","unstructured":"Qi, L., E. Balas, and G. Gwan. (1994). \u201cA New Facet Class and a Polyhedral Method for the Three-Index Assignment Problem.\u201d In D.Z. Du (ed.), Advances in Optimization and Approximation. Kluwer Academic Publishers, pp. 256\u2013274.","key":"230973_CR23","DOI":"10.1007\/978-1-4613-3629-7_14"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009647225748.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009647225748\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009647225748.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T10:49:22Z","timestamp":1747651762000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009647225748"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,7]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1999,7]]}},"alternative-id":["230973"],"URL":"https:\/\/doi.org\/10.1023\/a:1009647225748","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"type":"print","value":"1381-1231"},{"type":"electronic","value":"1572-9397"}],"subject":[],"published":{"date-parts":[[1999,7]]}}}