{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T18:42:48Z","timestamp":1772822568573,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2006,4,25]],"date-time":"2006-04-25T00:00:00Z","timestamp":1145923200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2006,9]]},"DOI":"10.1007\/s10107-006-0709-5","type":"journal-article","created":{"date-parts":[[2006,4,25]],"date-time":"2006-04-25T16:15:59Z","timestamp":1145981759000},"page":"235-250","source":"Crossref","is-referenced-by-count":61,"title":["Strong Formulations of Robust Mixed 0\u20131 Programming"],"prefix":"10.1007","volume":"108","author":[{"given":"Alper","family":"Atamt\u00fcrk","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,4,25]]},"reference":[{"key":"709_CR1","unstructured":"Atamt\u00fcrk, A., Zhang, M.: Two-stage robust network flow and design under demand uncertainty. Research Report BCOL.04.03, University of California\u2013Berkeley, Dec 2004. Available at http:\/\/ieor.berkeley.edu\/~atamturk"},{"key":"709_CR2","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/PL00011424","volume":"90","author":"Averbakh","year":"2001","unstructured":"Averbakh, I.: On the complexity of a class for combinatorial optimization problems with uncertainty. Mathematical Programming 90, 263\u2013272 (2001)","journal-title":"Mathematical Programming"},{"key":"709_CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","volume":"5","author":"Balas","year":"1979","unstructured":"Balas, E.: Disjunctive programming. Annals of Discrete Mathematics 5, 3\u201351 (1979)","journal-title":"Annals of Discrete Mathematics"},{"key":"709_CR4","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s10107-003-0454-y","volume":"99","author":"Ben-Tal","year":"2004","unstructured":"Ben-Tal, A., Goryashko, A., Guslitzer, E., Nemirovski, A.: Adjustable robust solutions of uncertain linear programs. Mathematical Programming 99, 351\u2013376 (2004)","journal-title":"Mathematical Programming"},{"key":"709_CR5","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1287\/moor.23.4.769","volume":"23","author":"Ben-Tal","year":"1998","unstructured":"Ben-Tal, A., Nemirovski, A.: Robust convex optimization. Mathematics of Operations Research 23, 769\u2013805 (1998)","journal-title":"Mathematics of Operations Research"},{"key":"709_CR6","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1137\/S1052623401392354","volume":"13","author":"Ben-Tal","year":"2002","unstructured":"Ben-Tal, A., Nemirovski, A., Roos, C.: Robust solutions to uncertain quadratic and conic-quadratic problems. SIAM Journal on Optimization 13, 535\u2013560 (2002)","journal-title":"SIAM Journal on Optimization"},{"key":"709_CR7","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1016\/j.orl.2003.12.007","volume":"32","author":"Bertsimas","year":"2004","unstructured":"Bertsimas, D., Pachamanova, D., Sim, M.: Robust linear optimization under general norms. Operations Research Letters 32, 510\u2013526 (2004)","journal-title":"Operations Research Letters"},{"key":"709_CR8","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10107-003-0396-4","volume":"98","author":"Bertsimas","year":"2003","unstructured":"Bertsimas, D., Sim, M.: Robust discrete optimization and network flows. Mathematical Programming 98, 49\u201371 (2003)","journal-title":"Mathematical Programming"},{"key":"709_CR9","unstructured":"Bertsimas D., Sim, M.: Robust conic optimization. Manuscript, 2004"},{"key":"709_CR10","unstructured":"Bertsimas, D., Sim, M.: Robust discrete optimization under ellipsoid uncertainty sets. Manuscript, 2004"},{"key":"709_CR11","doi-asserted-by":"crossref","unstructured":"Bertsimas, D., Thiele, A.: A robust optimization approach to supply chain management. In Proceedings of IPCO X Conference, volume 3064 of Lecture Notes in Computer Science, pages 86\u2013100, 2004","DOI":"10.1007\/978-3-540-25960-2_7"},{"key":"709_CR12","unstructured":"Erdogan, E., Goldfarb, D., Iyengar, G.: Robust portfolio management. CORC Technical Report TR-2004-11, Columbia University, 2004"},{"key":"709_CR13","unstructured":"Erdogan, E., Iyengar, G.: Ambiguous chance constrained problems and robust optimization. CORC Technical Report TR-2004-10, Columbia University, 2004"},{"key":"709_CR14","unstructured":"Ghaoui, L.El., Lebret, H.: Robust solutions to least-squares problems with uncertain data. 18, 1035\u20131064 (1997)"},{"key":"709_CR15","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/S1052623496305717","volume":"9","author":"Ghaoui","year":"1998","unstructured":"Ghaoui, L.El., Oustry, F., Lebret, H.: Robust solutions to uncertain semidefinite programs. SIAM Journal on Optimization 9, 33\u201352 (1998)","journal-title":"SIAM Journal on Optimization"},{"key":"709_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.28.1.1.14260","volume":"28","author":"Goldfarb","year":"2003","unstructured":"Goldfarb, D., Iyengar, G.: Robust portfolio selection problems. Mathematics of Operations Research 28, 1\u201338 (2003)","journal-title":"Mathematics of Operations Research"},{"key":"709_CR17","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1, 169\u2013197 (1981)","journal-title":"Combinatorica"},{"key":"709_CR18","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0167-6377(01)00078-5","volume":"29","author":"Pinar","year":"2001","unstructured":"Pinar, M.C., Yaman, H., Karasan, O.E.: The robust minimum spanning tree problem with interval data. Operations Research Letters 29, 31\u201340 (2001)","journal-title":"Operations Research Letters"},{"key":"709_CR19","doi-asserted-by":"crossref","unstructured":"Kouvelis, P., Yu, G.: Robust discrete optimization and its applications. Kluwer Academic Publishers, Norwell, MA, 1997","DOI":"10.1007\/978-1-4757-2620-6"},{"key":"709_CR20","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/s10107-003-0397-3","volume":"98","author":"Wolsey","year":"2003","unstructured":"Miller A., Wolsey, L.A.: Tight formulations for some simple mixed integer programs and convex objective integer programs. Mathematical Programming 98, 73\u201388 (2003)","journal-title":"Mathematical Programming"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0709-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-006-0709-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0709-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:50:02Z","timestamp":1559123402000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-006-0709-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,4,25]]},"references-count":20,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2006,9]]}},"alternative-id":["709"],"URL":"https:\/\/doi.org\/10.1007\/s10107-006-0709-5","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,4,25]]}}}