{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T06:31:06Z","timestamp":1648794666459},"reference-count":13,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1979,9,1]],"date-time":"1979-09-01T00:00:00Z","timestamp":304992000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":12373,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1979,9]]},"DOI":"10.1016\/0166-218x(79)90013-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:34Z","timestamp":1027655014000},"page":"31-50","source":"Crossref","is-referenced-by-count":1,"title":["Equivalent constraints for discrete sets"],"prefix":"10.1016","volume":"1","author":[{"given":"R.R","family":"Meyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(79)90013-1_BIB1","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0012-365X(71)90005-7","article-title":"Transformation of integer programs to knapsack problems","volume":"1","author":"Bradley","year":"1971","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(79)90013-1_BIB2","series-title":"Proc. of the Fifth Annual Princeton Conference, on Information Sciences and Systems","article-title":"Heuristic solution methods and transformed integer linear programming problems","author":"Bradley","year":"1971"},{"key":"10.1016\/0166-218X(79)90013-1_BIB3","series-title":"On the treatment of stock cutting problems as diophantine programs","author":"Elmaghraby","year":"1970"},{"key":"10.1016\/0166-218X(79)90013-1_BIB4","series-title":"Man. Sci. Rpt. 72-7","article-title":"New results for reducing integer linear programs to knapsack problems","author":"Glover","year":"1972"},{"key":"10.1016\/0166-218X(79)90013-1_BIB5","series-title":"Man. Sci. Rpt. 70-4","article-title":"Aggregating diophantine equations","author":"Glover","year":"1970"},{"key":"10.1016\/0166-218X(79)90013-1_BIB6","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1287\/opre.21.1.343","article-title":"Rationalizing discrete programs","volume":"21","author":"Gould","year":"1973","journal-title":"Operations Res."},{"key":"10.1016\/0166-218X(79)90013-1_BIB7","first-page":"359","article-title":"On the determination of the minima of pseudoboolean functions","volume":"14","author":"Hammer","year":"1963","journal-title":"Studii Cercetari Mat."},{"key":"10.1016\/0166-218X(79)90013-1_BIB8","series-title":"Boolean Methods in Operation Research and Related Areas","author":"Hammer","year":"1968"},{"key":"10.1016\/0166-218X(79)90013-1_BIB9","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1112\/plms\/s1-28.1.486","article-title":"On the partition of numbers","volume":"28","author":"Mathews","year":"1896","journal-title":"Proc. London Math. Soc."},{"key":"10.1016\/0166-218X(79)90013-1_BIB10","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF00936716","article-title":"Strong duality for a class of integer programs","volume":"22","author":"Meyer","year":"1977","journal-title":"JOTA"},{"key":"10.1016\/0166-218X(79)90013-1_BIB11","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1137\/0316044","article-title":"On the Polyhedrality of the convex hull of the feasible set of an integer program","volume":"16","author":"Meyer","year":"1978","journal-title":"SIAM J. Control and Opt."},{"key":"10.1016\/0166-218X(79)90013-1_BIB12","series-title":"Rpt. 227, GSIA","article-title":"Equivalent knapsack-type formulations of bounded integer linear programs","author":"Padberg","year":"1970"},{"key":"10.1016\/0166-218X(79)90013-1_BIB13","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1002\/nav.3800190410","article-title":"Equivalent knapsack-type formulations of bounded integer linear programs: an alternative approach","volume":"19","author":"Padberg","year":"1972","journal-title":"NRLQ"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X79900131?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X79900131?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:23:43Z","timestamp":1555136623000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X79900131"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,9]]},"references-count":13,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1979,9]]}},"alternative-id":["0166218X79900131"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(79)90013-1","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1979,9]]}}}