{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T15:45:22Z","timestamp":1770997522945,"version":"3.50.1"},"reference-count":25,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,11,1]],"date-time":"2003-11-01T00:00:00Z","timestamp":1067644800000},"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":[[2003,11]]},"DOI":"10.1016\/s0377-2217(02)00576-3","type":"journal-article","created":{"date-parts":[[2003,1,30]],"date-time":"2003-01-30T15:52:50Z","timestamp":1043941970000},"page":"238-246","source":"Crossref","is-referenced-by-count":27,"title":["Logic cuts for multilevel generalized assignment problems"],"prefix":"10.1016","volume":"151","author":[{"given":"Mar\u0131\u0301a A.","family":"Osorio","sequence":"first","affiliation":[]},{"given":"Manuel","family":"Laguna","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0377-2217(02)00576-3_BIB1","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0377-2217(94)00154-5","article-title":"A hybrid heuristic for the generalized assignment problem","volume":"5","author":"Amini","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00576-3_BIB2","unstructured":"Bollapragada, S., Ghattas, O., Hooker, J.N., 1995. Optimal Design of Truss Structures by Mixed Logical and Linear Programming. Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA"},{"key":"10.1016\/S0377-2217(02)00576-3_BIB3","first-page":"84","article-title":"A survey of algorithms for the generalized assignment problem","volume":"46","author":"Cattrysse","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00576-3_BIB4","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0377-2217(94)90338-7","article-title":"A set partitioning heuristic for the generalized assignment problem","volume":"72","author":"Cattrysse","year":"1994","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00576-3_BIB5","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/S0305-0548(96)00032-9","article-title":"A genetic algorithm for the generalized assignment problem","volume":"24","author":"Chu","year":"1997","journal-title":"Computers and OR"},{"issue":"9","key":"10.1016\/S0377-2217(02)00576-3_BIB6","doi-asserted-by":"crossref","first-page":"1095","DOI":"10.1287\/mnsc.32.9.1095","article-title":"A multiplier adjustment method for the generalized assignment problem","volume":"32","author":"Fisher","year":"1986","journal-title":"Management Science"},{"issue":"4","key":"10.1016\/S0377-2217(02)00576-3_BIB7","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1287\/inte.9.4.12","article-title":"Improved computer-based planning techniques\u2013\u2013part II","volume":"9","author":"Glover","year":"1979","journal-title":"Interfaces"},{"key":"10.1016\/S0377-2217(02)00576-3_BIB8","first-page":"154","article-title":"On the use of Boolean functions in linear programming","author":"Granot","year":"1971","journal-title":"Methods of Operations Research"},{"issue":"4","key":"10.1016\/S0377-2217(02)00576-3_BIB9","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1287\/opre.37.4.658","article-title":"An improved dual based algorithm for the generalized assignment problem","volume":"37","author":"Guignard","year":"1989","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00576-3_BIB10","series-title":"Proceedings of the Computer Science Logic Workshop (CSL\u201991)","article-title":"Logical inference and polyhedral projection","volume":"vol. 626","author":"Hooker","year":"1992"},{"key":"10.1016\/S0377-2217(02)00576-3_BIB11","first-page":"271","article-title":"Generalized resolution for linear inequalities","volume":"6","author":"Hooker","year":"1992","journal-title":"Annals of Mathematics and AI"},{"key":"10.1016\/S0377-2217(02)00576-3_BIB12","series-title":"Principles and Practice of Constraint Programming","first-page":"336","article-title":"Logic-based methods for optimization","volume":"vol. 874","author":"Hooker","year":"1994"},{"key":"10.1016\/S0377-2217(02)00576-3_BIB13","series-title":"Logic-Based Methods for Optimization","author":"Hooker","year":"2000"},{"key":"10.1016\/S0377-2217(02)00576-3_BIB14","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0305-0548(94)90089-2","article-title":"Logic cuts for processing networks with fixed charges","volume":"21","author":"Hooker","year":"1994","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(02)00576-3_BIB15","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/S0166-218X(99)00100-6","article-title":"Mixed logical\/linear programming","volume":"96\u201397","author":"Hooker","year":"1999","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(02)00576-3_BIB16","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0166-218X(87)90026-6","article-title":"Representability in mixed integer programming, I: Characterization results","volume":"17","author":"Jeroslow","year":"1987","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(02)00576-3_BIB17","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/0377-2217(93)E0174-V","article-title":"Tabu search for the multilevel generalized assignment problem","volume":"82","author":"Laguna","year":"1995","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/S0377-2217(02)00576-3_BIB18","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1016\/0377-2217(95)00041-0","article-title":"Relaxation heuristics for a generalized assignment problem","volume":"91","author":"Lorena","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00576-3_BIB19","unstructured":"Martello, S., Toth, P., 1981. An algorithm for the generalized assignment problem. In: Proceedings of the 9th IFORS Conference, Hamburg, Germany"},{"key":"10.1016\/S0377-2217(02)00576-3_BIB20","unstructured":"Nauss, R.M., 1999. Solving the classical generalized assignment problem. Working Paper. School of Business Administration, University of Missouri, St. Louis, MO"},{"issue":"1\u20133","key":"10.1016\/S0377-2217(02)00576-3_BIB21","first-page":"155","article-title":"Logic cuts generation in a branch and cut framework for location problems","volume":"8","author":"Osorio","year":"1999","journal-title":"Investigaci\u00f3n Operativa"},{"key":"10.1016\/S0377-2217(02)00576-3_BIB22","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF01580430","article-title":"A branch and bound algorithm for the generalized assignment problem","volume":"8","author":"Ross","year":"1975","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(02)00576-3_BIB23","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1287\/ijoc.6.4.445","article-title":"Preprocessing and probing for mixed integer programming problems","volume":"6","author":"Savelsbergh","year":"1994","journal-title":"ORSA Journal on Computing"},{"issue":"6","key":"10.1016\/S0377-2217(02)00576-3_BIB24","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1287\/opre.45.6.831","article-title":"A branch-and-price algorithm for the generalized assignment problem","volume":"45","author":"Savelsbergh","year":"1997","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00576-3_BIB25","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0377-2217(90)90302-R","article-title":"Generating cuts in integer programming with families of specially ordered sets","volume":"46","author":"Wilson","year":"1990","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:S0377221702005763?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702005763?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T06:57:19Z","timestamp":1553929039000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702005763"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,11]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,11]]}},"alternative-id":["S0377221702005763"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00576-3","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2003,11]]}}}