乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,30]],"date-time":"2024-05-30T02:13:32Z","timestamp":1717035212932},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,12,8]],"date-time":"2012-12-08T00:00:00Z","timestamp":1354924800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2014,2]]},"DOI":"10.1007\/s13042-012-0138-0","type":"journal-article","created":{"date-parts":[[2012,12,7]],"date-time":"2012-12-07T01:19:24Z","timestamp":1354843164000},"page":"85-92","source":"Crossref","is-referenced-by-count":6,"title":["Design of a kind of nonlinear neural networks for solving the inverse optimal value problem with convex constraints"],"prefix":"10.1007","volume":"5","author":[{"given":"Huaiqin","family":"Wu","sequence":"first","affiliation":[]},{"given":"Kewang","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Qiangqiang","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Guohua","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Ning","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,12,8]]},"reference":[{"key":"138_CR1","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF01585693","volume":"53","author":"D Burton","year":"1992","unstructured":"Burton D, Toint Ph.L. (1992) On an instance of the inverse shortest paths problem. Math Program 53:45\u201361","journal-title":"Math Program"},{"key":"138_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01582056","volume":"63","author":"D Burton","year":"1994","unstructured":"Burton D, Toint Ph L (1994) On the use of an inverse shortest paths algorithm for recovering correlated costs. Math Program 63:1\u201322","journal-title":"Math Program"},{"key":"138_CR3","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF01432364","volume":"41","author":"J Zhang","year":"1995","unstructured":"Zhang J, Ma Z, Yang C (1995) A column generation method for inverse shortest paths problems. ZOR Math Methods Oper Res 41:347\u2013358","journal-title":"ZOR Math Methods Oper Res"},{"key":"138_CR4","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF01194328","volume":"44","author":"J Zhang","year":"1996","unstructured":"Zhang J, Liu Z, Ma Z (1996) On the inverse problem of minimum spanning tree with partition constraints. ZOR Math Methods Oper Res 44:171\u2013188","journal-title":"ZOR Math Methods Oper Res"},{"key":"138_CR5","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1287\/opre.47.2.291","volume":"47","author":"PT Sokkalingam","year":"1999","unstructured":"Sokkalingam PT, Ahuja R, Orlin JB (1999) Solving inverse spanning tree problems through network flow techniques. Oper Res 47:291\u2013298","journal-title":"Oper Res"},{"key":"138_CR6","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0377-0427(95)00277-4","volume":"72","author":"J Zhang","year":"1996","unstructured":"Zhang J, Liu Z (1996) Calculating some inverse linear programming problems. J Comput Appl Math 72:261\u2013273","journal-title":"J Comput Appl Math"},{"key":"138_CR7","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/S0377-0427(99)00080-1","volume":"106","author":"J Zhang","year":"1999","unstructured":"Zhang J, Liu Z (1999) A further study on inverse linear programming problems. J Comput Appl Math 106:345\u2013359","journal-title":"J Comput Appl Math"},{"key":"138_CR8","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1080\/02331939708844306","volume":"40","author":"C Yang","year":"1997","unstructured":"Yang C, Zhang J, Ma Z (1997) Inverse maximum flow and minimum cut problems. Optimization 40:147\u2013170","journal-title":"Optimization"},{"key":"138_CR9","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/BF01193836","volume":"47","author":"J Zhang","year":"1998","unstructured":"Zhang J, Cai MC (1998) Inverse problem of minimum cuts. Math Methods Oper Res 47:51-58","journal-title":"Math Methods Oper Res"},{"key":"138_CR10","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1287\/opre.49.5.771.10607","volume":"49","author":"RK Ahuja","year":"2001","unstructured":"Ahuja RK, Orlin JB (2001) Inverse optimization. Oper Res 49:771\u2013783","journal-title":"Oper Res"},{"key":"138_CR11","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1006\/jagm.1999.1052","volume":"34","author":"RK Ahuja","year":"2000","unstructured":"Ahuja RK, Orlin JB (2000) A faster algorithm for the inverse spanning tree problem. J Algorithm 34:177\u2013193","journal-title":"J Algorithm"},{"key":"138_CR12","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1002\/net.10048","volume":"40","author":"RK Ahuja","year":"2002","unstructured":"Ahuja RK, Orlin JB (2002) Combinatorial algorithms for inverse network flow problems. Networks 40:181\u2013187","journal-title":"Networks"},{"key":"138_CR13","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1023\/B:JOCO.0000038914.26975.9b","volume":"8","author":"C Heuberger","year":"2004","unstructured":"Heuberger C (2004) Inverse combinatorial optimization: a survey on problems, methods, and results. J Comb Optim 8:329\u2013361","journal-title":"J Comb Optim"},{"key":"138_CR14","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10107-004-0515-x","volume":"102","author":"S Ahmed","year":"2005","unstructured":"Ahmed S, Guan Y (2005) The inverse optimal value problem. Math Program 102:91\u2013110","journal-title":"Math Program"},{"key":"138_CR15","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.cam.2007.08.005","volume":"220","author":"YB Lv","year":"2008","unstructured":"Lv YB, Hu TS, Wan ZP (2008) A penalty function method for solving inverse optimal value problem. J Comput Appl Math 220:175\u2013180","journal-title":"J Comput Appl Math"},{"key":"138_CR16","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/j.aml.2009.09.007","volume":"23","author":"YB Lv","year":"2010","unstructured":"Lv YB, Chen Z, Wan ZP (2010) A penalty function method based on bilevel programming for solving inverse optimal value problems. Appl Math Lett 23:170\u2013175","journal-title":"Appl Math Lett"},{"key":"138_CR17","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1016\/j.cam.2009.12.041","volume":"234","author":"YB Lv","year":"2010","unstructured":"Lv YB, Chen Z, Wan ZP (2010) A neural network for solving a convex quadratic bilevel programming problem. J Comput Appl Math 234:505\u2013511","journal-title":"J Comput Appl Math"},{"issue":"1-4","key":"138_CR18","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/s13042-010-0004-x","volume":"1","author":"DL Tong","year":"2010","unstructured":"Tong DL, Mintram R (2010) Genetic Algorithm-Neural Network (GANN): a study of neural network activation functions and depth of genetic algorithm search applied to feature selection. Int J Mach Learn Cybern 1(1-4): 75\u201387","journal-title":"Int J Mach Learn Cybern"},{"issue":"3","key":"138_CR19","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s13042-011-0030-3","volume":"2","author":"O Boehm","year":"2011","unstructured":"Boehm O, Hardoon DR, Manevitz LM (2011) Classifying cognitive states of brain activity via one-class neural networks with feature selection by genetic algorithms. Int J Mach Learn Cybern 2(3):125\u2013134","journal-title":"Int J Mach Learn Cybern"},{"issue":"1","key":"138_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s13042-011-0041-0","volume":"3","author":"AJ Graaff","year":"2012","unstructured":"Graaff AJ, Engelbrecht AP (2012) Clustering data in stationary environments with a local network neighborhood artificial immune system. Int J Mach Learn Cybern 3(1):1\u201326","journal-title":"Int J Mach Learn Cybern"},{"key":"138_CR21","doi-asserted-by":"crossref","unstructured":"Sarlin P (2011) Visual tracking of the millennium development goals with a fuzzified self-organizing neural network. Int J Mach Learn Cybern. doi: 10.1007\/s13042-011-0057-5","DOI":"10.1007\/s13042-011-0057-5"},{"key":"138_CR22","doi-asserted-by":"crossref","unstructured":"Tsang ECC, Wang XZ, Yeung DS (2000) Improving learning accuracy of fuzzy decision trees by hybrid neural networks. IEEE Trans Fuzzy Syst 8 (5): 601\u2013614","DOI":"10.1109\/91.873583"},{"key":"138_CR23","doi-asserted-by":"crossref","first-page":"713","DOI":"10.3923\/itj.2012.713.718","volume":"11","author":"H Wu","year":"2012","unstructured":"Wu H, Wang K, Li N, Wu C, Guo Q, Xu G (2012) Applications of the general nonlinear neural networks in solving the inverse optimal value problem with linear constraints. Inf Technol J 11:713\u2013718","journal-title":"Inf Technol J"},{"key":"138_CR24","unstructured":"Tarantola A (1987) Inverse problem theory: methods for data fitting and model parameter estimation. Elsevier, Amsterdam, The Netherlands"},{"key":"138_CR25","volume-title":"The optimality theory of bilevel system","author":"XJ Wang","year":"1995","unstructured":"Wang XJ, Feng SY (1995) The optimality theory of bilevel system. Science Publishers, Beijing"},{"key":"138_CR26","volume-title":"Foundation of bilevel programming","author":"S Dempe","year":"2002","unstructured":"Dempe S (2002) Foundation of bilevel programming. Kluwer Academic Publishers, London"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-012-0138-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13042-012-0138-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-012-0138-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T10:31:12Z","timestamp":1559471472000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13042-012-0138-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12,8]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,2]]}},"alternative-id":["138"],"URL":"https:\/\/doi.org\/10.1007\/s13042-012-0138-0","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,12,8]]}}}