{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:40:02Z","timestamp":1752378002895,"version":"3.41.2"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1997,11,1]],"date-time":"1997-11-01T00:00:00Z","timestamp":878342400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,11,1]],"date-time":"1997-11-01T00:00:00Z","timestamp":878342400000},"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":["Computational Optimization and Applications"],"published-print":{"date-parts":[[1997,11]]},"DOI":"10.1023\/a:1008679623419","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T10:12:40Z","timestamp":1040551960000},"page":"287-299","source":"Crossref","is-referenced-by-count":0,"title":["A Truncated Exponential Algorithm for the Lightly Constrained Assignment Problem"],"prefix":"10.1007","volume":"8","author":[{"given":"Jeffery L.","family":"Kennington","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Farin","family":"Mohammadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"140556_CR1","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0305-0548(85)90011-5","volume":"12","author":"V. Aggarwal","year":"1985","unstructured":"V. Aggarwal, \"A lagrangean-relaxation method for the constrained assignment problem,\" Computers and Operations Research, vol. 12, pp. 97\u2013106, 1985.","journal-title":"Computers and Operations Research"},{"key":"140556_CR2","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1002\/1520-6750(199308)40:5<581::AID-NAV3220400503>3.0.CO;2-#","volume":"40","author":"I. Ali","year":"1993","unstructured":"I. Ali, J. Kennington, and T. Liang, \"Assignment with en route training of navy personnel,\" Naval Research Logistics Quarterly, vol. 40, pp. 581\u2013592, 1993.","journal-title":"Naval Research Logistics Quarterly"},{"key":"140556_CR3","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1002\/net.3230200602","volume":"20","author":"M. Ball","year":"1990","unstructured":"M. Ball, U. Derigs, C. Hilbrand, and A. Metz, \"Matching problems with generalized upper bound side constraints,\" Networks, vol. 20, pp. 703\u2013721, 1990.","journal-title":"Networks"},{"key":"140556_CR4","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0305-0548(91)90084-5","volume":"18","author":"N. Bryson","year":"1991","unstructured":"N. Bryson, \"Parametric programming and lagrangean relaxation: The case of the network problem with a single side-constraint,\" Computers and Operations Research, vol. 18, pp. 129\u2013140, 1991.","journal-title":"Computers and Operations Research"},{"key":"140556_CR5","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1287\/mnsc.18.9.465","volume":"18","author":"A. Geoffrion","year":"1972","unstructured":"A. Geoffrion and R. Marsten, \"Integer programming algorithms: A framework and state-of-the-art survey,\" Management Science, vol. 18, pp. 465\u2013491, 1972.","journal-title":"Management Science"},{"key":"140556_CR6","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0305-0548(81)90013-7","volume":"8","author":"A. Gupta","year":"1981","unstructured":"A. Gupta and J. Sharma, \"Tree search method for optimal core management of pressurized water reactors,\"Computers and Operations Research, vol. 8, pp. 263\u2013269, 1981.","journal-title":"Computers and Operations Research"},{"key":"140556_CR7","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF01299389","volume":"3","author":"J. Kennington","year":"1994","unstructured":"J. Kennington and F. Mohammadi, \"The singly constrained assignment problem: A lagrangean relaxation approach,\" Computational Optimization and Applications, vol. 3, pp. 7\u201326, 1994.","journal-title":"Computational Optimization and Applications"},{"key":"140556_CR8","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF01300862","volume":"4","author":"J. Kennington","year":"1995","unstructured":"J. Kennington and F. Mohammadi, \"The singly constrained assignment problem: An AP basis approach,\" Computational Optimization and Applications, vol. 4, pp. 347\u2013374, 1995.","journal-title":"Computational Optimization and Applications"},{"key":"140556_CR9","first-page":"560","volume":"34","author":"J. Mazzola","year":"1986","unstructured":"J. Mazzola and A. Neebe, \"Resource constrained assignment scheduling,\" Operations Research, vol. 34, pp. 560\u2013572, 1986.","journal-title":"Resource constrained assignment scheduling,\" Operations Research"},{"key":"140556_CR10","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G. Nemhauser","year":"1988","unstructured":"G. Nemhauser and L. Wolsey, Integer and Combinatorial Optimization, John Wiley and Sons: New York, NY, 1988."},{"key":"140556_CR11","volume-title":"Discrete Optimization","author":"R. Parker","year":"1988","unstructured":"R. Parker and R. Rardin, Discrete Optimization, Academic Press Incorporated: New York, NY, 1988."},{"key":"140556_CR12","volume-title":"Integer Programming","author":"H. Salkin","year":"1974","unstructured":"H. Salkin, Integer Programming, Addison-Wesley Publishing Company: Reading, Massachusetts, 1974."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008679623419.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008679623419\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008679623419.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:20:45Z","timestamp":1752376845000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008679623419"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,11]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,11]]}},"alternative-id":["140556"],"URL":"https:\/\/doi.org\/10.1023\/a:1008679623419","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[1997,11]]}}}