{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T00:48:25Z","timestamp":1648946905530},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"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":["Computers & Operations Research"],"published-print":{"date-parts":[[1994,3]]},"DOI":"10.1016\/0305-0548(94)90093-0","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"319-327","source":"Crossref","is-referenced-by-count":2,"title":["A new global approach for 0\u20131 polynomial programs"],"prefix":"10.1016","volume":"21","author":[{"given":"Li","family":"Han-Lin","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"No. 2","key":"10.1016\/0305-0548(94)90093-0_BIB1","doi-asserted-by":"crossref","DOI":"10.1287\/opre.38.2.217","article-title":"Linearization strategies for a class of zero-one mixed integer programming problems","volume":"38","author":"Adams","year":"1990","journal-title":"Opns Res."},{"key":"10.1016\/0305-0548(94)90093-0_BIB2","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1080\/03052158808940953","article-title":"Interactive design optimization","volume":"13","author":"Arora","year":"1988","journal-title":"Eng. Optimization"},{"issue":"No. 9","key":"10.1016\/0305-0548(94)90093-0_BIB3","doi-asserted-by":"crossref","first-page":"1195","DOI":"10.1287\/mnsc.37.9.1195","article-title":"An improved discrete dynamic programming algorithm for allocating resources among interdependent projects","volume":"37","author":"Carraway","year":"1991","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(94)90093-0_BIB4","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1287\/opre.22.1.180","article-title":"Converting 0\u20131 polynomial programming problem to a 0\u20131 linear program","volume":"22","author":"Glover","year":"1974","journal-title":"Opns Res."},{"key":"10.1016\/0305-0548(94)90093-0_BIB5","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu Search","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA J. Computing"},{"key":"10.1016\/0305-0548(94)90093-0_BIB6","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0377-2217(91)90321-L","article-title":"Tabu Search for large scale timetabling problems","volume":"54","author":"Hertz","year":"1991","journal-title":"Eur. J. opl Res."},{"issue":"No. 5","key":"10.1016\/0305-0548(94)90093-0_BIB7","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1016\/0305-0548(92)90072-D","article-title":"An approximate method for local optimal for solving nonlinear integer programming","volume":"19","author":"Li","year":"1992","journal-title":"Computers Ops Res."},{"key":"10.1016\/0305-0548(94)90093-0_BIB8","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/0305-0548(90)90050-H","article-title":"An implicit branch-and-bound algorithm for mixed-integer-lincar programming","volume":"17","author":"Lin","year":"1990","journal-title":"Computers Ops Res."},{"key":"10.1016\/0305-0548(94)90093-0_BIB9","series-title":"Integer and Combinatorial Optimization","author":"Nemhauser","year":"1988"},{"key":"10.1016\/0305-0548(94)90093-0_BIB10","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1080\/03052158908941145","article-title":"Mixed integer model for resource allocation in project management","volume":"15","author":"Ramlogan","year":"1989","journal-title":"Eng. Optimization"},{"key":"10.1016\/0305-0548(94)90093-0_BIB11","article-title":"Nonlinear integer and discrete programming in mechanical design optimization","volume":"112","author":"Sandgren","year":"1990","journal-title":"J. mech. Design"},{"issue":"No. 1","key":"10.1016\/0305-0548(94)90093-0_BIB12","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1287\/ijoc.2.1.33","article-title":"Tabu Search applied to quadratic assignment problem","volume":"2","author":"Skorin-kapov","year":"1990","journal-title":"ORSA J. Computing"},{"key":"10.1016\/0305-0548(94)90093-0_BIB13","first-page":"116","article-title":"Integer Programming","author":"Taha","year":"1975"},{"key":"10.1016\/0305-0548(94)90093-0_BIB14","author":"Schrage","year":"1982"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894900930?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894900930?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T17:26:16Z","timestamp":1552929976000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054894900930"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["0305054894900930"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(94)90093-0","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}