☰

Merve Bodur - Publications

Affiliations: 
2015 Georgia Institute of Technology, Atlanta, GA 
Tree Info Similar researchers PubMed Report error

9 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2019 Bodur M, Pia AD, Dey SS, Molinaro MS. Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs Siam Journal On Optimization. 29: 55-76. DOI: 10.1137/17M1149985  0.445
2018 Bodur M, Luedtke JR. Two-stage linear decision rules for multi-stage stochastic programming Mathematical Programming. 1-34. DOI: 10.1007/S10107-018-1339-4  0.62
2018 Bodur M, Pia AD, Dey SS, Molinaro M, Pokutta S. Aggregation-based cutting-planes for packing and covering integer programs Mathematical Programming. 171: 331-359. DOI: 10.1007/S10107-017-1192-X  0.452
2018 Bodur M, Luedtke JR. Integer programming formulations for minimum deficiency interval coloring Networks. 72: 249-271. DOI: 10.1002/Net.21826  0.596
2017 Bodur M, Luedtke JR. Mixed-Integer Rounding Enhanced Benders Decomposition for Multiclass Service-System Staffing and Scheduling with Arrival Rate Uncertainty Management Science. 63: 2073-2091. DOI: 10.1287/Mnsc.2016.2455  0.606
2017 Bodur M, Dash S, Günlük O, Luedtke JR. Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse Informs Journal On Computing. 29: 77-91. DOI: 10.1287/Ijoc.2016.0717  0.603
2017 Bodur M, Dash S, Günlük O. A new lift-and-project operator European Journal of Operational Research. 257: 420-428. DOI: 10.1016/J.Ejor.2016.07.057  0.355
2016 Bodur M, Dash S, Günlük O. Cutting planes from extended LP formulations Mathematical Programming. 1-34. DOI: 10.1007/S10107-016-1005-7  0.381
2013 Bodur M, Ekim T, Taşkin ZC. Decomposition algorithms for solving the minimum weight maximal matching problem Networks. 62: 273-287. DOI: 10.1002/Net.21516  0.409
Show low-probability matches.