{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:29Z","timestamp":1740122429274,"version":"3.37.3"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,3,29]],"date-time":"2021-03-29T00:00:00Z","timestamp":1616976000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,3,29]],"date-time":"2021-03-29T00:00:00Z","timestamp":1616976000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2021,8]]},"DOI":"10.1007\/s10898-021-01012-3","type":"journal-article","created":{"date-parts":[[2021,3,29]],"date-time":"2021-03-29T06:02:17Z","timestamp":1616997737000},"page":"805-840","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Generalizing 0-1 conflict hypergraphs and mixed conflict graphs: mixed conflict hypergraphs in discrete optimization"],"prefix":"10.1007","volume":"80","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4076-7532","authenticated-orcid":false,"given":"Andriy","family":"Shapoval","sequence":"first","affiliation":[]},{"given":"Eva K.","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,3,29]]},"reference":[{"key":"1012_CR1","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s101070000154.","volume":"89","author":"A Atamturk","year":"2000","unstructured":"Atamturk, A., Nemhauser, G.L., Savelsbergh, M.W.P.: The mixed vertex packing problem. Math. Program. Seria A 89, 35\u201353 (2000)","journal-title":"Math. Program. Seria A"},{"key":"1012_CR2","first-page":"335","volume":"46","author":"R Bixby","year":"1994","unstructured":"Bixby, R., Lee, E.K.: Solving a truck dispatching scheduling problem using branch-and-cut. Oper. Res. 46, 335\u2013367 (1994)","journal-title":"Oper. Res."},{"key":"1012_CR3","volume-title":"Introduction to Algorithms","author":"T Cormen","year":"2001","unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"key":"1012_CR4","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1287\/opre.31.5.803","volume":"31","author":"H Crowder","year":"1983","unstructured":"Crowder, H., Johnson, E.L., Padberg, M.: Solving large scale zero-one linear programming problems. Oper. Res. 31, 803\u2013834 (1983)","journal-title":"Oper. Res."},{"key":"1012_CR5","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10107-003-0401-y","volume":"98","author":"T Easton","year":"2003","unstructured":"Easton, T., Hooker, K., Lee, E.K.: Facets of the independent set polytope. Math. Program. Seria B 98, 177\u2013199 (2003)","journal-title":"Math. Program. Seria B"},{"key":"1012_CR6","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1287\/moor.12.3.451","volume":"12","author":"R Euler","year":"1987","unstructured":"Euler, R., Junger, M., Reinelt, G.: Generalizations of cliques, odd cycles and anticycles and their relation to independence system polyhedra. Math. Oper. Res. 12, 451\u2013462 (1987)","journal-title":"Math. Oper. Res."},{"key":"1012_CR7","doi-asserted-by":"crossref","unstructured":"Johnson, E.L.: Modelling and strong linear programs for mixed integer programming. In: S. Wallace (ed.) Algorithms and model formulations in Mathematical Programming, NATO ASI Series, Vol. 51, pp. 1\u201343. Springer (1989)","DOI":"10.1007\/978-3-642-83724-1_1"},{"key":"1012_CR8","unstructured":"Lee, E.K.: Solving structured 0\/1 Integer Programming problems arising from truck dispatching scheduling problems. Ph.D. thesis, Rice University (1993)"},{"key":"1012_CR9","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s10898-007-9223-4","volume":"43","author":"A Lundell","year":"2009","unstructured":"Lundell, A., Westerlund, J., Westerlund, T.: Some transformation techniques with applications in global optimization. J. Glob. Optim. 43, 391\u2013405 (2009)","journal-title":"J. Glob. Optim."},{"key":"1012_CR10","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BF01097059","volume":"7","author":"C Maranas","year":"1995","unstructured":"Maranas, C., Floudas, C.: Finding all solutions of nonlinearly constrained systems of equations. J. Glob. Optim. 7, 143\u2013182 (1995)","journal-title":"J. Glob. Optim."},{"key":"1012_CR11","unstructured":"PORTA - POlyhedron Representation Transformation Algorithm. http:\/\/porta.zib.de\/"},{"key":"1012_CR12","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0166-218X(86)90061-2","volume":"14","author":"T Van Roy","year":"1986","unstructured":"Van Roy, T., Wolsey, L.: Valid inequalities for mixed 0\u20131 program. Discrete Appl. Math. 14, 199\u2013213 (1986)","journal-title":"Discrete Appl. Math."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01012-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-021-01012-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01012-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,17]],"date-time":"2021-07-17T08:10:38Z","timestamp":1626509438000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-021-01012-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,29]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,8]]}},"alternative-id":["1012"],"URL":"https:\/\/doi.org\/10.1007\/s10898-021-01012-3","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2021,3,29]]},"assertion":[{"value":"21 September 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 March 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 March 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}