乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T19:10:44Z","timestamp":1726513844615},"reference-count":24,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1998,2,1]],"date-time":"1998-02-01T00:00:00Z","timestamp":886291200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1998,8,11]],"date-time":"1998-08-11T00:00:00Z","timestamp":902793600000},"content-version":"vor","delay-in-days":191,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[1998,2]]},"DOI":"10.1016\/s0167-6377(98)00006-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:37:06Z","timestamp":1027611426000},"page":"1-12","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":84,"title":["Cliques and clustering: A combinatorial approach"],"prefix":"10.1016","volume":"22","author":[{"given":"Anuj","family":"Mehrotra","sequence":"first","affiliation":[]},{"given":"Michael A","family":"Trick","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(98)00006-6_BIB1","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF02243394","article-title":"A fast algorithm for the maximum weight clique problem","volume":"52","author":"Babel","year":"1994","journal-title":"Computing"},{"issue":"3","key":"10.1016\/S0167-6377(98)00006-6_BIB2","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1287\/moor.12.3.522","article-title":"On the maximum weight clique problem","volume":"12","author":"Balas","year":"1987","journal-title":"Math. Oper. Res."},{"issue":"2","key":"10.1016\/S0167-6377(98)00006-6_BIB3","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1137\/0220012","article-title":"Minimum weight coloring of triangulated graphs with application to maximum weight vertex packing and clique finding in arbitrary graphs","volume":"20","author":"Balas","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0167-6377(98)00006-6_BIB4","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":"Math. Programming"},{"key":"10.1016\/S0167-6377(98)00006-6_BIB5","unstructured":"C. Barnhart, E.L. Johnson, G.L. Nemhauser, M.W.P. Savelsbergh, P.H. Vance, Branch-and-price: column generation for huge integer programs, Oper. Res., to appear."},{"key":"10.1016\/S0167-6377(98)00006-6_BIB6","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1137\/S0895480191199415","article-title":"The graph partitioning polytope on series-parallel and 4-wheel free graphs","volume":"7","author":"Chopra","year":"1994","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0167-6377(98)00006-6_BIB7","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1002\/net.3230210106","article-title":"On the multiway cut polyhedron","volume":"21","author":"Chopra","year":"1991","journal-title":"Networks"},{"key":"10.1016\/S0167-6377(98)00006-6_BIB8","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF01581239","article-title":"The partition problem","volume":"59","author":"Chopra","year":"1993","journal-title":"Math. Programming"},{"key":"10.1016\/S0167-6377(98)00006-6_BIB9","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF02592198","article-title":"Formulations and valid inequalities for the node capacitated graph partitioning problem","volume":"74","author":"Ferreira","year":"1996","journal-title":"Math. Programming"},{"key":"10.1016\/S0167-6377(98)00006-6_BIB10","unstructured":"C.E. Ferreira, A. Martin, C.C. De Souza, R. Weismantel, L.A. Wolsey, The node capacitated graph partitioning problem: a computational study, CORE Discussion Paper, Universit\u00e9 Catholique de Louvain, Lovain-la-Neuve, Belgium, 1996."},{"key":"10.1016\/S0167-6377(98)00006-6_BIB11","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF01589097","article-title":"A cutting plane algorithm for a clustering problem","volume":"45","author":"Gr\u00f6tschel","year":"1989","journal-title":"Math. Programming"},{"key":"10.1016\/S0167-6377(98)00006-6_BIB12","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":"Math. Programming"},{"key":"10.1016\/S0167-6377(98)00006-6_BIB13","doi-asserted-by":"crossref","unstructured":"E.L. Johnson, Modeling and strong linear programs for mixed integer programming, in: S.W. Wallace (Ed.), Algorithms and Model Formulations in Mathematical Programming, Springer, Berlin, NATO ASI Series 51 (1989) 1989.","DOI":"10.1007\/978-3-642-83724-1_1"},{"key":"10.1016\/S0167-6377(98)00006-6_BIB14","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF01585164","article-title":"Min-cut clustering","volume":"62","author":"Johnson","year":"1993","journal-title":"Math. Programming"},{"key":"10.1016\/S0167-6377(98)00006-6_BIB15","unstructured":"A. Mehrotra, Constrained graph partitioning: decomposition, polyhedral structure and algorithms, Ph.D. Thesis, Georgia Institute of Technology, Atlanta, GA, 1992."},{"key":"10.1016\/S0167-6377(98)00006-6_BIB16","unstructured":"A. Mehrotra, C.A. Tovey, Maximum weight capacitated subtrees, 1997, Department of Management Science, University of Miami, Coral Gables, FL-33124."},{"key":"10.1016\/S0167-6377(98)00006-6_BIB17","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1287\/ijoc.8.4.344","article-title":"A column generation approach for graph coloring","volume":"8","author":"Mehrotra","year":"1996","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/S0167-6377(98)00006-6_BIB18","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0167-6377(94)90013-2","article-title":"MINTO, a mixed integer optimizer","volume":"15","author":"Nemhauser","year":"1994","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0167-6377(98)00006-6_BIB19","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF01589101","article-title":"The boolean quadratic polytope: some characteristics, facets and relatives","volume":"45","author":"Padberg","year":"1989","journal-title":"Math. Programming Ser. B"},{"key":"10.1016\/S0167-6377(98)00006-6_BIB20","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1002\/net.3230050405","article-title":"Minimum cuts and related problems","volume":"5","author":"Picard","year":"1975","journal-title":"Networks"},{"key":"10.1016\/S0167-6377(98)00006-6_BIB21","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1287\/mnsc.17.3.200","article-title":"A selection problem of shared fixed costs and network flows","volume":"17","author":"Rhys","year":"1970","journal-title":"Management Sci."},{"key":"10.1016\/S0167-6377(98)00006-6_BIB22","unstructured":"D.M. Ryan, B.A. Foster, An integer programming approach to scheduling, in: A. Wren (Ed.), Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling, North-Holland, Amsterdam, 1981, pp. 269\u2013280."},{"key":"10.1016\/S0167-6377(98)00006-6_BIB23","first-page":"111","article-title":"Solving binary cutting stock problems by column generation and branch-and-bound","volume":"III","author":"Vance","year":"1993","journal-title":"Comput. Optim. Appl."},{"key":"10.1016\/S0167-6377(98)00006-6_BIB24","unstructured":"F. Vanderbeck, Decomposition and column generation for integer programs, Doctoral Thesis, Facult\u00e9 des Sciences Appliqu\u00e9es, Universit\u00e9 Catholique de Louvain, Lovain-la-Neuve, Belgium, 1994."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637798000066?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637798000066?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T22:11:40Z","timestamp":1698703900000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637798000066"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,2]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,2]]}},"alternative-id":["S0167637798000066"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(98)00006-6","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1998,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Cliques and clustering: A combinatorial approach","name":"articletitle","label":"Article Title"},{"value":"Operations Research Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0167-6377(98)00006-6","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1998 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}