乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T19:07:30Z","timestamp":1726513650865},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[1997,1]]},"DOI":"10.1016\/s0167-6377(96)00038-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:14:29Z","timestamp":1027638869000},"page":"21-29","source":"Crossref","is-referenced-by-count":12,"title":["A combinatorial column generation algorithm for the maximum stable set problem"],"prefix":"10.1016","volume":"20","author":[{"given":"Jean-Marie","family":"Bourjolly","sequence":"first","affiliation":[]},{"given":"Gilbert","family":"Laporte","sequence":"additional","affiliation":[]},{"given":"H\u00e9l\u00e8ne","family":"Mercure","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(96)00038-7_BIB1","doi-asserted-by":"crossref","first-page":"1054","DOI":"10.1137\/0215075","article-title":"Finding a maximum clique in an arbitrary graph","volume":"15","author":"Balas","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0167-6377(96)00038-7_BIB2","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1007\/BFb0121007","article-title":"Nodeweighted graphs having the K\u00f6nig-Egerv\u00e1ry property","volume":"22","author":"Bourjolly","year":"1984","journal-title":"Math. Programming Stud."},{"key":"10.1016\/S0167-6377(96)00038-7_BIB3","series-title":"Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge","first-page":"53","article-title":"A quadratic 0\u20131 optimization algorithm for the maximum clique and stable set problems","volume":"Vol. 26","author":"Bourjolly","year":"1996"},{"key":"10.1016\/S0167-6377(96)00038-7_BIB4","article-title":"Combinatorial methods for bounding quadratic pseudo-Boolean functions","author":"Bourjolly","year":"1989"},{"key":"10.1016\/S0167-6377(96)00038-7_BIB5","article-title":"A combinatorial column generation algorithm for the maximum clique and stable set problems","author":"Bourjolly","year":"1994","journal-title":"Les Cahiers du GERAD, G-94-33"},{"key":"10.1016\/S0167-6377(96)00038-7_BIB6","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0166-218X(92)90273-D","article-title":"K\u00f6nig-Egerv\u00e1ry graphs, 2-bicritical graphs, and fractional matchings","volume":"24","author":"Bourjolly","year":"1989","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0167-6377(96)00038-7_BIB7","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1287\/mnsc.26.7.736","article-title":"Some new branching and bounding criteria for the asymmetric travelling salesman problem","volume":"26","author":"Carpaneto","year":"1980","journal-title":"Management Sci."},{"key":"10.1016\/S0167-6377(96)00038-7_BIB8","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0012-365X(79)90066-9","article-title":"Independence numbers of graphs: an extension of the K\u00f6nig-Egerv\u00e1ry theorem","volume":"27","author":"Deming","year":"1979","journal-title":"Discrete Math."},{"key":"10.1016\/S0167-6377(96)00038-7_BIB9","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","article-title":"Paths, trees and flowers","volume":"17","author":"Edmonds","year":"1965","journal-title":"Canadian J. Math."},{"key":"10.1016\/S0167-6377(96)00038-7_BIB10","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1016\/0095-8956(89)90032-4","article-title":"A min-max relation for stable sets in graphs with no odd-K4","volume":"47","author":"Gerards","year":"1989","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0167-6377(96)00038-7_BIB11","article-title":"Two algorithms for maximum cliques in dense graphs","author":"Hansen","year":"1992","journal-title":"Les Cahiers du GERAD, G-92-18"},{"key":"10.1016\/S0167-6377(96)00038-7_BIB12","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/BF01580444","article-title":"Vertex packings: structural properties and algorithms","volume":"8","author":"Nemhauser","year":"1975","journal-title":"Math. Programming"},{"key":"10.1016\/S0167-6377(96)00038-7_BIB13","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0305-0548(92)90067-F","article-title":"A branch-and-bound algorithm for the maximum clique problem","volume":"19","author":"Pardalos","year":"1992","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/S0167-6377(96)00038-7_BIB14","unstructured":"E.C. Sewell, \u201cBranch-and-bound algorithm for the stability number of a sparse graph\u201d, to appear in INFORMS Journal on Computing."},{"key":"10.1016\/S0167-6377(96)00038-7_BIB15","series-title":"Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge","first-page":"221","article-title":"Tabu search algorithms for the maximum clique problem","volume":"Vol 26","author":"Soriano","year":"1996"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637796000387?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637796000387?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T08:53:55Z","timestamp":1555577635000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637796000387"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,1]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,1]]}},"alternative-id":["S0167637796000387"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(96)00038-7","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1997,1]]}}}