{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T16:35:57Z","timestamp":1732034157635},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,4,20]],"date-time":"2012-04-20T00:00:00Z","timestamp":1334880000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2012,9]]},"DOI":"10.1007\/s12532-012-0039-y","type":"journal-article","created":{"date-parts":[[2012,4,19]],"date-time":"2012-04-19T07:50:08Z","timestamp":1334821808000},"page":"239-273","source":"Crossref","is-referenced-by-count":64,"title":["Cutting plane versus compact formulations for uncertain (integer) linear programs"],"prefix":"10.1007","volume":"4","author":[{"given":"Matteo","family":"Fischetti","sequence":"first","affiliation":[]},{"given":"Michele","family":"Monaci","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,4,20]]},"reference":[{"key":"39_CR1","unstructured":"Achterberg, T.: Constraint Integer Programming. Ph.D. thesis, ZIB, Technische Universit\u00e4t Berlin (2007)"},{"key":"39_CR2","unstructured":"Balas, E.: A class of location, distribution and scheduling problems: modeling and solution methods. In: Proc. Chinese-US Symposium on System Analysis. Wiley, New York (1983)"},{"key":"39_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-6377(99)00016-4","volume":"25","author":"A. Ben-Tal","year":"1999","unstructured":"Ben-Tal A., Nemirovski A.: Robust solutions to uncertain linear programs. Oper. Res. Lett. 25, 1\u201313 (1999)","journal-title":"Oper. Res. Lett."},{"key":"39_CR4","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/PL00011380","volume":"88","author":"A. Ben-Tal","year":"2000","unstructured":"Ben-Tal A., Nemirovski A.: Robust solutions of linear programming problems contaminated with uncertain data. Math. Progr. 88, 411\u2013424 (2000)","journal-title":"Math. Progr."},{"key":"39_CR5","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/s101070100286","volume":"92","author":"A. Ben-Tal","year":"2002","unstructured":"Ben-Tal A., Nemirovski A.: Robust optimization\u2014methodology and applications. Math. Progr. 92, 453\u2013480 (2002)","journal-title":"Math. Progr."},{"key":"39_CR6","doi-asserted-by":"crossref","first-page":"956","DOI":"10.1287\/opre.50.6.956.345","volume":"50","author":"P. Beraldi","year":"2002","unstructured":"Beraldi P., Ruszczy\u0144ski A.: The probabilistic set-covering problem. Oper. Res. 50, 956\u2013967 (2002)","journal-title":"Oper. Res."},{"key":"39_CR7","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10107-003-0396-4","volume":"98","author":"D. Bertsimas","year":"2003","unstructured":"Bertsimas D., Sim M.: Robust discrete optimization and network flows. Math. Progr. 98, 49\u201371 (2003)","journal-title":"Math. Progr."},{"key":"39_CR8","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"D. Bertsimas","year":"2004","unstructured":"Bertsimas D., Sim M.: The price of robustness. Oper. Res. 52, 35\u201353 (2004)","journal-title":"Oper. Res."},{"key":"39_CR9","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1023\/A:1019225027893","volume":"98","author":"A. Caprara","year":"2000","unstructured":"Caprara A., Fischetti M., Toth P.: Algorithms for the set covering problem. Ann. Oper. Res. 98, 353\u2013371 (2000)","journal-title":"Ann. Oper. Res."},{"key":"39_CR10","first-page":"125","volume":"79","author":"A. Caprara","year":"1997","unstructured":"Caprara A., Fischetti M., Toth P., Vigo D., Guida P.L.: Algorithms for railway crew management. Math. Progr. 79, 125\u2013141 (1997)","journal-title":"Math. Progr."},{"key":"39_CR11","first-page":"215","volume":"81","author":"S. Ceria","year":"1998","unstructured":"Ceria S., Nobili P., Sassano A.: A lagrangian-based heuristic for large-scale set covering problems. Math. Progr. 81, 215\u2013228 (1998)","journal-title":"Math. Progr."},{"key":"39_CR12","doi-asserted-by":"crossref","first-page":"1058","DOI":"10.1287\/opre.1070.0441","volume":"55","author":"X. Chen","year":"2007","unstructured":"Chen X., Sim M., Sun P.: A robust optimization perspective on stochastic programming. Oper. Res. 55, 1058\u20131071 (2007)","journal-title":"Oper. Res."},{"key":"39_CR13","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1287\/mnsc.26.5.495","volume":"26","author":"H. Crowder","year":"1980","unstructured":"Crowder H., Padberg M.W.: Solving large-scale symmetric travelling salesman problems to optimality. Manag. Sci. 26, 495\u2013509 (1980)","journal-title":"Manag. Sci."},{"key":"39_CR14","doi-asserted-by":"crossref","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In International Conference on Theory and Applications of Satisfiability Testing (SAT), LNCS, vol. 6. Springer, Berlin (2003)","DOI":"10.1007\/978-3-540-24605-3_37"},{"key":"39_CR15","first-page":"401","volume-title":"FORTRAN Codes for Network Optimization. Annals of Operational Research, vol. 13","author":"M. Fischetti","year":"1988","unstructured":"Fischetti M., Martello S.: A hybrid algorithm for finding the k-th smallest of n elements in O(n) time. In: Simeone, B., Toth, P., Gallo, G., Maffioli, F., Pallottino, S. (eds) FORTRAN Codes for Network Optimization. Annals of Operational Research, vol. 13, pp. 401\u2013419. JC Baltzer AG, Basel (1988)"},{"key":"39_CR16","doi-asserted-by":"crossref","unstructured":"Fischetti, M., Monaci, M.: Light robustness. In: Ahuja, R.K., Moehring, R., Zaroliagis, C. (eds.) Robust and Online Large-Scale Optimization, Lecture Notes in Computer Science, vol. 5868, pp. 61\u201384. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-05465-5_3"},{"key":"39_CR17","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1287\/opre.47.2.247","volume":"47","author":"M. Gamache","year":"1999","unstructured":"Gamache M., Soumis F., Marquis G., Desrosiers J.: A column generation approach for large-scale aircrew rostering problems. Oper. Res. 47, 247\u2013263 (1999)","journal-title":"Oper. Res."},{"key":"39_CR18","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey M., Johnson D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco (1979)"},{"key":"39_CR19","doi-asserted-by":"crossref","first-page":"1549","DOI":"10.1016\/j.dam.2006.10.007","volume":"155","author":"E. Goldberg","year":"2007","unstructured":"Goldberg E., Novikov Y.: Berkmin: a fast and robust sat-solver. Discrete Appl. Math. 155, 1549\u20131561 (2007)","journal-title":"Discrete Appl. Math."},{"key":"39_CR20","first-page":"233","volume-title":"Constraint and Integer Programming: Toward a Unified Methodology","author":"C. Gomes","year":"2003","unstructured":"Gomes C.: Complete randomized backtrack search. In: Milano, M. (ed) Constraint and Integer Programming: Toward a Unified Methodology, pp. 233\u2013283. Kluwer, Dordrecht (2003)"},{"key":"39_CR21","unstructured":"Gomes, C., Selman, B., Kautz, H.: Boosting combinatorial search through randomization. In: Proceedings of the 15th National Conference on Artificial Intelligence (AAAI-98). American Association for Artificial Intelligence (1998)"},{"key":"39_CR22","volume-title":"Handbook of Constraint Programming","author":"C. Gomes","year":"2006","unstructured":"Gomes C., Walsh T.: Randomness and structure. In: Rossi, F., van Beek, P., Walsh, T. (eds) Handbook of Constraint Programming, Elsevier, Amsterdam (2006)"},{"key":"39_CR23","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1137\/0403043","volume":"3","author":"M. Gr\u00f6tschel","year":"1990","unstructured":"Gr\u00f6tschel M., Monma C.L.: Integer polyhedra arising from certain network design problems with connectivity constraints. SIAM J. Discrete Math. 3, 502\u2013523 (1990)","journal-title":"SIAM J. Discrete Math."},{"key":"39_CR24","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1287\/opre.40.2.309","volume":"40","author":"M. Gr\u00f6tschel","year":"1992","unstructured":"Gr\u00f6tschel M., Monma C.L., Stoer M.: Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints. Oper. Res. 40, 309\u2013330 (1992)","journal-title":"Oper. Res."},{"key":"39_CR25","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1287\/opre.48.5.697.12411","volume":"48","author":"R.G. Haight","year":"2000","unstructured":"Haight R.G., Revelle C., Snyder S.A.: An integer optimization approach to a probabilistic reserve site selection problem. Oper. Res. 48, 697\u2013708 (2000)","journal-title":"Oper. Res."},{"key":"39_CR26","unstructured":"IBM ILOG CPLEX Optimizer. http:\/\/www-01.ibm.com\/software\/integration\/optimization\/cplex-optimizer\/"},{"key":"39_CR27","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s12532-009-0009-1","volume":"1","author":"F.K. Karzan","year":"2009","unstructured":"Karzan F.K., Nemhauser G.L., Savelsbergh M.W.P.: Information-based branching schemes for binary linear mixed integer problems. Math. Progr. Comput. 1, 249\u2013293 (2009)","journal-title":"Math. Progr. Comput."},{"key":"39_CR28","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0020-0190(93)90029-9","volume":"47","author":"M. Luby","year":"1993","unstructured":"Luby M., Sinclair A., Zuckerman D.: Optimal speedup of las vegas algorithms. Inf. Process. Lett. 47, 173\u2013180 (1993)","journal-title":"Inf. Process. Lett."},{"key":"39_CR29","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1287\/mnsc.45.3.414","volume":"45","author":"S. Martello","year":"1999","unstructured":"Martello S., Pisinger D., Toth P.: Dynamic programming and strong bounds for the 0-1 knapsack problem. Manag. Sci. 45, 414\u2013424 (1999)","journal-title":"Manag. Sci."},{"key":"39_CR30","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"S. Martello","year":"1990","unstructured":"Martello S., Toth P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, Chichester (1990)"},{"key":"39_CR31","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01585735","volume":"46","author":"C.L. Monma","year":"1990","unstructured":"Monma C.L., Munson B.S., Pulleyblank W.R.: Minimum-weight two-connected spanning networks. Math. Progr. 46, 153\u2013171 (1990)","journal-title":"Math. Progr."},{"key":"39_CR32","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: Proceedings of the 38th Annual Design Automation Conference, pp. 530\u2013535. ACM, New York (2001)","DOI":"10.1145\/378239.379017"},{"key":"39_CR33","unstructured":"ORLIB. http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/info.html"},{"key":"39_CR34","unstructured":"SCIP: Solving Constraint Integer Programs. http:\/\/scip.zib.de\/"},{"key":"39_CR35","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-008-0224-y","volume":"121","author":"A. Saxena","year":"2010","unstructured":"Saxena A., Goyal V., Lejeune M.: MIP reformulations of the probabilistic set covering problem. Math. Progr. 121, 1\u201331 (2010)","journal-title":"Math. Progr."},{"key":"39_CR36","doi-asserted-by":"crossref","first-page":"1154","DOI":"10.1287\/opre.21.5.1154","volume":"21","author":"A.L. Soyster","year":"1973","unstructured":"Soyster A.L.: Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper. Res. 21, 1154\u20131157 (1973)","journal-title":"Oper. Res."},{"key":"39_CR37","unstructured":"TSPLIB. http:\/\/comopt.ifi.uni-heidelberg.de\/software\/tsplib95\/"},{"key":"39_CR38","unstructured":"Williams, R., Gomes, C.P., Selman, B.: Backdoors to typical case complexity. In: Gottlob, G., Walsh, T. (eds) IJCAI-03, Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, pp. 1173\u20131178. Morgan Kaufmann, Waltham (2003)"}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-012-0039-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-012-0039-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-012-0039-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,27]],"date-time":"2019-06-27T14:34:01Z","timestamp":1561646041000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-012-0039-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4,20]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,9]]}},"alternative-id":["39"],"URL":"https:\/\/doi.org\/10.1007\/s12532-012-0039-y","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4,20]]}}}