{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T11:11:40Z","timestamp":1648638700958},"reference-count":81,"publisher":"Elsevier","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1016\/s0169-7161(05)80132-4","type":"book-chapter","created":{"date-parts":[[2005,4,18]],"date-time":"2005-04-18T15:58:53Z","timestamp":1113839933000},"page":"279-302","source":"Crossref","is-referenced-by-count":1,"title":["8 Integer programming"],"prefix":"10.1016","author":[{"given":"Panos M.","family":"Pardalos","sequence":"first","affiliation":[]},{"given":"Yong","family":"Li","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0169-7161(05)80132-4_bib1","series-title":"Mathematical Programming in Statistics","author":"Arthanari","year":"1981"},{"key":"10.1016\/S0169-7161(05)80132-4_bib2","first-page":"215","article-title":"On some problems of diophantine programming","volume":"4","author":"Ben-Israel","year":"1962","journal-title":"Cahiers Centre \u00c9tudes Rech. Op\u00e9r."},{"key":"10.1016\/S0169-7161(05)80132-4_bib3","series-title":"Dynamic Programming","author":"Bellman","year":"1957"},{"key":"10.1016\/S0169-7161(05)80132-4_bib4","series-title":"Applied Dynamic Programming","author":"Bellman","year":"1962"},{"key":"10.1016\/S0169-7161(05)80132-4_bib5","series-title":"Proc. 1989 Sympos. on Theoretical Computer Science","first-page":"517","article-title":"On the complexity of approximating the independent set problem","volume":"Vol. 349","author":"Berman","year":"1989"},{"issue":"6","key":"10.1016\/S0169-7161(05)80132-4_bib6","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1016\/0305-0548(90)90062-C","article-title":"Modeling and integer programming techniques applied to propositional calculus","volume":"17","author":"Cavalier","year":"1990","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/S0169-7161(05)80132-4_bib7","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1016\/0024-3795(89)90476-X","article-title":"On cutting-plane proofs in combinatorial optimization","volume":"114\/115","author":"Chv\u00e1tal","year":"1989","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/S0169-7161(05)80132-4_bib8","article-title":"Worst case analysis of a new heuristic for the traveling salesman problem","author":"Christofides","year":"1975"},{"key":"10.1016\/S0169-7161(05)80132-4_bib9","series-title":"Computer and Job-Shop Scheduling Theory","year":"1976"},{"key":"10.1016\/S0169-7161(05)80132-4_bib10","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/opre.31.5.803","article-title":"Solving large-scale zero-one linear programming problems","volume":"31","author":"Crowder","year":"1982","journal-title":"Oper. Res."},{"key":"10.1016\/S0169-7161(05)80132-4_bib11","article-title":"On the significance of solving linear programming problems with some integer variables","author":"Dantzig","year":"1958","journal-title":"The Rand Corporation, Document P1486"},{"key":"10.1016\/S0169-7161(05)80132-4_bib12","series-title":"Dynamic Programming Models and Applications","author":"Denardo","year":"1982"},{"key":"10.1016\/S0169-7161(05)80132-4_bib13","series-title":"The Art and Theory of Dynamic Programming","author":"Dreyfus","year":"1977"},{"issue":"4","key":"10.1016\/S0169-7161(05)80132-4_bib14","first-page":"5","article-title":"L'alg\u00e8bra de Boole et ses applications en recherche op\u00e9rationnnelle","volume":"1","author":"Fortet","year":"1959","journal-title":"Cahiers Centre \u00c9tudes Rech. Op\u00e9r."},{"issue":"14","key":"10.1016\/S0169-7161(05)80132-4_bib15","first-page":"17","article-title":"Applications de l'alg\u00e8bra de Boole en recherche op\u00e9rationnelle","volume":"4","author":"Fortet","year":"1960","journal-title":"Rev. Franc. Inform. Rech. Op\u00e9r."},{"key":"10.1016\/S0169-7161(05)80132-4_bib16","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1007\/BF01582246","article-title":"A simplex algorithm for piecewise-linear programming I: Derivation and proof","volume":"33","author":"Fourer","year":"1985","journal-title":"Math. Programming"},{"key":"10.1016\/S0169-7161(05)80132-4_bib17","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0169-7161(05)80132-4_bib18","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1287\/opre.13.6.879","article-title":"A multiphase-dual algorithm for the zero-one integer programming problem","volume":"13","author":"Glover","year":"1965","journal-title":"Oper. Res."},{"key":"10.1016\/S0169-7161(05)80132-4_bib19","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1287\/opre.16.4.727","article-title":"A new foundation for a simplified primal integer programming algorithm","volume":"16","author":"Glover","year":"1968","journal-title":"Oper. Res."},{"issue":"1","key":"10.1016\/S0169-7161(05)80132-4_bib20","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1287\/opre.21.1.156","article-title":"Further reduction of zero-one polynomial programs to zero-one linear programming problems","volume":"21","author":"Glover","year":"1973","journal-title":"Oper. Res."},{"key":"10.1016\/S0169-7161(05)80132-4_bib21","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1287\/opre.22.1.180","article-title":"Converting the 0\u20131 polynomial programs to 0\u20131 linear programming problems","volume":"22","author":"Glover","year":"1974","journal-title":"Oper. Res."},{"issue":"5","key":"10.1016\/S0169-7161(05)80132-4_bib22","doi-asserted-by":"crossref","first-page":"946","DOI":"10.1287\/opre.31.5.946","article-title":"Linearization in 0\u20131 variables: A clarification","volume":"31","author":"Goldman","year":"1983","journal-title":"Oper. Res."},{"issue":"5","key":"10.1016\/S0169-7161(05)80132-4_bib23","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1090\/S0002-9904-1958-10224-4","article-title":"Outline of an algorithm for integer solution to linear programs","volume":"64","author":"Gomory","year":"1958","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/S0169-7161(05)80132-4_bib24","series-title":"An algorithm for the mixed integer problem","author":"Gomory","year":"1960"},{"key":"10.1016\/S0169-7161(05)80132-4_bib25","series-title":"Industrial Scheduling","first-page":"193","article-title":"An all-integer programming algorithm","author":"Gomory","year":"1963"},{"issue":"6","key":"10.1016\/S0169-7161(05)80132-4_bib26","doi-asserted-by":"crossref","first-page":"1442","DOI":"10.1287\/opre.28.6.1442","article-title":"Generalized covering relaxation in 0\u20131 programming","volume":"28","author":"Granot","year":"1980","journal-title":"Oper. Res."},{"key":"10.1016\/S0169-7161(05)80132-4_bib27","first-page":"277","article-title":"On the role of generalized covering problems","volume":"17","author":"Granot","year":"1975","journal-title":"Cahiers Centre \u00c8tudes Rech. Op\u00e9r."},{"key":"10.1016\/S0169-7161(05)80132-4_bib28","first-page":"359","article-title":"On the determination of the minima of pseudo-Boolean functions (in Russian)","volume":"14","author":"Hammer","year":"1963","journal-title":"Stud. Cerc. Mat."},{"key":"10.1016\/S0169-7161(05)80132-4_bib29","series-title":"Boolean Methods in Operations Research and Related Areas","author":"Hammer","year":"1968"},{"key":"10.1016\/S0169-7161(05)80132-4_bib30","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/S0167-5060(08)70343-1","article-title":"Methods for nonlinear 0\u20131 programming","volume":"5","author":"Hansen","year":"1979","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0169-7161(05)80132-4_bib31","article-title":"Constrained nonlinear 0\u20131 programming","author":"Hansen","year":"1989"},{"key":"10.1016\/S0169-7161(05)80132-4_bib32","series-title":"Integer Programming and Related Areas. A Classified Bibliography","volume":"Vol. 160","year":"1978"},{"key":"10.1016\/S0169-7161(05)80132-4_bib33","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","article-title":"The traveling salesman problem and minimum spanning trees","volume":"18","author":"Held","year":"1970","journal-title":"Oper. Res."},{"key":"10.1016\/S0169-7161(05)80132-4_bib34","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0167-9236(88)90097-8","article-title":"A quantitative approach to logical inference","volume":"4","author":"Hooker","year":"1988","journal-title":"Decision Support Systems"},{"key":"10.1016\/S0169-7161(05)80132-4_bib35","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF01531074","article-title":"Branch-and-cut solution of inference problems in propositional logic","volume":"1","author":"Hooker","year":"1990","journal-title":"Ann. Math. Artificial Intellig."},{"key":"10.1016\/S0169-7161(05)80132-4_bib36","article-title":"Enumerative approaches to combinatorial optimization. Part I and II","volume":"10\u201311","author":"Ibaraki","year":"1987","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0169-7161(05)80132-4_bib37","first-page":"141","article-title":"Pseudo-Boolean programming with constraints","volume":"50","author":"Inagaki","year":"1979","journal-title":"J. Electron. Comm. Engineers Japan"},{"key":"10.1016\/S0169-7161(05)80132-4_bib38","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","article-title":"Approximation algorithms for combinatorial problems","volume":"9","author":"Johnson","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0169-7161(05)80132-4_bib39","series-title":"Integer Programming and Related Areas. A Classified Bibliography","volume":"Vol. 128","year":"1976"},{"key":"10.1016\/S0169-7161(05)80132-4_bib40","series-title":"Combinatorial Optimization: Annotated Bibliographies","first-page":"106","article-title":"Parallel algorithms","author":"Kindervater","year":"1985"},{"key":"10.1016\/S0169-7161(05)80132-4_bib41","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0166-218X(86)90057-0","article-title":"An introduction to parallelism in combinatorial optimization","volume":"14","author":"Kindervater","year":"1986","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0169-7161(05)80132-4_bib42","doi-asserted-by":"crossref","first-page":"497","DOI":"10.2307\/1910129","article-title":"An automatic method for solving discrete programming problems","volume":"28","author":"Land","year":"1960","journal-title":"Econometrica"},{"key":"10.1016\/S0169-7161(05)80132-4_bib43","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1287\/opre.14.6.1098","article-title":"A method for solving discrete optimization problems","volume":"14","author":"Lawler","year":"1966","journal-title":"Oper. Res."},{"key":"10.1016\/S0169-7161(05)80132-4_bib44","series-title":"The Traveling Salesman Problem","author":"Lawler","year":"1985"},{"key":"10.1016\/S0169-7161(05)80132-4_bib45","doi-asserted-by":"crossref","first-page":"1515","DOI":"10.1287\/mnsc.24.14.1515","article-title":"Integer programming solution of a classification problem","volume":"24","author":"Liitschwager","year":"1978","journal-title":"Management Sci."},{"key":"10.1016\/S0169-7161(05)80132-4_bib46","first-page":"1101","article-title":"An algorithm for the traveling salesman problem","volume":"27","author":"Little","year":"1979","journal-title":"Oper. Res."},{"key":"10.1016\/S0169-7161(05)80132-4_bib47","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1287\/mnsc.15.2.B51","article-title":"An extension of Lawler and Bell's method of discrete optimization with examples from capital budgeting","volume":"15","author":"Mao","year":"1968","journal-title":"Management Sci."},{"key":"10.1016\/S0169-7161(05)80132-4_bib48","first-page":"481","article-title":"Correction and comments on an extension of Lawler and Bell's method of discrete optimization with examples from capital budgeting","volume":"15","author":"Mao","year":"1969","journal-title":"Management Sci."},{"key":"10.1016\/S0169-7161(05)80132-4_bib49","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1145\/321043.321046","article-title":"Integer programming formulation and traveling salesman problems","volume":"7","author":"Miller","year":"1960","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0169-7161(05)80132-4_bib50","series-title":"Discrete Location Theory","year":"1990"},{"key":"10.1016\/S0169-7161(05)80132-4_bib51","series-title":"Introduction of Dynamic Programming","author":"Nemhauser","year":"1966"},{"key":"10.1016\/S0169-7161(05)80132-4_bib52","series-title":"Integer and Combinatorial Optimization","author":"Nemhauser","year":"1988"},{"key":"10.1016\/S0169-7161(05)80132-4_bib53","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0167-6377(82)90014-1","article-title":"An upper bound on number of cuts needed in Gomory's method of integer forms","volume":"1","author":"Nourie","year":"1982","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0169-7161(05)80132-4_bib54","author":"Padberg","year":"1988","journal-title":"Facets of the quadratic polytope"},{"key":"10.1016\/S0169-7161(05)80132-4_bib55","series-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/S0169-7161(05)80132-4_bib56","series-title":"Topics in Parallel Computing in Mathematical Programming","author":"Pardalos","year":"1993"},{"key":"10.1016\/S0169-7161(05)80132-4_bib57","series-title":"Impacts of Recent Computer Advances on Operations Research","first-page":"131","article-title":"Parallel branch and bound algorithms for unconstrained quadratic zero-one programming","author":"Pardalos","year":"1989"},{"key":"10.1016\/S0169-7161(05)80132-4_bib58","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF02023057","article-title":"Parallel branch and bound algorithms for quadratic zero-one programming on a hypercube architecture","volume":"22","author":"Pardalos","year":"1990","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0169-7161(05)80132-4_bib59","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF02247879","article-title":"Computational aspects of a branch-and-bound algorithm for quadratic zero-one programming","volume":"45","author":"Pardalos","year":"1990","journal-title":"Computing"},{"issue":"3","key":"10.1016\/S0169-7161(05)80132-4_bib60","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1137\/1028106","article-title":"Global concave minimization: A bibliographic survey","volume":"28","author":"Pardalos","year":"1986","journal-title":"SIAM Rev."},{"key":"10.1016\/S0169-7161(05)80132-4_bib61","article-title":"Constrained Global Optimization: Algorithms and Applications","volume":"Vol. 268","author":"Pardalos","year":"1987"},{"key":"10.1016\/S0169-7161(05)80132-4_bib62","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1080\/00207168808803631","article-title":"Reduction of nonlinear integer separable programming problems","volume":"24","author":"Pardalos","year":"1988","journal-title":"Internat. J. Comput. Math."},{"key":"10.1016\/S0169-7161(05)80132-4_bib63","first-page":"23","article-title":"Parallel branch-and-bound algorithms for combinatorial optimization","volume":"39","author":"Pardalos","year":"1990","journal-title":"Supercomputer"},{"key":"10.1016\/S0169-7161(05)80132-4_bib64","series-title":"Discrete Optimization","author":"Parker","year":"1988"},{"key":"10.1016\/S0169-7161(05)80132-4_bib65","series-title":"Integer Programming and Related Areas. A Classified Biliography 1978\u20131981","volume":"Vol. 197","year":"1982"},{"key":"10.1016\/S0169-7161(05)80132-4_bib66","series-title":"Integer Programming and Related Areas. A Classified Bibliography 1981\u20131984","volume":"Vol. 243","year":"1985"},{"key":"10.1016\/S0169-7161(05)80132-4_bib67","series-title":"Integer Programming and Related Areas. A Classified Bibliography 1984\u20131987","volume":"Vol. 346","year":"1990"},{"key":"10.1016\/S0169-7161(05)80132-4_bib68","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1080\/01621459.1971.10482319","article-title":"Cluster analysis and mathematical programming","volume":"66","author":"Rao","year":"1971","journal-title":"J. Amer. Statist. Assoc."},{"key":"10.1016\/S0169-7161(05)80132-4_bib69","first-page":"95","article-title":"0\u20131 optimization and nonlinear programming","volume":"6","author":"Rosenberg","year":"1972","journal-title":"Rev. Fran\u00e7. Automat., Inform. Rech. Op\u00e9r."},{"issue":"15","key":"10.1016\/S0169-7161(05)80132-4_bib70","first-page":"721","article-title":"A variant of pseudo-Boolean Programming","volume":"XVIII","author":"Rosenberg","year":"1973","journal-title":"Rev. Roumaine Math. Pures Appl."},{"key":"10.1016\/S0169-7161(05)80132-4_bib71","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1137\/0206041","article-title":"An analysis of several heuristics for the traveling salesman problem","volume":"6","author":"Rosenkrantz","year":"1977","journal-title":"J. SIAM Comput."},{"key":"10.1016\/S0169-7161(05)80132-4_bib72","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1287\/opre.35.1.45","article-title":"Solving mixed integer programming problems using automatic reformation","volume":"35","author":"Roy","year":"1987","journal-title":"Oper. Res."},{"key":"10.1016\/S0169-7161(05)80132-4_bib73","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BF02340026","article-title":"Axiomatization of certain problems of minimization","volume":"20","author":"Rudeanu","year":"1967","journal-title":"Studia Logica"},{"key":"10.1016\/S0169-7161(05)80132-4_bib74","first-page":"13","article-title":"Programmation bivalente \u00e0 plusieurs fonctions \u00e9conomiques","volume":"3","author":"Rudeanu","year":"1969","journal-title":"Rev. Fran\u00e7. Inform. Rech. Op\u00e9r"},{"key":"10.1016\/S0169-7161(05)80132-4_bib75","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF00927949","article-title":"Irredundant optimization of a pseudo-Boolean function","volume":"4","author":"Rudeanu","year":"1969","journal-title":"J. Optim. Theory Appl."},{"issue":"22","key":"10.1016\/S0169-7161(05)80132-4_bib76","first-page":"403","article-title":"An axiomatic approach to pseudo-Boolean programming. I","volume":"7","author":"Rudeanu","year":"1970","journal-title":"Math. Vestnik"},{"key":"10.1016\/S0169-7161(05)80132-4_bib77","series-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1986"},{"key":"10.1016\/S0169-7161(05)80132-4_bib78","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1287\/opre.15.6.1171","article-title":"Reduction of integer polynomial programming to zero-one linear programming problems","volume":"15","author":"Watters","year":"1967","journal-title":"Oper. Res."},{"issue":"B","key":"10.1016\/S0169-7161(05)80132-4_bib79","first-page":"213","article-title":"A simplified primal (all-integer) integer programming algorithm","volume":"69","author":"Young","year":"1968","journal-title":"J. Res. Nat. Bur. Standards"},{"key":"10.1016\/S0169-7161(05)80132-4_bib80","first-page":"29","article-title":"Algorithms for nonlinear pseudo-Boolean programming","volume":"16","author":"Zak","year":"1978","journal-title":"Engrg. Cybernet."},{"key":"10.1016\/S0169-7161(05)80132-4_bib81","first-page":"30","article-title":"Media selection by decision programming","volume":"5","author":"Zangwill","year":"1965","journal-title":"J. Advert. Res."}],"container-title":["Handbook of Statistics","Computational Statistics"],"original-title":[],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T21:54:33Z","timestamp":1548539673000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0169716105801324"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"references-count":81,"URL":"https:\/\/doi.org\/10.1016\/s0169-7161(05)80132-4","relation":{},"ISSN":["0169-7161"],"issn-type":[{"value":"0169-7161","type":"print"}],"subject":[],"published":{"date-parts":[[1993]]}}}