{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,23]],"date-time":"2026-05-23T17:04:41Z","timestamp":1779555881354,"version":"3.53.1"},"reference-count":23,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100003453","name":"Guangdong Provincial Natural Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003453","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010877","name":"Shenzhen Science and Technology Innovation Committee","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100010877","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002855","name":"Ministry of Science and Technology of the People's Republic of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002855","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.orl.2026.107431","type":"journal-article","created":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T00:13:02Z","timestamp":1772583182000},"page":"107431","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Parallel Graver basis extraction for nonlinear integer optimization"],"prefix":"10.1016","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2928-8330","authenticated-orcid":false,"given":"Wenbo","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3325-8441","authenticated-orcid":false,"given":"Akang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8441-7334","authenticated-orcid":false,"given":"Wenguo","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.orl.2026.107431_bib0001","series-title":"Portfolio selection: efficient diversification of investments","author":"Markowitz","year":"1967"},{"key":"10.1016\/j.orl.2026.107431_bib0002","series-title":"Nonlinear integer programming","volume":"84","author":"Li","year":"2006"},{"key":"10.1016\/j.orl.2026.107431_bib0003","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s10107-009-0276-7","article-title":"A polynomial oracle-time algorithm for convex integer minimization","volume":"126","author":"Hemmecke","year":"2011","journal-title":"Math. Program."},{"issue":"8","key":"10.1016\/j.orl.2026.107431_bib0004","doi-asserted-by":"crossref","first-page":"1569","DOI":"10.1016\/j.jpaa.2008.11.033","article-title":"Convex integer maximization via Graver bases","volume":"213","author":"De Loera","year":"2009","journal-title":"J. Pure Appl. Algebra"},{"key":"10.1016\/j.orl.2026.107431_bib0005","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/s10107-012-0605-0","article-title":"The quadratic Graver cone, quadratic integer minimization, and extensions","volume":"136","author":"Lee","year":"2012","journal-title":"Math. Program."},{"key":"10.1016\/j.orl.2026.107431_bib0006","series-title":"On hilbert bases of polyhedral cones","author":"Henk","year":"1996"},{"key":"10.1016\/j.orl.2026.107431_bib0007","series-title":"Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation","first-page":"40","article-title":"The euclidean algorithm in dimension n","author":"Pottier","year":"1996"},{"key":"10.1016\/j.orl.2026.107431_bib0008","series-title":"Mathematical Software","first-page":"307","article-title":"On the computation of hilbert bases of cones","author":"Hemmecke","year":"2002"},{"key":"10.1016\/j.orl.2026.107431_bib0009","unstructured":"H. Alghassi, R. Dridi, S. Tayur, Graver bases via quantum annealing with application to non-linear integer programs, arXiv: 1902.04215(2019)."},{"key":"10.1016\/j.orl.2026.107431_bib0010","doi-asserted-by":"crossref","DOI":"10.1287\/ijoc.2024.0574.cd","article-title":"A quantum-Inspired bilevel optimization algorithm for the first responder network design problem","author":"Karahalios","year":"2024","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/j.orl.2026.107431_bib0011","series-title":"Algebraic and geometric ideas in the theory of discrete optimization","author":"De Loera","year":"2012"},{"issue":"4","key":"10.1016\/j.orl.2026.107431_bib0012","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1137\/0208040","article-title":"Polynomial algorithms for computing the smith and hermite normal forms of an integer matrix","volume":"8","author":"Kannan","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.orl.2026.107431_bib0013","series-title":"Complexity of Lattice Problems: A Cryptographic Perspective","first-page":"69","article-title":"Shortest vector problem","author":"Micciancio","year":"2002"},{"issue":"1","key":"10.1016\/j.orl.2026.107431_bib0014","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","article-title":"Regression shrinkage and selection via the lasso","volume":"58","author":"Tibshirani","year":"1996","journal-title":"J. R. Stat. Soc. Ser. B: Statistical Methodology"},{"key":"10.1016\/j.orl.2026.107431_bib0015","unstructured":"D.P. Kingma, Adam: A method for stochastic optimization, arXiv: 1412.6980(2014)."},{"key":"10.1016\/j.orl.2026.107431_bib0016","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/s12532-018-0147-4","article-title":"QPLIB: A library of quadratic programming instances","volume":"11","author":"Furini","year":"2019","journal-title":"Math. Program. Comput."},{"issue":"1","key":"10.1016\/j.orl.2026.107431_bib0017","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1287\/ijoc.15.1.114.15159","article-title":"MINLPLib-A collection of test models for mixed-integer nonlinear programming","volume":"15","author":"Bussieck","year":"2003","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/j.orl.2026.107431_bib0018","unstructured":"L. Gurobi Optimization, Gurobi Optimizer Reference Manual, 2023, https:\/\/www.gurobi.com."},{"key":"10.1016\/j.orl.2026.107431_bib0019","unstructured":"IBM, IBM ILOG CPLEX Optimization Studio, 2022, https:\/\/www.ibm.com\/products\/ilog-cplex-optimization-studio."},{"key":"10.1016\/j.orl.2026.107431_bib0020","series-title":"Technical Report","article-title":"The SCIP Optimization Suite 9.0","author":"Bolusani","year":"2024"},{"key":"10.1016\/j.orl.2026.107431_bib0021","unstructured":"X. He, P. Lin, S. Cai, Local Search for Integer Quadratic Programming, arXiv: 2409.19668(2024)."},{"key":"10.1016\/j.orl.2026.107431_bib0022","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF01457454","article-title":"Factoring polynomials with rational coefficients","volume":"261","author":"Lenstra","year":"1982","journal-title":"Math. Annalen"},{"key":"10.1016\/j.orl.2026.107431_bib0023","series-title":"Theory of linear and integer programming","author":"Schrijver","year":"1998"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637726000283?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637726000283?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,23]],"date-time":"2026-05-23T16:16:58Z","timestamp":1779553018000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637726000283"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":23,"alternative-id":["S0167637726000283"],"URL":"https:\/\/doi.org\/10.1016\/j.orl.2026.107431","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Parallel Graver basis extraction for nonlinear integer optimization","name":"articletitle","label":"Article Title"},{"value":"Operations Research Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.orl.2026.107431","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"107431"}}