乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T11:40:03Z","timestamp":1704109203461},"reference-count":33,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2001,5,1]],"date-time":"2001-05-01T00:00:00Z","timestamp":988675200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2001,5]]},"DOI":"10.1016\/s0377-2217(99)00449-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T20:54:50Z","timestamp":1027630490000},"page":"119-131","source":"Crossref","is-referenced-by-count":25,"title":["A Lagrangian relaxation approach to the edge-weighted clique problem"],"prefix":"10.1016","volume":"131","author":[{"given":"Marcel","family":"Hunting","sequence":"first","affiliation":[]},{"given":"Ulrich","family":"Faigle","sequence":"additional","affiliation":[]},{"given":"Walter","family":"Kern","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(99)00449-X_BIB1","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF01584228","article-title":"A restricted Lagrangean approach to the traveling salesman problem","volume":"21","author":"Balas","year":"1981","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(99)00449-X_BIB2","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02592023","article-title":"On the cut polytope","volume":"36","author":"Barahona","year":"1986","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(99)00449-X_BIB3","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01587084","article-title":"Experiments in quadratic 0\u20131 programming","volume":"44","author":"Barahona","year":"1989","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(99)00449-X_BIB4","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1287\/moor.18.1.245","article-title":"Cut-polytopes, Boolean quadric polytopes and nonnegative quadratic pseudo-Boolean functions","volume":"18","author":"Boros","year":"1993","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0377-2217(99)00449-X_BIB5","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1287\/ijoc.7.1.109","article-title":"A branch and bound algorithm for integer quadratic knapsack problems","volume":"7","author":"Bretthauer","year":"1995","journal-title":"ORSA Journal of Computing"},{"key":"10.1016\/S0377-2217(99)00449-X_BIB6","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BFb0083467","article-title":"Best network flow bounds for the quadratic knapsack problem","volume":"1403","author":"Chaillou","year":"1989","journal-title":"Springer Lecture Notes in Mathematics"},{"key":"10.1016\/S0377-2217(99)00449-X_BIB7","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF01580897","article-title":"Facets for the cut cone I","volume":"56","author":"Deza","year":"1992","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(99)00449-X_BIB8","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF01580898","article-title":"Facets for the cut cone II: Clique-web inequalities","volume":"56","author":"Deza","year":"1992","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(99)00449-X_BIB9","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0377-2217(93)90097-7","article-title":"A cutting-plane approach to the edge-weighted maximal clique problem","volume":"69","author":"Dijkhuizen","year":"1993","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00449-X_BIB10","first-page":"51","article-title":"The discrete p-maxian location problem","volume":"17","author":"Erkut","year":"1990","journal-title":"Computers & Operations Research and their Application to Problems of World Concern"},{"key":"10.1016\/S0377-2217(99)00449-X_BIB11","doi-asserted-by":"crossref","unstructured":"Faigle, U., Garbe, R., Heerink, K., Spieker, B., 1994. LP-relaxations for the edge-weighted subclique problem. In: Bachem, A., Derigs, U., J\u00fcnger, M., Schrader, R. (Eds.), Operations Research '93, Physica-Verlag, Heidelberg, pp. 157\u2013160","DOI":"10.1007\/978-3-642-46955-8_41"},{"key":"10.1016\/S0377-2217(99)00449-X_BIB12","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/BF01584346","article-title":"On the convergence rates of subgradient optimization methods","volume":"13","author":"Goffin","year":"1977","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(99)00449-X_BIB13","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF01580870","article-title":"Facets of the clique partitioning polytope","volume":"47","author":"Gr\u00f6tschel","year":"1990","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(99)00449-X_BIB14","unstructured":"Hardin, J., Lee, J., Leung, J., 1995. On the Boolean-quadric packing uncapacitated facility-location polytope. Technical report, Department of Mathematics, University of Kentucky, December 1995"},{"key":"10.1016\/S0377-2217(99)00449-X_BIB15","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/BF01580223","article-title":"Validation of subgradient optimization","volume":"6","author":"Held","year":"1974","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(99)00449-X_BIB16","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/3-540-61310-2_14","article-title":"Quadratic knapsack relaxations using cutting planes and semidefinite programming","volume":"1084","author":"Helmberg","year":"1996","journal-title":"Springer Lecture Notes in Computer Science"},{"key":"10.1016\/S0377-2217(99)00449-X_BIB17","unstructured":"Hunting, M., 1998. Relaxation techniques for discrete optimization problems; theory and algorithms, Ph.D. Dissertation, University of Twente"},{"key":"10.1016\/S0377-2217(99)00449-X_BIB18","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF01585164","article-title":"Min-cut clustering","volume":"62","author":"Johnson","year":"1993","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(99)00449-X_BIB19","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1111\/j.1538-4632.1987.tb00133.x","article-title":"Programming models for facility dispersion: the p-dispersion and maxisum dispersion problems","volume":"9","author":"Kuby","year":"1987","journal-title":"Geographical Analysis"},{"key":"10.1016\/S0377-2217(99)00449-X_BIB20","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0801013","article-title":"Cones of matrices and set-functions and 0\u20131 optimization","volume":"1","author":"Lov\u00e1sz","year":"1991","journal-title":"SIAM Journal on Optimization"},{"key":"10.1016\/S0377-2217(99)00449-X_BIB21","first-page":"2","article-title":"Steiner problems in graphs: Lagrangian relaxation and cutting-planes","volume":"21","author":"Lucena","year":"1992","journal-title":"COAL Bulletin, Mathematical Programming Society"},{"key":"10.1016\/S0377-2217(99)00449-X_BIB22","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1016\/S0377-2217(99)00262-3","article-title":"The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations","volume":"123","author":"Macambira","year":"2000","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00449-X_BIB23","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0166-218X(97)00039-5","article-title":"Cardinality constrained Boolean quadratic polytope","volume":"79","author":"Mehrotra","year":"1997","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(99)00449-X_BIB24","doi-asserted-by":"crossref","unstructured":"Nemhauser, G.L., Wolsey, L.A., 1988. Integer and Combinatorial Optimization. Wiley, New York","DOI":"10.1002\/9781118627372"},{"key":"10.1016\/S0377-2217(99)00449-X_BIB25","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF01589101","article-title":"The Boolean quadric polytope: Some characteristics, facets and relatives","volume":"45","author":"Padberg","year":"1989","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(99)00449-X_BIB26","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1016\/0377-2217(95)00299-5","article-title":"An extended formulation approach to the edge-weighted maximal clique problem","volume":"95","author":"Park","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00449-X_BIB27","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1287\/opre.42.2.299","article-title":"Heuristic and special case algorithms for dispersion problems","volume":"42","author":"Ravi","year":"1994","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00449-X_BIB28","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/0403036","article-title":"A hierarchy of relaxations between the continuous and convex hull representations for zero\u2013one programming problems","volume":"3","author":"Sherali","year":"1990","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"10.1016\/S0377-2217(99)00449-X_BIB29","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0167-6377(94)00065-E","article-title":"A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope","volume":"17","author":"Sherali","year":"1995","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(99)00449-X_BIB30","first-page":"98","article-title":"On the rate of convergence of the generalized gradient method","volume":"4","author":"Shor","year":"1968","journal-title":"Kibernetika"},{"key":"10.1016\/S0377-2217(99)00449-X_BIB31","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1007\/BF01070506","article-title":"Convergence rate of the gradient descent method with dilatation of the space","volume":"6","author":"Shor","year":"1970","journal-title":"Cybernetics"},{"key":"10.1016\/S0377-2217(99)00449-X_BIB32","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF01918201","article-title":"Heuristically determining cliques of given cardinality and with minimal cost within weighted complete graphs","volume":"29","author":"Sp\u00e4th","year":"1985","journal-title":"Zeitschrift f\u00fcr Operations Research"},{"key":"10.1016\/S0377-2217(99)00449-X_BIB33","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF01580441","article-title":"Faces for a linear inequality in 0\u20131 variables","volume":"4","author":"Wolsey","year":"1975","journal-title":"Mathematical Programming"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722179900449X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722179900449X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T11:20:31Z","timestamp":1704108031000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S037722179900449X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,5]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,5]]}},"alternative-id":["S037722179900449X"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(99)00449-x","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2001,5]]}}}