乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T03:54:42Z","timestamp":1649217282877},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,11,8]],"date-time":"2012-11-08T00:00:00Z","timestamp":1352332800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2014,1]]},"DOI":"10.1007\/s11590-012-0583-4","type":"journal-article","created":{"date-parts":[[2012,11,7]],"date-time":"2012-11-07T10:35:25Z","timestamp":1352284525000},"page":"359-374","source":"Crossref","is-referenced-by-count":0,"title":["Solving the weighted MAX-SAT problem using the dynamic convexized method"],"prefix":"10.1007","volume":"8","author":[{"given":"Wenxing","family":"Zhu","sequence":"first","affiliation":[]},{"given":"Yuanhui","family":"Yan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,11,8]]},"reference":[{"key":"583_CR1","unstructured":"Alsinet, T., Many, F., Planes, J.: Improved branch and bound algorithms for Max-SAT. In: Proceedings of the 6th International Conference on the Theory and Applications of Satisfiability Testing. Portofino, Italy (2003)"},{"key":"583_CR2","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s10898-007-9166-9","volume":"41","author":"T Alsinet","year":"2008","unstructured":"Alsinet, T., Many, F., Planes, J.: An efficient solver for weighted MAX-SAT. J. Global Optimiz. 41, 61\u201373 (2008)","journal-title":"J. Global Optimiz."},{"key":"583_CR3","doi-asserted-by":"crossref","unstructured":"Avidor, A., Berkovitch, I., Zwick, U.: Improved approximation algorithms for MAX NAE-SAT and MAX SAT. In: Proceedings of WAOA, pp. 27\u201340 (2005)","DOI":"10.1007\/11671411_3"},{"key":"583_CR4","doi-asserted-by":"crossref","unstructured":"Battiti, R., Protasi, M.: Reactive search, a history-sensitive heuristic for MAX-SAT. ACM J Exp Algorithms. 2(2) (1997). Artical no 2","DOI":"10.1145\/264216.264220"},{"issue":"3","key":"583_CR5","first-page":"804","volume":"27","author":"M Bellare","year":"1998","unstructured":"Bellare, M., Goldreich, O., Sudan, M.: Free bits, PCPs and non-approximability\u2014towards tight results. Soc. Ind. Appl. Math. 27(3), 804\u2013915 (1998)","journal-title":"Soc. Ind. Appl. Math."},{"key":"583_CR6","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1023\/A:1009725216438","volume":"2","author":"B Borchers","year":"1999","unstructured":"Borchers, B., Furman, J.: A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems. J. Comb. Optim. 2, 299\u2013306 (1999)","journal-title":"J. Comb. Optim."},{"key":"583_CR7","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/978-3-540-30201-8_18","volume":"3258","author":"D Cohen","year":"2004","unstructured":"Cohen, D., Cooper, M., Jeavons, P.: A complete characterization of complexity for boolean constraint optimization problems. Lect. Notes Comput. Sci. 3258, 212\u2013226 (2004)","journal-title":"Lect. Notes Comput. Sci."},{"key":"583_CR8","doi-asserted-by":"crossref","unstructured":"Costello, K.P., Shapira, A., Tetali, P.: On randomizing two derandomized greedy algorithms. J. Combin. 1(3\u20134), 265\u2013283 (2010)","DOI":"10.4310\/JOC.2010.v1.n3.a1"},{"key":"583_CR9","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1287\/opre.42.5.860","volume":"42","author":"TA Feo","year":"1994","unstructured":"Feo, T.A., Resende, M.G.C., Smith, S.H.: A greedy randomized adaptive search procedure for maximum independent set. Operat. Res. 42, 860\u2013878 (1994)","journal-title":"Operat. Res."},{"key":"583_CR10","first-page":"1","volume":"11","author":"P Festa","year":"2006","unstructured":"Festa, P., Pardalos, P.M., Pitsoulis, L.S., Resende, M.G.C.: GRASP with Path Relinking for the weighted MAXSAT problem. ACM J. Exp. Algorithm 11, 1\u201316 (2006)","journal-title":"ACM J. Exp. Algorithm"},{"key":"583_CR11","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M Garey","year":"1979","unstructured":"Garey, M., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman and Company, New York (1979)"},{"issue":"4","key":"583_CR12","doi-asserted-by":"crossref","first-page":"1108","DOI":"10.1109\/21.247892","volume":"23","author":"J Gu","year":"1993","unstructured":"Gu, J.: Local search for satisfiability (SAT) problem. IEEE Trans. Syst. Man Cybern. Part A 23(4), 1108\u20131129 (1993)","journal-title":"IEEE Trans. Syst. Man Cybern. Part A"},{"issue":"3","key":"583_CR13","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"DS Johnson","year":"1974","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci. 9(3), 256\u2013278 (1974)","journal-title":"J. Comput. Syst. Sci."},{"key":"583_CR14","doi-asserted-by":"crossref","unstructured":"Joy, S., Mitchell, J., Borchers, B.: A branch and cut algorithm for MAX-SAT and weighted MAX-SAT. In: Proceedings of the DIMACS Workshop on Satisfiability: theory and Applications. Rutgers University, NJ (1996)","DOI":"10.1090\/dimacs\/035\/13"},{"key":"583_CR15","unstructured":"de Klerk, E., Warners, J.P.: Semidefinite programming approaches for MAX-2-SAT and MAX-3-SAT: computational perspectives. Technical report, Delft, The Netherlands (1998)"},{"key":"583_CR16","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1023\/A:1006343127545","volume":"24","author":"P Mills","year":"2000","unstructured":"Mills, P., Tsang, E.: Guided local search for solving SAT and weighted MAX-SAT problems. J. Autom. Reason. 24, 205\u2013223 (2000)","journal-title":"J. Autom. Reason."},{"key":"583_CR17","doi-asserted-by":"crossref","unstructured":"Resende, M.G.C., Ribeiro, C.C.: Greedy randomized adaptive search procedures: advances and applications. In: M. Gendreau and J.-Y. Potvin (eds.) Handbook of Metaheuristics, 2nd edn., pp. 281\u2013317. Springer, New York (2010)","DOI":"10.1007\/978-1-4419-1665-5_10"},{"key":"583_CR18","unstructured":"Resende, M.G.C.: Algorithm source codes distribution. http:\/\/research.att.com\/~\/data"},{"key":"583_CR19","doi-asserted-by":"crossref","unstructured":"Resende, M.G.C., Pitsoulis, L.S., Pardalos, P.M.: Approximate solution of weighted MAX-SAT problems using GRASP. In: Du, D.-Z., Gu, J., Pardalos, P. M. (eds.), Satisfiability Problem: Theory and Applications, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 393\u2013405. American Mathematical Society, Providence (1997)","DOI":"10.1090\/dimacs\/035\/11"},{"key":"583_CR20","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0166-218X(99)00171-7","volume":"100","author":"MGC Resende","year":"2000","unstructured":"Resende, M.G.C., Pitsoulis, L.S., Pardalos, P.M.: Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP. Discret. Appl. Math. 100, 95\u2013113 (2000)","journal-title":"Discret. Appl. Math."},{"key":"583_CR21","unstructured":"Resende, M.G.C.: Test problems distribution. http:\/\/research.att.com\/~\/data"},{"key":"583_CR22","unstructured":"Selman, B., Levesque, H., Mitchell, D.: A new method for solving hard satisfiability problems. In: Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI-92), pp. 440\u2013446. San Jose, CA (1992)"},{"key":"583_CR23","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1016\/j.orl.2007.11.007","volume":"36","author":"OV Shylo","year":"2008","unstructured":"Shylo, O.V., Prokopyev, O.A., Shylo, V.P.: Solving weighted MAX-SAT via global equilibrium search. Oper. Res. Lett. 36, 434\u2013438 (2008)","journal-title":"Oper. Res. Lett."},{"key":"583_CR24","doi-asserted-by":"crossref","unstructured":"Wallace, R., Freuder, E.: Comparative studies of constraint satisfaction and Davis-Putnam algorithms for maximum satisfiability problems. In: Johnson, D., Trick, M. (eds.) Cliques, Coloring and Satisfiability, vol. 26, pp. 587\u2013615. American Mathematical Society, Providence (1996)","DOI":"10.1090\/dimacs\/026\/28"},{"key":"583_CR25","doi-asserted-by":"crossref","unstructured":"Xing, Z., Zhang, W.: Efficient strategies for (weighted) maximum satisfiability. In: Proceedings of CP- 2004, pp. 690\u2013705. Toronto, Canada (2004)","DOI":"10.1007\/978-3-540-30201-8_50"},{"key":"583_CR26","unstructured":"Spears, W.M.: Simulated annealing for hard satisfiability problems. In: Johnson, D.S., Trick, M.A. (eds.) Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, DIMACS Series in . Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, Providence 26, 533\u2013555 (1996)"},{"key":"583_CR27","doi-asserted-by":"crossref","first-page":"2723","DOI":"10.1016\/j.cor.2008.12.002","volume":"36","author":"WX Zhu","year":"2009","unstructured":"Zhu, W.X., Ali, M.M.: Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming. Comput. Oper. Res. 36, 2723\u20132728 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"583_CR28","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1016\/j.cam.2008.01.023","volume":"223","author":"WX Zhu","year":"2009","unstructured":"Zhu, W.X., Fan, H.: A discrete dynamic convexized method for nonlinear integer programming. J. Comput. Appl. Math. 223(1), 356\u2013373 (2009)","journal-title":"J. Comput. Appl. Math."},{"key":"583_CR29","unstructured":"Chen, J., Zhu, W.X.: A dynamic convexized method for VLSI circuit partitioning. Optim. Methods Softw (to appear)"},{"key":"583_CR30","unstructured":"Zhu, W.X., Lin, G., Ali, M.M.: Max-k-Cut by the discrete dynamic convexized method, INFORMS. J. Comput (to appear)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-012-0583-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-012-0583-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-012-0583-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,5]],"date-time":"2019-07-05T09:54:05Z","timestamp":1562320445000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-012-0583-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,8]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["583"],"URL":"https:\/\/doi.org\/10.1007\/s11590-012-0583-4","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,8]]}}}