{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:28:35Z","timestamp":1752460115123},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Applic"],"published-print":{"date-parts":[[1994,3]]},"DOI":"10.1007\/bf01299389","type":"journal-article","created":{"date-parts":[[2005,3,25]],"date-time":"2005-03-25T04:30:12Z","timestamp":1111725012000},"page":"7-26","source":"Crossref","is-referenced-by-count":4,"title":["The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm"],"prefix":"10.1007","volume":"3","author":[{"given":"Jeffery L.","family":"Kennington","sequence":"first","affiliation":[]},{"given":"Farin","family":"Mohammadi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"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 Lagrangian-relaxation method for the constrained assignment problem,?Comput. Oper. Res. vol. 12 pp. 97?106, 1985.","journal-title":"Comput. Oper. Res."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/BF02591740","volume":"13","author":"E. Allen","year":"1987","unstructured":"E. Allen, R. Helgason, J. Kennington, and B. Shetty, ?A generalization of Polyak's convergence result for subgradient optimization,?Math. Prog. vol. 13, pp. 309?318 1987.","journal-title":"Math. Prog."},{"key":"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. Hibrand, and A. Metz, ?Matching problems with generalized upper bound side constraints,?Networks vol. 20 pp. 703?721, 1990.","journal-title":"Networks"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01584319","volume":"13","author":"R. Barr","year":"1977","unstructured":"R. Barr, F. Glover, and D. Klingman, ?The alternating basis algorithm for the assignment problems,?Math. Prog., vol 13 pp. 1?13, 1977.","journal-title":"Math. Prog."},{"key":"CR5","first-page":"66","volume":"1","author":"R. Barr","year":"1986","unstructured":"R. Barr, K. Farhangian, and J. Kennington, ?Networks with side constraints: An LU factorization update,?Ann. Society of Log. Eng. vol. 1 pp. 66?85, 1986.","journal-title":"Ann. Society of Log. Eng."},{"key":"CR6","first-page":"417","volume-title":"Operational Research'72","author":"J. Brans","year":"1973","unstructured":"J. Brans, M. Leclercq, and P. Hansen, ?An algorithm for optimal reloading of pressurized water reactors,? inOperational Research'72, M. Ross, Ed., North Holland Publishing Co. Amsterdam, 1973, pp. 417?428."},{"key":"CR7","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 Lagrangian relaxation: The case of the network problem with a single side-constraint,?Comput. Oper. Res. vol. 18 pp. 129?140, 1991.","journal-title":"Comput. Oper. Res."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1287\/opre.11.3.399","volume":"11","author":"H. Everett","year":"1963","unstructured":"H. Everett, ?Generalized Lagrange multiplier method for solving problems of optimum allocation of resources,?Oper. Res. vol. 11 pp. 399?417, 1963.","journal-title":"Oper. Res."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1002\/nav.3800020106","volume":"2","author":"S. Gass","year":"1955","unstructured":"S. Gass and T. Saaty, ?The computational algorithm for the parametric objective function,?Nav. Res. Log. Q. vol. 2 pp. 39?45, 1955.","journal-title":"Nav. Res. Log. Q."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1287\/opre.17.3.437","volume":"17","author":"A. Geoffrion","year":"1969","unstructured":"A. Geoffrion, ?An improved implicit enumeration approach for integer programming,?Oper. Res. vol. 17 pp. 437?454 1969.","journal-title":"Oper. Res."},{"key":"CR11","first-page":"82","volume":"2","author":"A. Geoffrion","year":"1974","unstructured":"A. Geoffrion, ?Lagrangian relaxation for integer programming,?Math. Prog. vol 2 pp. 82?114, 1974.","journal-title":"Math. Prog."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1287\/opre.13.6.879","volume":"13","author":"F. Glover","year":"1965","unstructured":"F. Glover, ?A multiphase-dual algorithm for the zero-one integer programming,?Oper. Res. vol. 13 pp. 879?919, 1965.","journal-title":"Oper. Res."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1287\/trsc.12.4.277","volume":"12","author":"F. Glover","year":"1978","unstructured":"F. Glover, D. Karney, D. Klingman, and R. Russell, ?Solving singly constrained transshipment problems,?Transp. Sci. vol. 12 pp. 277?297, 1978.","journal-title":"Transp. Sci."},{"key":"CR14","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 pressurised water reactors,?Comput. Oper. Res. vol. 8 pp. 263?269, 1981.","journal-title":"Comput. Oper. Res."},{"key":"CR15","series-title":"Technical Report 93-CSE-25","volume-title":"The singly constrained assignment problem: An AP basis approach","author":"J. Kennington","year":"1993","unstructured":"J. Kennington and F. Mohammadi, ?The singly constrained assignment problem: An AP basis approach,? Technical Report 93-CSE-25, Department of Computer Science and Engineering, Southern Methodist University, Dallas, TX, 1993."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1287\/ijoc.3.4.299","volume":"3","author":"J. Kennington","year":"1991","unstructured":"J. Kennington and Z. Wang, ?An empirical analysis of the dense assignment problem: Sequential and parallel implementations,?ORSA J. Comput. vol. 3 pp. 299?306, 1991.","journal-title":"ORSA J. Comput."},{"key":"CR17","series-title":"Technical Report 90-CSE-20","volume-title":"SEMI users guide","author":"J. Kennington","year":"1990","unstructured":"J. Kennington and Z. Wang, ?SEMI users guide,? Technical Report 90-CSE-20, Department of Computer Science and Engineering, Southern Methodist University, Dallas, TX, 1990."},{"key":"CR18","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1287\/opre.40.1.178","volume":"40","author":"J. Kennington","year":"1992","unstructured":"J. Kennington, and Z. Wang, ?A shortest augmenting path algorithm for the semi-assignment problem,?Oper. Res. vol. 40 pp. 178?187, 1992.","journal-title":"Oper. Res."},{"key":"CR19","series-title":"Technical Report 90-CSE-37","volume-title":"Netside users guide","author":"J. Kennington","year":"1990","unstructured":"J. Kennington and A. Whisman, ?Netside users guide,? Technical Report 90-CSE-37, Department of Computer Science and Engineering, Southern Methodist University, Dallas, TX, 1990."},{"key":"CR20","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1287\/opre.23.1.91","volume":"23","author":"D. Klingman","year":"1975","unstructured":"D. Klingman and R. Russell, ?Solving constrained transportation problems,?Oper. Res. vol. 23 pp. 91?106, 1975.","journal-title":"Oper. Res."},{"key":"CR21","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1002\/nav.3800250410","volume":"25","author":"D. Klingman","year":"1978","unstructured":"D. Klingman and R. Russell, ?A stream lined approach to the singly constrained transportation problem,?Nav. Res. Log. Q. vol. 25 pp. 681?695, 1978.","journal-title":"Nav. Res. Log. Q."},{"key":"CR22","unstructured":"?Mathematical Programming System Extended, Mixed Integer Programming\/370 Program Reference Manual,? SH19-1099-1, IBM, White Plains, NY, 1979."},{"key":"CR23","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1287\/opre.34.4.560","volume":"34","author":"J. Mazzola","year":"1986","unstructured":"J. Mazzola and A. Neebe, ?Resource constrained assignment scheduling,?Oper. Res. vol. 34 pp. 560?572, 1986.","journal-title":"Oper. Res."},{"key":"CR24","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G. Nemhauser","year":"1988","unstructured":"G. Nemhauser and L. Wolesy,Integer and Combinatorial Optimization, John Wiley and Sons: New York, NY, 1988."},{"key":"CR25","unstructured":"Optimization Subroutine Library: Guide and Reference, SC23-0519-1, IBM, Kingston, NY, 1990."},{"key":"CR26","volume-title":"Discrete Optimization","author":"R. Parker","year":"1988","unstructured":"R. Parker and R. Rardin,Discrete Optimization, Academic Press Inc.: New York, NY, 1988."},{"key":"CR27","series-title":"Working Paper 91-06-06","volume-title":"Lagrangian approximation techniques for the simple plant location problem with an aggregate capacity constraint","author":"C. Ryu","year":"1991","unstructured":"C. Ryu and M. Guignard, ?Lagrangian approximation techniques for the simple plant location problem with an aggregate capacity constraint,? Working Paper 91-06-06, Department of Decision Sciences, The Wharton School, University of Pennsylvania, Philadelphia, PA, 1991."},{"key":"CR28","volume-title":"Integer Programming","author":"H. Salkin","year":"1974","unstructured":"H. Salkin,Integer Programming, Addison-Wesley Publishing Co. Reading, MA, 1974."},{"key":"CR29","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1287\/opre.19.1.68","volume":"19","author":"J. Shapiro","year":"1971","unstructured":"J. Shapiro, ?Generalized Lagrange multipliers in integer programming,?Oper. Res. vol. 19 pp. 68?76, 1971.","journal-title":"Oper. Res."},{"key":"CR30","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0167-5060(08)70346-7","volume":"5","author":"J. Shapiro","year":"1979","unstructured":"J. Shapiro, ?A survey of Lagrangian techniques for discrete optimization,?Ann. Discrete Math. vol. 5 pp. 113?138, 1979.","journal-title":"Ann. Discrete Math."},{"key":"CR31","volume-title":"Algorithms for optimizing piecewise linear functions and for degree constrained minimum spanning tree problems","author":"G. Yu","year":"1991","unstructured":"G. Yu, ?Algorithms for optimizing piecewise linear functions and for degree constrained minimum spanning tree problems,? Department of Decision Sciences, The Wharton School, University of Pennsylvania, Philadelphia, PA, 1991."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01299389.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01299389\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01299389","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T18:08:07Z","timestamp":1556647687000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01299389"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["BF01299389"],"URL":"https:\/\/doi.org\/10.1007\/bf01299389","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}