乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,29]],"date-time":"2024-08-29T16:39:38Z","timestamp":1724949578571},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,12,2]],"date-time":"2008-12-02T00:00:00Z","timestamp":1228176000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2010,4]]},"DOI":"10.1007\/s10878-008-9196-3","type":"journal-article","created":{"date-parts":[[2008,12,1]],"date-time":"2008-12-01T08:59:54Z","timestamp":1228121994000},"page":"241-257","source":"Crossref","is-referenced-by-count":17,"title":["A Lagrangian bound for many-to-many assignment problems"],"prefix":"10.1007","volume":"19","author":[{"given":"Igor","family":"Litvinchev","sequence":"first","affiliation":[]},{"given":"Socorro","family":"Rangel","sequence":"additional","affiliation":[]},{"given":"Jania","family":"Saucedo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,12,2]]},"reference":[{"key":"9196_CR1","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/s10107-002-0357-3","volume":"94","author":"L Bahiense","year":"2002","unstructured":"Bahiense L, Maculan N, Sagastiz\u00e1bal C (2002) The volume algorithm revisited: relation with bundle methods. Math Program 94:41\u201369","journal-title":"Math Program"},{"key":"9196_CR2","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1023\/A:1027368621279","volume":"7","author":"L Bahiense","year":"2003","unstructured":"Bahiense L, Barahona F, Porto O (2003) Solving Steiner tree problems in graphs with Lagrangian relaxation. J\u00a0Comb Optim 7:259\u2013282","journal-title":"J\u00a0Comb Optim"},{"key":"9196_CR3","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/s101070050002","volume":"87","author":"F Barahona","year":"2000","unstructured":"Barahona F, Anbil R (2000) The volume algorithm: producing primal solutions with a subgradient method. Math Program 87:385\u2013399","journal-title":"Math Program"},{"key":"9196_CR4","first-page":"243","volume-title":"Modern heuristic techniques for combinatorial problems","author":"JE Beasley","year":"1993","unstructured":"Beasley JE (1993) Lagrangean relaxation. In: Reeves\u00a0CD (ed) Modern heuristic techniques for combinatorial problems. Blackwell Sci., Oxford, pp\u00a0243\u2013303"},{"key":"9196_CR5","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1287\/opre.11.3.399","volume":"11","author":"H Everett","year":"1963","unstructured":"Everett H (1963) Generalized Lagrange multiplier method for solving problems of optimal allocation of resources. Oper Res 11:399\u2013417","journal-title":"Oper Res"},{"key":"9196_CR6","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1287\/inte.15.2.10","volume":"15","author":"ML Fisher","year":"1985","unstructured":"Fisher ML (1985) An application oriented guide to Lagrangian relaxation. Interfaces 15:10\u201321","journal-title":"Interfaces"},{"key":"9196_CR7","volume-title":"AMPL\u2014A\u00a0modeling language for mathematical programming","author":"R Fourer","year":"1993","unstructured":"Fourer R, Gay MD, Kernighan BW (1993) AMPL\u2014A\u00a0modeling language for mathematical programming. Scientific Press, Denvers"},{"key":"9196_CR8","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/s10479-005-3447-9","volume":"139","author":"A Frangioni","year":"2005","unstructured":"Frangioni A (2005) About Lagrangian methods in integer optimization. Ann Oper Res 139:163\u2013169","journal-title":"Ann Oper Res"},{"key":"9196_CR9","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s10479-005-3448-8","volume":"139","author":"A Freville","year":"2005","unstructured":"Freville A, Hanafi S (2005) The multidimensional 0\u20131 knapsack problem\u2014bounds and computational aspects. Ann Oper Res 139:195\u2013227","journal-title":"Ann Oper Res"},{"key":"9196_CR10","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","volume":"2","author":"AM Geoffrion","year":"1974","unstructured":"Geoffrion AM (1974) Lagrangian relaxation and its uses in integer programming. Math Program Stud 2:82\u2013114","journal-title":"Math Program Stud"},{"issue":"2","key":"9196_CR11","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF02579036","volume":"11","author":"M Guignard","year":"2003","unstructured":"Guignard M (2003) Lagrangian relaxation. TOP 11(2):151\u2013228","journal-title":"TOP"},{"key":"9196_CR12","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF02592954","volume":"39","author":"M Guignard","year":"1987","unstructured":"Guignard M, Kim S (1987) Lagrangian decomposition: a\u00a0model yielding stronger Lagrangian bounds. Math Program 39:215\u2013228","journal-title":"Math Program"},{"key":"9196_CR13","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","volume":"18","author":"M Held","year":"1970","unstructured":"Held M, Karp R (1970) The travelling salesman problem and minimum spanning trees. Oper Res 18:1138\u20131162","journal-title":"Oper Res"},{"key":"9196_CR14","unstructured":"ILOG (2006) ILOG CPLEX, Mathematical programming optimizers. Version\u00a010.0"},{"key":"9196_CR15","doi-asserted-by":"crossref","first-page":"1039","DOI":"10.1016\/j.ejor.2006.09.060","volume":"182","author":"V Jeet","year":"2007","unstructured":"Jeet V, Kutanoglu E (2007) Lagrangian relaxation guided problem space search heuristics for generalized assignment problems. Eur J Oper Res 182:1039\u20131056","journal-title":"Eur J Oper Res"},{"key":"9196_CR16","volume-title":"Optimization theory for large systems","author":"LS Lasdon","year":"2002","unstructured":"Lasdon LS (2002) Optimization theory for large systems, 2nd\u00a0edn. Dover, New York","edition":"2"},{"key":"9196_CR17","first-page":"115","volume-title":"Computational combinatorial optimization","author":"C Lemar\u00e9chal","year":"2001","unstructured":"Lemar\u00e9chal C (2001) Lagrangian relaxation. In: Junger\u00a0M, Naddef\u00a0D (eds) Computational combinatorial optimization. Springer, Heidelberg, pp\u00a0115\u2013160"},{"key":"9196_CR18","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/s10479-007-0169-1","volume":"153","author":"C Lemar\u00e9chal","year":"2007","unstructured":"Lemar\u00e9chal C (2007) The omnipresence of Lagrange. Ann Oper Res 153:9\u201327","journal-title":"Ann Oper Res"},{"key":"9196_CR19","doi-asserted-by":"crossref","first-page":"967","DOI":"10.1016\/S0305-0548(99)00027-1","volume":"26","author":"I Litvinchev","year":"1999","unstructured":"Litvinchev I, Rangel S (1999) Localization of optimal solution and a posteriori bounds for aggregation. Comput Oper Res 26:967\u2013988","journal-title":"Comput Oper Res"},{"key":"9196_CR20","series-title":"Applied optimization","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-9154-6","volume-title":"Aggregation in large scale optimization","author":"I Litvinchev","year":"2003","unstructured":"Litvinchev I, Tsurkov V (2003) Aggregation in large scale optimization. Applied optimization, vol\u00a083. Kluwer Academic, Dordrecht"},{"key":"9196_CR21","unstructured":"Litvinchev I, Rangel S, Saucedo J (2008) Modifying Lagrangian bounds. Technical Report 2008-01, Graduate Program in Systems Engineering, UANL, Mexico"},{"key":"9196_CR22","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1016\/0377-2217(95)00041-0","volume":"91","author":"LAN Lorena","year":"1996","unstructured":"Lorena LAN, Narciso MJ (1996) Relaxation heuristics for generalized assignment problem. Eur J Oper Res 91:600\u2013610","journal-title":"Eur J Oper Res"},{"issue":"2","key":"9196_CR23","first-page":"303","volume":"52","author":"N Maculan","year":"1991","unstructured":"Maculan N, Michelon P (1991) Lagrangean decomposition for integer nonlinear programming with linear constraints. Math Program 52(2):303\u2013313","journal-title":"Math Program"},{"issue":"1","key":"9196_CR24","first-page":"1","volume":"30","author":"N Maculan","year":"1992","unstructured":"Maculan N, Reinoso H (1992) Lagrangean decomposition in integer linear programming: a\u00a0new scheme. INFOR 30(1):1\u20135","journal-title":"INFOR"},{"key":"9196_CR25","volume-title":"Knapsack problems: algorithms and computer implementations","author":"S Martello","year":"1990","unstructured":"Martello S, Toth P (1990) Knapsack problems: algorithms and computer implementations. Wiley, New York"},{"key":"9196_CR26","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-4975-8","volume-title":"Large scale linear and integer programming: a\u00a0unified approach","author":"RK Martin","year":"1999","unstructured":"Martin RK (1999) Large scale linear and integer programming: a\u00a0unified approach. Kluwer Academic, Dordrecht"},{"issue":"1","key":"9196_CR27","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0377-2217(98)00038-1","volume":"114","author":"MG Narciso","year":"1999","unstructured":"Narciso MG, Lorena LAN (1999) Lagrangean\/surrogate relaxation for generalized assignment problems. Eur J Oper Res 114(1):165\u2013177","journal-title":"Eur J Oper Res"},{"key":"9196_CR28","doi-asserted-by":"crossref","first-page":"774","DOI":"10.1016\/j.ejor.2005.09.014","volume":"176","author":"DW Pentico","year":"2007","unstructured":"Pentico DW (2007) Assignment problems: A\u00a0golden anniversary survey. Eur J Oper Res 176:774\u2013793","journal-title":"Eur J Oper Res"},{"key":"9196_CR29","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0167-5060(08)70346-7","volume":"5","author":"JF Shapiro","year":"1974","unstructured":"Shapiro JF (1974) A survey of Lagrangian techniques for discrete optimization. Ann Discrete Math 5:113\u2013138","journal-title":"Ann Discrete Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-008-9196-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-008-9196-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-008-9196-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:13Z","timestamp":1559276293000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-008-9196-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12,2]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,4]]}},"alternative-id":["9196"],"URL":"https:\/\/doi.org\/10.1007\/s10878-008-9196-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,12,2]]}}}