{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T13:14:31Z","timestamp":1648905271882},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,9,4]],"date-time":"2008-09-04T00:00:00Z","timestamp":1220486400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2009,2]]},"DOI":"10.1007\/s10479-008-0409-z","type":"journal-article","created":{"date-parts":[[2008,9,3]],"date-time":"2008-09-03T11:09:31Z","timestamp":1220440171000},"page":"203-222","source":"Crossref","is-referenced-by-count":0,"title":["Modelling either-or relations in integer programming"],"prefix":"10.1007","volume":"166","author":[{"given":"L. R.","family":"Foulds","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Toklu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. M.","family":"Wilson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,9,4]]},"reference":[{"key":"409_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","volume":"5","author":"E. Balas","year":"1979","unstructured":"Balas, E. (1979). Disjunctive programming. Annals of Discrete Mathematics, 5, 3\u201351.","journal-title":"Annals of Discrete Mathematics"},{"key":"409_CR2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0166-218X(98)00136-X","volume":"89","author":"E. Balas","year":"1998","unstructured":"Balas, E. (1998). Disjunctive programming: properties of the convex hull of feasible points. Discrete Applied Mathematics, 89, 3\u201344.","journal-title":"Discrete Applied Mathematics"},{"key":"409_CR3","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10479-005-3969-1","volume":"140","author":"E. Balas","year":"2005","unstructured":"Balas, E. (2005). Projection, lifting and extended formulation in integer and combinatorial optimization. Annals of Operations Research, 140, 125\u2013161.","journal-title":"Annals of Operations Research"},{"key":"409_CR4","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10107-002-0317-y","volume":"94","author":"E. Balas","year":"2003","unstructured":"Balas, E., & Perregaard, M. (2003). A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0\u20131 programming. Mathematical Programming B, 94, 221\u2013246.","journal-title":"Mathematical Programming B"},{"key":"409_CR5","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s10107-003-0432-4","volume":"99","author":"E. Balas","year":"2004","unstructured":"Balas, E., Bockmayr, A., Pisaruk, N., & Wolsey, L. (2004). On unions and dominants of polytopes. Mathematical Programming A, 99, 223\u2013240.","journal-title":"Mathematical Programming A"},{"key":"409_CR6","volume-title":"Logic-based 0\u20131 constraint programming","author":"P. Barth","year":"1995","unstructured":"Barth, P. (1995). Logic-based 0\u20131 constraint programming. Boston: Kluwer Academic."},{"key":"409_CR7","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/0377-2217(90)90419-C","volume":"48","author":"N. Beaumont","year":"1990","unstructured":"Beaumont, N. (1990). An algorithm for disjunctive programs. European Journal of Operational Research, 48, 362\u2013371.","journal-title":"European Journal of Operational Research"},{"key":"409_CR8","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1287\/ijoc.10.3.287","volume":"10","author":"A. Bockmayr","year":"1998","unstructured":"Bockmayr, A., & Kasper, T. (1998). Branch and infer: a unifying framework for integer and finite domain constraint programming. INFORMS Journal on Computing, 10, 287\u2013300.","journal-title":"INFORMS Journal on Computing"},{"key":"409_CR9","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1016\/j.rcim.2006.02.004","volume":"2","author":"T.-J. Chua","year":"2007","unstructured":"Chua, T.-J., Liu, M.-W., Wang, F.-Y., Yan, W.-J., & Cai, T.-X. (2007). An intelligent multi-constraint finite capacity-based lot release system for semiconductor backend assembly environment. Robotics and Computer-Integrated Manufacturing, 2, 326\u2013338.","journal-title":"Robotics and Computer-Integrated Manufacturing"},{"key":"409_CR10","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1287\/ijoc.11.2.205","volume":"11","author":"G. Cornuejols","year":"1999","unstructured":"Cornuejols, G., & Dawande, M. (1999). A class of small hard 0\u20131 programs. INFORMS Journal on Computing, 11, 205\u2013210.","journal-title":"INFORMS Journal on Computing"},{"key":"409_CR11","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/s10479-005-3974-4","volume":"140","author":"M. Guignard","year":"2005","unstructured":"Guignard, M., Johnson, E., & Spielberg, K. (2005). Logical processing for integer programming. Annals of Operations Research, 140, 263\u2013304.","journal-title":"Annals of Operations Research"},{"key":"409_CR12","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/S0166-218X(99)00100-6","volume":"96\u201397","author":"J. N. Hooker","year":"1999","unstructured":"Hooker, J. N., & Osorio, M. A. (1999). Mixed logical-linear programming. Discrete Applied Mathematics, 96\u201397, 395\u2013442.","journal-title":"Discrete Applied Mathematics"},{"key":"409_CR13","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0166-218X(87)90026-6","volume":"17","author":"R. Jeroslow","year":"1989","unstructured":"Jeroslow, R. (1989). Representability in mixed integer programming. Discrete Applied Mathematics, 17, 223\u2013243.","journal-title":"Discrete Applied Mathematics"},{"key":"409_CR14","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BFb0121015","volume":"22","author":"R. G. Jeroslow","year":"1985","unstructured":"Jeroslow, R. G., & Lowe, J. K. (1985a). Modeling with integer variables. Mathematical Programming Studies, 22, 167\u2013184.","journal-title":"Mathematical Programming Studies"},{"key":"409_CR15","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1057\/jors.1985.67","volume":"36","author":"R. G. Jeroslow","year":"1985","unstructured":"Jeroslow, R. G., & Lowe, J. K. (1985b). Experimental results on the new techniques for integer programming formulations. Journal of the Operational Research Society, 36, 393\u2013403.","journal-title":"Journal of the Operational Research Society"},{"key":"409_CR16","volume-title":"Business optimisation using mathematical programming","author":"J. Kallrath","year":"1997","unstructured":"Kallrath, J., & Wilson, J. M. (1997). Business optimisation using mathematical programming. London: Macmillan."},{"key":"409_CR17","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF02022101","volume":"21","author":"K. I. M. McKinnon","year":"1989","unstructured":"McKinnon, K. I. M., & Williams, H. P. (1989). Constructing integer programming models by the predicate calculus. Annals of Operations Research, 21, 227\u2013246.","journal-title":"Annals of Operations Research"},{"key":"409_CR18","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1016\/0377-2217(94)90308-5","volume":"72","author":"G. Mitra","year":"1994","unstructured":"Mitra, G., Lucas, C., Moody, S., & Hadjiconstantinou, E. (1994). Tools for reformulating logical forms into zero-one mixed integer programs (MIPS). European Journal of Operational Research, 72, 262\u2013276.","journal-title":"European Journal of Operational Research"},{"key":"409_CR19","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1016\/0098-1354(93)E0010-7","volume":"17","author":"R. Raman","year":"1994","unstructured":"Raman, R., & Grossman, I. E. (1994). Modeling and computational techniques for logic based integer programming. Computers and Chemical Engineering, 17, 563\u2013578.","journal-title":"Computers and Chemical Engineering"},{"key":"409_CR20","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1023\/A:1021105422248","volume":"115","author":"M. Sellmann","year":"2002","unstructured":"Sellmann, M., Zervoudakis, K., Stamatopoulos, P., & Fahle, T. (2002). Crew assignment via constraint programming: integrating column generation and heuristic tree search. Annals of Operations Research, 115, 207\u2013225.","journal-title":"Annals of Operations Research"},{"key":"409_CR21","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1057\/palgrave.jors.2602086","volume":"57","author":"A. Volgenant","year":"2006","unstructured":"Volgenant, A., & de Waal, A. A. (2006). A heuristic for multiple-feeder PCB manufacturing. Journal of the Operational Research Society, 57, 1134\u20131141.","journal-title":"Journal of the Operational Research Society"},{"key":"409_CR22","volume-title":"Model building in mathematical programming","author":"H. P. Williams","year":"1999","unstructured":"Williams, H. P. (1999). Model building in mathematical programming (4 ed.) Chichester: Wiley.","edition":"4"},{"key":"409_CR23","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1016\/S0377-2217(96)00236-6","volume":"100","author":"H. P. Williams","year":"1997","unstructured":"Williams, H. P., & Brailsford, S. C. (1997). The splitting of variables and constraints in the formulation of integer programming. European Journal of Operational Research, 100, 623\u2013628.","journal-title":"European Journal of Operational Research"},{"key":"409_CR24","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/s101070050061","volume":"85","author":"H. Yan","year":"1999","unstructured":"Yan, H., & Hooker, J. N. (1999). Tight representation of logical constraints as cardinality rules. Mathematical Programming, 85, 363\u2013378.","journal-title":"Mathematical Programming"},{"key":"409_CR25","doi-asserted-by":"crossref","first-page":"2135","DOI":"10.1016\/S0305-0548(02)00127-2","volume":"30","author":"H. Yan","year":"2003","unstructured":"Yan, H., Yu, Z., & Cheng, T. C. E. (2003). A strategic model for supply chain design with logical constraints: formulation and solution. Computers and Operations Research, 30, 2135\u20132155.","journal-title":"Computers and Operations Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0409-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-008-0409-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0409-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:07:49Z","timestamp":1559138869000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-008-0409-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,9,4]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,2]]}},"alternative-id":["409"],"URL":"https:\/\/doi.org\/10.1007\/s10479-008-0409-z","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,9,4]]}}}