{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T08:26:10Z","timestamp":1768983970849,"version":"3.49.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2016,10,31]],"date-time":"2016-10-31T00:00:00Z","timestamp":1477872000000},"content-version":"unspecified","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":[[2017,7]]},"DOI":"10.1007\/s10107-016-1079-2","type":"journal-article","created":{"date-parts":[[2016,10,31]],"date-time":"2016-10-31T06:04:12Z","timestamp":1477893852000},"page":"129-155","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Tight MIP formulations for bounded up\/down times and interval-dependent start-ups"],"prefix":"10.1007","volume":"164","author":[{"given":"Maurice","family":"Queyranne","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5330-6239","authenticated-orcid":false,"given":"Laurence A.","family":"Wolsey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,10,31]]},"reference":[{"key":"1079_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-11008-0","volume-title":"Integer Programming","author":"M Conforti","year":"2014","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Integer Programming. Springer, New York (2014)"},{"key":"1079_CR2","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s10107-015-0919-9","volume":"158","author":"P Damc\u0131-Kurt","year":"2016","unstructured":"Damc\u0131-Kurt, P., K\u00fc\u00e7\u00fckyavuz, S., Rajan, D., Atamt\u00fcrk, A.: A polyhedral study of ramping in unit commitment. Math. Program. Ser. A 158, 175\u2013206 (2016)","journal-title":"Math. Program. Ser. A"},{"issue":"4","key":"1079_CR3","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1287\/opre.1060.0309","volume":"54","author":"A Frangioni","year":"2006","unstructured":"Frangioni, A., Gentile, C.: Solving nonlinear single-unit commitment problems with ramping constraints. Oper. Res. 54(4), 767\u2013775 (2006)","journal-title":"Oper. Res."},{"key":"1079_CR4","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, 105\u2013113 (2009)","journal-title":"IEEE Trans. Power Syst."},{"issue":"3","key":"1079_CR5","first-page":"730","volume":"81","author":"LL Garver","year":"1963","unstructured":"Garver, L.L.: Power generation scheduling by integer programming\u2013development of theory, power apparatus and systems. III Trans. Am. Inst. Electr. Eng. 81(3), 730\u2013734 (1963)","journal-title":"III Trans. Am. Inst. Electr. Eng."},{"key":"1079_CR6","unstructured":"Hedman, K.W., O\u2019Neill, R.P., Oren, S.S.: Analyzing valid inequalities of the generation unit commitment problem. In: Power Systems Conference and Exposition, 2009 PSCE \u201909. IEEE\/PES, pp. 1\u20136 (2009)"},{"key":"1079_CR7","unstructured":"Knueven, B., Ostrowski, J., Wang, J.: Generating cuts from the ramping polytope for the unit commitment problem Department of Industrial and Systems Engineering University of Tennessee(2016)"},{"key":"1079_CR8","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.disopt.2003.12.001","volume":"1","author":"J Lee","year":"2004","unstructured":"Lee, J., Leung, J., Margot, F.: Min-up\/min-down polytopes. Discrete Optim. 1, 77\u201385 (2004)","journal-title":"Discrete Optim."},{"key":"1079_CR9","unstructured":"Malkin, P.: Minimum runtime and stoptime polyhedra. In: Working Paper, Core, Universit\u00e9 catholique de Louvain (2003)"},{"key":"1079_CR10","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/s10107-010-0378-2","volume":"24","author":"M Martens","year":"2010","unstructured":"Martens, M., McCormick, S.T., Queyranne, M.: Separation, dimension, and facet algorithms for node flow polyhedra. Math. Program. Ser. B 24, 317\u2013348 (2010)","journal-title":"Math. Program. Ser. B"},{"issue":"4","key":"1079_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00291-015-0400-4","volume":"37","author":"G Morales-Espa\u00f1a","year":"2015","unstructured":"Morales-Espa\u00f1a, G., Gentile, C., Ramos, A.: Tight MIP formulations of the power-based unit commitment problem. OR Spectr. 37(4), 1\u201322 (2015)","journal-title":"OR Spectr."},{"key":"1079_CR12","doi-asserted-by":"crossref","first-page":"4897","DOI":"10.1109\/TPWRS.2013.2251373","volume":"28","author":"G Morales-Espa\u00f1a","year":"2013","unstructured":"Morales-Espa\u00f1a, G., Latorre, J.M., Ramos, A.: Tight and compact MILP formulation for the thermal unit commitment problem. IEEE Trans. Power Syst. 28, 4897\u20134908 (2013)","journal-title":"IEEE Trans. Power Syst."},{"key":"1079_CR13","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"GL Nemhauser","year":"1988","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)"},{"issue":"27","key":"1079_CR14","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1109\/TPWRS.2011.2162008","volume":"1","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. 1(27), 39\u201346 (2012)","journal-title":"IEEE Trans. Power Syst."},{"key":"1079_CR15","unstructured":"Pan, K., Guan, Y.: A Polyhedral Study of the Integrated Minimum-Up\/Down Time and Ramping Polytope. http:\/\/www.optimization-online.org\/DB_HTML\/2015\/08\/5070.html (2015)"},{"key":"1079_CR16","volume-title":"Production Planning by Mixed Integer Programming","author":"Y Pochet","year":"2006","unstructured":"Pochet, Y., Wolsey, L.A.: Production Planning by Mixed Integer Programming. Springer, New York (2006)"},{"key":"1079_CR17","unstructured":"Queyranne, M., Wolsey, L.A.: Modeling poset convex subsets. In: Cologne-Twente Workshop, Istanbul (2015)"},{"key":"1079_CR18","unstructured":"Rajan, D., and Takriti, S.: Minimum up\/down polytopes of the unit commitment problem with start-up costs. IBM Res. Rep. RC23628 (W0506-050), Thomas J. Watson Research Center, Yorktown Heights, NY (2005)"},{"key":"1079_CR19","doi-asserted-by":"crossref","first-page":"997","DOI":"10.1016\/j.ijepes.2012.08.046","volume":"44","author":"A Viana","year":"2013","unstructured":"Viana, A., Pedroso, J.P.: A new MILP-based approach for unit commitment in power production planning. Electr. Power Energy Syst. 44, 997\u20131005 (2013)","journal-title":"Electr. Power Energy Syst."},{"key":"1079_CR20","volume-title":"Integer Programming","author":"LA Wolsey","year":"1998","unstructured":"Wolsey, L.A.: Integer Programming. Wiley, New York (1998)"},{"key":"1079_CR21","doi-asserted-by":"crossref","first-page":"2581","DOI":"10.1109\/TPWRS.2011.2148370","volume":"26","author":"L Wu","year":"2011","unstructured":"Wu, L.: A tighter piecewise linear approximation of quadratic cost curves for unit commitment problems. IEEE Trans. Power Syst. 26, 2581\u20132583 (2011)","journal-title":"IEEE Trans. Power Syst."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-016-1079-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1079-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1079-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T22:26:00Z","timestamp":1498343160000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-016-1079-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,31]]},"references-count":21,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["1079"],"URL":"https:\/\/doi.org\/10.1007\/s10107-016-1079-2","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,10,31]]}}}