{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T20:40:06Z","timestamp":1649191206080},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,3,15]],"date-time":"2007-03-15T00:00:00Z","timestamp":1173916800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2007,9,24]]},"DOI":"10.1007\/s00186-007-0147-z","type":"journal-article","created":{"date-parts":[[2007,3,14]],"date-time":"2007-03-14T05:15:03Z","timestamp":1173849303000},"page":"225-233","source":"Crossref","is-referenced-by-count":1,"title":["On the optimum capacity of capacity expansion problems"],"prefix":"10.1007","volume":"66","author":[{"given":"Chao","family":"Yang","sequence":"first","affiliation":[]},{"given":"Chunyan","family":"Hao","sequence":"additional","affiliation":[]},{"given":"Jianzhong","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,3,15]]},"reference":[{"key":"147_CR1","volume-title":"Network flows, 1st edn","author":"RK Ahuja","year":"1993","unstructured":"Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows, 1st edn. Prentice-Hall, Englewood Cliffs"},{"key":"147_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02060467","volume":"40","author":"O Berman","year":"1992","unstructured":"Berman O (1992) Improving the location of minisum facilities through network modification. Ann Oper Res 40:1\u201316","journal-title":"Ann Oper Res"},{"key":"147_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1051\/ro:2001100","volume":"35","author":"RE Burkard","year":"2001","unstructured":"Burkard RE, Klinz B, Zhang J (2001) Bottleneck capacity expansion problem with general budget constraints. RAIRO Recherche Operationelle 35:1\u201320","journal-title":"RAIRO Recherche Operationelle"},{"key":"147_CR4","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/S0377-2217(02)00713-0","volume":"153","author":"RE Burkard","year":"2001","unstructured":"Burkard RE, Lin Y, Zhang J (2001) Weight reduction problems with certain bottleneck objectives. Euro J Oper Res 153:191\u2013199","journal-title":"Euro J Oper Res"},{"key":"147_CR5","unstructured":"Frederickson GN (1996) Increasing the weight of minimum spanning tree. In: Proceedings of the 7th annual ACM-SLAM symposium on discrete algorithm (SODA\u201996), pp. 539\u2013546"},{"key":"147_CR6","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1023\/A:1009798010579","volume":"2","author":"SO Krumke","year":"1998","unstructured":"Krumke SO, Marthe MV, Ravi R, Ravi SS (1998) Approximation algorithms for certain network improvement. J Comb Optim 2:257\u2013288","journal-title":"J Comb Optim"},{"key":"147_CR7","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1287\/opre.41.2.338","volume":"41","author":"JB Orlin","year":"1993","unstructured":"Orlin JB (1993) A faster strongly polynomial minimum cost flow algorithm. Oper Res 41:338\u2013350","journal-title":"Oper Res"},{"key":"147_CR8","doi-asserted-by":"crossref","unstructured":"Phillips C (1993) The network inhibition problem. In: Proceeding of 25th annals of ACM sysmposium on the theory of computing (STOC\u201993), pp. 288\u2013293","DOI":"10.1145\/167088.167286"},{"key":"147_CR9","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/S0020-0190(98)00070-2","volume":"66","author":"S Schwarz","year":"1998","unstructured":"Schwarz S, Krumke SO (1998) On the budget-constrained flow improvement. Inf Process Lett 66:291\u2013297","journal-title":"Inf Process Lett"},{"key":"147_CR10","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0252-9602(17)30473-3","volume":"22","author":"C Yang","year":"2002","unstructured":"Yang C, Chen X (2002) An inverse maximum capacity path problem with lower bound constraints. Acta Math Sci 22:207\u2013212","journal-title":"Acta Math Sci"},{"key":"147_CR11","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1016\/S0252-9602(17)30438-1","volume":"21","author":"C Yang","year":"2001","unstructured":"Yang C, Liu J (2001) A capacity expansion problem with budget constraints and bottleneck limitation. Acta Math Sci 21:428\u2013432","journal-title":"Acta Math Sci"},{"key":"147_CR12","first-page":"525","volume":"1","author":"C Yang","year":"2003","unstructured":"Yang C, Liu G (2003) A model for multi-period capacity expansion problem on network. J Syst Sci Inf 1:525\u2013529","journal-title":"J Syst Sci Inf"},{"key":"147_CR13","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/S0377-2217(99)00122-8","volume":"124","author":"J Zhang","year":"2000","unstructured":"Zhang J, Yang C, Ma Z (2000) Some reverse location problems. Eur J Oper Res 124:77\u201388","journal-title":"Eur J Oper Res"},{"key":"147_CR14","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1016\/S0305-0548(99)00130-6","volume":"28","author":"J Zhang","year":"2001","unstructured":"Zhang J, Yang C, Lin Y (2001) A class of bottleneck expansion problems. Comput Oper Res 28:505\u2013519","journal-title":"Comput Oper Res"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-007-0147-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00186-007-0147-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-007-0147-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T10:33:26Z","timestamp":1558607606000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00186-007-0147-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3,15]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,9,24]]}},"alternative-id":["147"],"URL":"https:\/\/doi.org\/10.1007\/s00186-007-0147-z","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,3,15]]}}}