{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:48:15Z","timestamp":1725515295812},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540727910"},{"type":"electronic","value":"9783540727927"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72792-7_16","type":"book-chapter","created":{"date-parts":[[2007,6,25]],"date-time":"2007-06-25T12:07:11Z","timestamp":1182773231000},"page":"197-209","source":"Crossref","is-referenced-by-count":1,"title":["On a Generalization of the Master Cyclic Group Polyhedron"],"prefix":"10.1007","author":[{"given":"Sanjeeb","family":"Dash","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ricardo","family":"Fukasawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oktay","family":"G\u00fcnl\u00fck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Araoz, J.: Polyhedral Neopolarities. Phd thesis, University of Waterloo, Department of Computer Sciences (1974)","key":"16_CR1"},{"issue":"2","key":"16_CR2","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s10107-003-0390-x","volume":"96","author":"J. Araoz","year":"2003","unstructured":"Araoz, J., Evans, L., Gomory, R.E., Johnson, E.: Cyclic group and knapsack facets. Mathematical Programming Ser. B\u00a096(2), 377\u2013408 (2003)","journal-title":"Mathematical Programming Ser. B"},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1137\/0134010","volume":"34","author":"E. Balas","year":"1978","unstructured":"Balas, E., Zemel, E.: Facets of the knapsack polytope from minimal covers. SIAM Journal of Applied Mathematics\u00a034, 119\u2013148 (1978)","journal-title":"SIAM Journal of Applied Mathematics"},{"unstructured":"Dash, S., G\u00fcnl\u00fck, O.: On the strength of gomory mixed-integer cuts as group cuts. Technical Report RC23967, IBM Research Division, Yorktown Heights, NY (2006)","key":"16_CR4"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10107-005-0599-y","volume":"105","author":"S. Dash","year":"2006","unstructured":"Dash, S., G\u00fcnl\u00fck, O.: Valid inequalities based on simple mixed-integer sets. Mathematical Programming\u00a0105, 29\u201353 (2006)","journal-title":"Mathematical Programming"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s10107-005-0600-9","volume":"106","author":"S. Dash","year":"2006","unstructured":"Dash, S., G\u00fcnl\u00fck, O.: Valid inequalities based on the interpolation procedure. Mathematical Programming\u00a0106, 111\u2013136 (2006)","journal-title":"Mathematical Programming"},{"doi-asserted-by":"crossref","unstructured":"Fischetti, M., Monaci, M.: How tight is the corner relaxation? Discrete Optimization, To appear (2007)","key":"16_CR7","DOI":"10.1016\/j.disopt.2006.11.010"},{"issue":"1","key":"16_CR8","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s10107-006-0726-4","volume":"109","author":"M. Fischetti","year":"2007","unstructured":"Fischetti, M., Saturni, C.: Mixed-integer cuts from cyclic groups. Mathematical Programming A\u00a0109(1), 27\u201353 (2007)","journal-title":"Mathematical Programming A"},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/0024-3795(69)90017-2","volume":"2","author":"R. Gomory","year":"1969","unstructured":"Gomory, R.: Some polyhedra related to combinatorial problems. Journal of Linear Algebra and its Applications\u00a02, 451\u2013558 (1969)","journal-title":"Journal of Linear Algebra and its Applications"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF01584976","volume":"3","author":"R. Gomory","year":"1972","unstructured":"Gomory, R., Johnson, E.: Some continuous functions related to corner polyhedra I. Mathematical Programming\u00a03, 23\u201385 (1972)","journal-title":"Mathematical Programming"},{"key":"16_CR11","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/BF01585008","volume":"3","author":"R. Gomory","year":"1972","unstructured":"Gomory, R., Johnson, E.: Some continuous functions related to corner polyhedra II. Mathematical Programming\u00a03, 359\u2013389 (1972)","journal-title":"Mathematical Programming"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s10107-003-0389-3","volume":"96","author":"R. Gomory","year":"2003","unstructured":"Gomory, R., Johnson, E.: T-space and cutting planes. Mathematical Programming\u00a096, 341\u2013375 (2003)","journal-title":"Mathematical Programming"},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s10107-003-0388-4","volume":"96","author":"R. Gomory","year":"2003","unstructured":"Gomory, R., Johnson, E., Evans, L.: Cyclic group and knapsack facets. Mathematical Programming\u00a096, 321\u2013339 (2003)","journal-title":"Mathematical Programming"},{"unstructured":"Uchoa, E.: Robust branch-and-cut-and-price for the CMST problem and extended capacity cuts. Presentation in the MIP 2005 Workshop, Minneapolis (2005), Available at http:\/\/www.ima.umn.edu\/matter\/W7.25-29.05\/activities\/Uchoa-Eduardo\/cmst-ecc-IMA.pdf","key":"16_CR14"},{"doi-asserted-by":"crossref","unstructured":"Uchoa, E., Fukasawa, R., Lysgaard, J., Pessoa, A., Poggi de Arag\u00e3o, M., Andrade, D.: Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation. Mathematical Programming, To appear","key":"16_CR15","DOI":"10.1007\/s10107-006-0043-y"},{"key":"16_CR16","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1287\/opre.24.2.367","volume":"24","author":"L. Wolsey","year":"1976","unstructured":"Wolsey, L.: Facets and strong valid inequalities for integer programs. Oper. Res.\u00a024, 367\u2013372 (1976)","journal-title":"Oper. Res."},{"key":"16_CR17","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1023\/A:1009841107478","volume":"4","author":"G. Nemhauser","year":"2000","unstructured":"Nemhauser, G., Gu, Z., Savelsbergh, M.: Sequence independent lifting in mixed integer programming. J. Comb. Optim.\u00a04, 109\u2013129 (2000)","journal-title":"J. Comb. Optim."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72792-7_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:05:19Z","timestamp":1605762319000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72792-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540727910","9783540727927"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72792-7_16","relation":{},"subject":[]}}