{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,20]],"date-time":"2026-09-20T13:52:38Z","timestamp":1789912358981,"version":"4.0.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,9,6]],"date-time":"2014-09-06T00:00:00Z","timestamp":1409961600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1007\/s10107-014-0812-y","type":"journal-article","created":{"date-parts":[[2014,9,5]],"date-time":"2014-09-05T13:05:35Z","timestamp":1409922335000},"page":"99-129","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":35,"title":["Modified orbital branching for structured symmetry with an application to unit commitment"],"prefix":"10.1007","volume":"150","author":[{"given":"James","family":"Ostrowski","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Miguel F.","family":"Anjos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anthony","family":"Vannelli","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,9,6]]},"reference":[{"key":"812_CR1","doi-asserted-by":"crossref","unstructured":"Anjos, M.F.: Recent progress in modeling unit commitment problems. In: Zuluaga, L., Terlaky, T. (eds.) Modeling and Optimization: Theory and Applications: Selected Contributions from the MOPTA 2012 Conference, Springer Proceedings in Mathematics & Statistics, vol. 84. Springer (2013)","DOI":"10.1007\/978-1-4614-8987-0_1"},{"issue":"3","key":"812_CR2","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1109\/59.871739","volume":"15","author":"JM Arroyo","year":"2000","unstructured":"Arroyo, J.M., Conejo, A.J.: Optimal response of a thermal unit to an electricity spot market. IEEE Trans. Power Syst. 15(3), 1098\u20131104 (2000)","journal-title":"IEEE Trans. Power Syst."},{"issue":"3","key":"812_CR3","doi-asserted-by":"crossref","first-page":"1371","DOI":"10.1109\/TPWRS.2006.876672","volume":"21","author":"M Carrion","year":"2006","unstructured":"Carrion, M., Arroyo, J.: A computationally efficient mixed-integer linear formulation for the thermal unit commitment problem. IEEE Trans. Power Syst. 21(3), 1371\u20131378 (2006)","journal-title":"IEEE Trans. Power Syst."},{"key":"812_CR4","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1007\/s10107-005-0594-3","volume":"106","author":"A Frangioni","year":"2006","unstructured":"Frangioni, A., Gentile, C.: Perspective cuts for a class of convex 0\u20131 mixed integer programs. Math. Program. 106, 226\u2013236 (2006)","journal-title":"Math. Program."},{"issue":"1","key":"812_CR5","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1109\/TPWRS.2008.2004744","volume":"24","author":"A Frangioni","year":"2009","unstructured":"Frangioni, A., Gentile, C., Lacalandra, F.: Tighter approximated milp formulations for unit commitment problems. IEEE Trans. Power Syst. 24(1), 105\u2013113 (2009)","journal-title":"IEEE Trans. Power Syst."},{"key":"812_CR6","doi-asserted-by":"crossref","unstructured":"Friedman, E.J.: Fundamental domains for integer programs with symmetries. In: Dress, A.W.M., Xu, Y., Zhu, B. (eds.) Combinatorial Optimization and Applications, Lecture Notes in Computer Science, vol. 4616. Springer, pp. 146\u2013153 (2007)","DOI":"10.1007\/978-3-540-73556-4_17"},{"key":"812_CR7","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.jpaa.2003.12.011","volume":"192","author":"K Gattermann","year":"2004","unstructured":"Gattermann, K., Parrilo, P.: Symmetry groups, semidefinite programs, and sums of squares. J. Pure Appl. Algebra 192, 95\u2013128 (2004)","journal-title":"J. Pure Appl. Algebra"},{"key":"812_CR8","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF01580225","volume":"6","author":"R Jeroslow","year":"1974","unstructured":"Jeroslow, R.: Trivial integer programs unsolvable by branch-and-bound. Math. Program. 6, 105\u2013109 (1974)","journal-title":"Math. Program."},{"key":"812_CR9","doi-asserted-by":"crossref","unstructured":"Kaibel, V., Loos, A.: Branched polyhedral systems. In: IPCO 2010: The Fourteenth Conference on Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, vol. 6080. Springer, pp. 177\u2013190 (2010)","DOI":"10.1007\/978-3-642-13036-6_14"},{"issue":"4","key":"812_CR10","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1016\/j.disopt.2011.07.001","volume":"8","author":"V Kaibel","year":"2011","unstructured":"Kaibel, V., Peinhardt, M., Pfetsch, M.E.: Orbitopal fixing. Discret. Optim. 8(4), 595\u2013610 (2011)","journal-title":"Discret. Optim."},{"key":"812_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-006-0081-5","volume":"114","author":"V Kaibel","year":"2008","unstructured":"Kaibel, V., Pfetsch, M.: Packing and partitioning orbitopes. Math. Program. 114, 1\u201336 (2008)","journal-title":"Math. Program."},{"issue":"2","key":"812_CR12","first-page":"976","volume":"24","author":"C Liu","year":"2009","unstructured":"Liu, C., Shahidehpour, M., Li, Z., Fotuhi-Firuzabad, M.: Component and mode models for the short-term scheduling of combined-cycle units. IEEE Trans. Power Syst. 24(2), 976\u2013990 (2009)","journal-title":"IEEE Trans. Power Syst."},{"key":"812_CR13","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10107-002-0358-2","volume":"94","author":"F Margot","year":"2002","unstructured":"Margot, F.: Pruning by isomorphism in branch-and-cut. Math. Program. 94, 71\u201390 (2002)","journal-title":"Math. Program."},{"key":"812_CR14","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10107-003-0394-6","volume":"98","author":"F Margot","year":"2003","unstructured":"Margot, F.: Exploiting orbits in symmetric ILP. Math. Program. Ser. B 98, 3\u201321 (2003)","journal-title":"Math. Program. Ser. B"},{"key":"812_CR15","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1007\/978-3-540-68279-0_17","volume-title":"50 Years of Integer Programming 1958\u20132008","author":"F Margot","year":"2010","unstructured":"Margot, F.: Symmetry in integer linear programming. In: J\u00fcnger, M., Liebling, T.M., Naddef, D., Nemhauser, G.L., Pulleyblank, W.R., Reinelt, G., Rinaldi, G., Wolsey, L.A. (eds.) 50 Years of Integer Programming 1958\u20132008, pp. 647\u2013686. Springer, Berlin (2010)"},{"issue":"1","key":"812_CR16","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1109\/TPWRS.2011.2162008","volume":"27","author":"J Ostrowski","year":"2012","unstructured":"Ostrowski, J., Anjos, M.F., Vannelli, A.: Tight mixed integer linear programming formulations for the unit commitment problem. IEEE Trans. Power Syst. 27(1), 39\u201346 (2012)","journal-title":"IEEE Trans. Power Syst."},{"issue":"1","key":"812_CR17","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/s10107-009-0273-x","volume":"126","author":"J Ostrowski","year":"2009","unstructured":"Ostrowski, J., Linderoth, J., Rossi, F., Smriglio, S.: Orbital branching. Math. Program. 126(1), 147\u2013178 (2009)","journal-title":"Math. Program."},{"key":"812_CR18","unstructured":"Rajan, D., Takriti, S.: Minimum up\/down polytopes of the unit commitment problem with start-up costs. Tech. rep., IBM Research Report (2005)"},{"issue":"10","key":"812_CR19","doi-asserted-by":"crossref","first-page":"1396","DOI":"10.1287\/mnsc.47.10.1396.10265","volume":"47","author":"HD Sherali","year":"2001","unstructured":"Sherali, H.D., Smith, J.C.: Improving zero-one model representations via symmetry considerations. Manag. Sci. 47(10), 1396\u20131407 (2001)","journal-title":"Manag. Sci."},{"issue":"4","key":"812_CR20","doi-asserted-by":"crossref","first-page":"1250","DOI":"10.1109\/TPWRS.2002.805003","volume":"17","author":"Q Zhai","year":"2002","unstructured":"Zhai, Q., Guan, X., Cui, J.: Unit commitment with identical units successive subproblem solving method based on Lagrangian relaxation. IEEE Trans. Power Syst. 17(4), 1250\u20131257 (2002)","journal-title":"IEEE Trans. Power Syst."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-014-0812-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-014-0812-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-014-0812-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T14:22:01Z","timestamp":1565792521000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-014-0812-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,6]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["812"],"URL":"https:\/\/doi.org\/10.1007\/s10107-014-0812-y","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9,6]]}}}