{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T03:39:29Z","timestamp":1777520369375,"version":"3.51.4"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1983,1]]},"DOI":"10.1007\/bf02591716","type":"journal-article","created":{"date-parts":[[2007,3,29]],"date-time":"2007-03-29T15:41:10Z","timestamp":1175182870000},"page":"13-24","source":"Crossref","is-referenced-by-count":24,"title":["Solution techniques for some allocation problems"],"prefix":"10.1007","volume":"25","author":[{"given":"A.","family":"Federgruen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Zipkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02591716_CR1","volume-title":"The design and analysis of computer algorithms","author":"A. Aho","year":"1974","unstructured":"A. Aho, J. Hopcroft and J. Ullman,The design and analysis of computer algorithms (Addison-Wesley, Reading, MA, 1974)."},{"key":"BF02591716_CR2","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1287\/mnsc.27.4.431","volume":"27","author":"G. Bitran","year":"1981","unstructured":"G. Bitran and A. Hax, \u201cDisaggregation and resource allocation using convex knapsack problems with bounded variables\u201d,Management Science 27 (1981) 431\u2013441.","journal-title":"Management Science"},{"key":"BF02591716_CR3","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1109\/TR.1969.5216995","volume":"R-18","author":"L. Bodin","year":"1969","unstructured":"L. Bodin, \u201cOptimization procedures for the analysis of coherent structures\u201d,IEEE Transactions on Reliability R-18 (1969) 118\u2013126.","journal-title":"IEEE Transactions on Reliability"},{"key":"BF02591716_CR4","series-title":"Research working paper","volume-title":"A combined vehicle-routing\/inventory-allocation model","author":"A. Federgruen","year":"1980","unstructured":"A. Federgruen and P. Zipkin, \u201cA combined vehicle-routing\/inventory-allocation model\u201d Research working paper, Graduate School of Business, Columbia University, NY (1980)."},{"key":"BF02591716_CR5","doi-asserted-by":"crossref","first-page":"686","DOI":"10.1287\/opre.26.5.686","volume":"26","author":"B. Fox","year":"1978","unstructured":"B. Fox, \u201cData structures and computer science techniques in operations research\u201d,Operations Research 26 (1978) 686\u2013717.","journal-title":"Operations Research"},{"key":"BF02591716_CR6","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1145\/321574.321590","volume":"17","author":"B. Fox","year":"1970","unstructured":"B. Fox, \u201cAccelerating list processing in discrete optimization\u201d,Journal of the ACM 17 (1970) 383\u2013384.","journal-title":"Journal of the ACM"},{"key":"BF02591716_CR7","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF01588255","volume":"17","author":"F. Glover","year":"1979","unstructured":"F. Glover and D. Klingman, \u201cA O(n logn) algorithm for LP knapsacks with GUB constraints\u201d,Mathematical Programming 17 (1979) 345\u2013361.","journal-title":"Mathematical Programming"},{"key":"BF02591716_CR8","series-title":"Working Paper","volume-title":"Resource allocation with a convex objective function and its generalizations","author":"T. Ibaraki","year":"1980","unstructured":"T. Ibaraki, \u201cResource allocation with a convex objective function and its generalizations\u201d, Working Paper, Dept. of Applied Mathematics and Physics, Faculty of Engineering, Kyoto University, Kyoto, Japan (1980)."},{"key":"BF02591716_CR9","volume-title":"The art of computer programming","author":"D. Knuth","year":"1968","unstructured":"D. Knuth,The art of computer programming, Vol. 1 (Addison-Wesley, Reading, MA, 1968)."},{"key":"BF02591716_CR10","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1287\/opre.23.2.360","volume":"23","author":"H. Luss","year":"1975","unstructured":"H. Luss and S. Gupta, \u201cAllocation of effort resources among competing activities\u201d,Operations Research 23 (1975) 360\u2013366.","journal-title":"Operations Research"},{"key":"BF02591716_CR11","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1137\/0315059","volume":"15","author":"R. Meyer","year":"1977","unstructured":"R. Meyer, \u201cA class of nonlinear integer programs solvable by a single linear program\u201d,SIAM Journal on Control and Optimization 15 (1977) 935\u2013946.","journal-title":"SIAM Journal on Control and Optimization"},{"key":"BF02591716_CR12","doi-asserted-by":"crossref","first-page":"64","DOI":"10.15807\/jorsj.23.64","volume":"23","author":"A. Ohuchi","year":"1980","unstructured":"A. Ohuchi and I. Kaji, \u201cAlgorithms for optimal allocation problems having quadratic objective functions\u201d,Journal of the Operations Research Society of Japan 23 (1980) 64\u201380.","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"BF02591716_CR13","series-title":"Working paper","volume-title":"Productivity of activities in the optimal allocation of one resource","author":"J. Rohn","year":"1979","unstructured":"J. Rohn, \u201cProductivity of activities in the optimal allocation of one resource\u201d, Working paper, Charles University, Prague (1979)."},{"key":"BF02591716_CR14","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BF01588948","volume":"14","author":"L. Schrage","year":"1978","unstructured":"L. Schrage, \u201cImplicit representation of generalized upper bounds in linear programming\u201d,Mathematical programming 14 (1978) 11\u201320.","journal-title":"Mathematical programming"},{"key":"BF02591716_CR15","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1287\/opre.21.2.648","volume":"21","author":"I. Weinstein","year":"1973","unstructured":"I. Weinstein and S. Yu, Comment on an integer maximization problem,Operations Research 21 (1973) 648\u2013650.","journal-title":"Operations Research"},{"key":"BF02591716_CR16","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1287\/mnsc.26.1.34","volume":"26","author":"P. Zipkin","year":"1980","unstructured":"P. Zipkin, \u201cSimple ranking methods for allocation of one resource\u201d,Management Science 26 (1980) 34\u201343.","journal-title":"Management Science"},{"key":"BF02591716_CR17","doi-asserted-by":"crossref","unstructured":"P. Zipkin, \u201cExact and approximate cost functions for product aggregates\u201d,Management Science (to appear).","DOI":"10.1287\/mnsc.28.9.1002"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02591716.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02591716\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02591716","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T23:37:48Z","timestamp":1558395468000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02591716"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,1]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983,1]]}},"alternative-id":["BF02591716"],"URL":"https:\/\/doi.org\/10.1007\/bf02591716","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1983,1]]}}}