default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMerve Bodur
Person information
- affiliation: University of Edinburgh, School of Mathematics, UK
- affiliation (former): University of Toronto, Department of Mechanical and Industrial Engineering, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j27]Moira MacNeil, Merve Bodur
:
Leveraging decision diagrams to solve two-stage stochastic programs with binary recourse and logical linking constraints. Eur. J. Oper. Res. 315(1): 228-241 (2024)- [j26]Zahra Ansarilari, Merve Bodur, Amer Shalaby:
A novel model for transfer synchronization in transit networks and a Lagrangian-based heuristic solution method. Eur. J. Oper. Res. 317(1): 76-91 (2024) - [j25]Maryam Daryalal, Merve Bodur, James R. Luedtke:
Lagrangian Dual Decision Rules for Multistage Stochastic Mixed-Integer Programming. Oper. Res. 72(2): 717-737 (2024) - [j24]Lizeth C. Riascos-Álvarez, Merve Bodur, Dionne M. Aleman:
A Branch-and-Price Algorithm Enhanced by Decision Diagrams for the Kidney Exchange Problem. Manuf. Serv. Oper. Manag. 26(2): 485-499 (2024) - 2023
- [j23]Merve Bodur, Mucahit Cevik, André A. Ciré, Mark Ruschin, Juyoung Wang:
Multistage stochastic fractionated intensity modulated radiation therapy planning. Comput. Oper. Res. 160: 106371 (2023) - [j22]Oylum Seker, Mucahit Cevik, Merve Bodur, Young Lee, Mark Ruschin:
A Multiobjective Approach for Sector Duration Optimization in Stereotactic Radiosurgery Treatment Planning. INFORMS J. Comput. 35(1): 248-264 (2023) - [j21]Manion Anderson, Merve Bodur, Scott Rathwell, Vahid Sarhangian:
Optimization Helps Scheduling Nursing Staff at the Long-Term Care Homes of the City of Toronto. INFORMS J. Appl. Anal. 53(2): 133-154 (2023) - [i8]Arash Dehghan, Mucahit Cevik, Merve Bodur:
Neural Approximate Dynamic Programming for the Ultra-fast Order Dispatching Problem. CoRR abs/2311.12975 (2023) - [i7]Arash Dehghan, Mucahit Cevik, Merve Bodur:
Dynamic AGV Task Allocation in Intelligent Warehouses. CoRR abs/2312.16026 (2023) - 2022
- [j20]Oylum Seker, Neda Tanoumand, Merve Bodur:
Digital Annealer for quadratic unconstrained binary optimization: A comparative performance analysis. Appl. Soft Comput. 127: 109367 (2022) - [j19]Cheng Guo, Merve Bodur, Dimitri J. Papageorgiou:
Generation expansion planning with revenue adequacy constraints. Comput. Oper. Res. 142: 105736 (2022) - [j18]Juyoung Wang, Mucahit Cevik, Merve Bodur:
On the impact of deep learning-based time-series forecasts on multistage stochastic programming policies. INFOR Inf. Syst. Oper. Res. 60(2): 133-164 (2022) - [j17]Moira MacNeil, Merve Bodur:
Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to Discretizable Distance Geometry Problems. INFORMS J. Comput. 34(1): 297-314 (2022) - [j16]David Bergman, Merve Bodur, Carlos Cardonha, André A. Ciré:
Network Models for Multiobjective Discrete Optimization. INFORMS J. Comput. 34(2): 990-1005 (2022) - [j15]Merve Bodur, Timothy C. Y. Chan, Ian Yihang Zhu:
Inverse Mixed Integer Optimization: Polyhedral Insights and Trust Region Methods. INFORMS J. Comput. 34(3): 1471-1488 (2022) - [j14]Maryam Daryalal, Merve Bodur:
Stochastic RWA and Lightpath Rerouting in WDM Networks. INFORMS J. Comput. 34(5): 2700-2719 (2022) - [j13]Merve Bodur, James R. Luedtke:
Two-stage linear decision rules for multi-stage stochastic programming. Math. Program. 191(1): 347-380 (2022) - [j12]Merve Bodur, Shabbir Ahmed, Natashia Boland, George L. Nemhauser:
Decomposition of loosely coupled integer programs: a multiobjective perspective. Math. Program. 196(1): 427-477 (2022) - [j11]Moira MacNeil, Merve Bodur:
Constraint programming approaches for the discretizable molecular distance geometry problem. Networks 79(4): 515-536 (2022) - [j10]Kianoush Mousavi, Merve Bodur, Matthew J. Roorda:
Stochastic Last-Mile Delivery with Crowd-Shipping and Mobile Depots. Transp. Sci. 56(3): 612-630 (2022) - [c2]Rahul Patel, Justin Dumouchelle, Elias B. Khalil, Merve Bodur:
Neur2SP: Neural Two-Stage Stochastic Programming. NeurIPS 2022 - [i6]Justin Dumouchelle, Rahul Patel, Elias B. Khalil, Merve Bodur:
Neur2SP: Neural Two-Stage Stochastic Programming. CoRR abs/2205.12006 (2022) - [i5]Cheng Guo, Harsha Nagarajan, Merve Bodur:
Tightening Quadratic Convex Relaxations for the AC Optimal Transmission Switching Problem. CoRR abs/2212.12097 (2022) - 2021
- [j9]Cheng Guo, Merve Bodur, Dionne M. Aleman, David R. Urbach:
Logic-Based Benders Decomposition and Binary Decision Diagram Based Approaches for Stochastic Distributed Operating Room Scheduling. INFORMS J. Comput. 33(4): 1551-1569 (2021) - [i4]Manion Anderson, Merve Bodur, Scott Rathwell, Vahid Sarhangian:
Optimization Helps Scheduling Nursing Staff at the Long-Term Care Homes of the City of Toronto. CoRR abs/2102.09461 (2021) - 2020
- [c1]Nicholas Prayogo, Mucahit Cevik, Merve Bodur:
Time series sampling for probabilistic forecasting. CASCON 2020: 153-162 - [i3]Oylum Seker, Neda Tanoumand, Merve Bodur:
Digital Annealer for quadratic unconstrained binary optimization: a comparative performance analysis. CoRR abs/2012.12264 (2020)
2010 – 2019
- 2019
- [j8]Merve Bodur, Alberto Del Pia, Santanu S. Dey, Marco S. Molinaro:
Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs. SIAM J. Optim. 29(1): 55-76 (2019) - [i2]Moira MacNeil, Merve Bodur:
Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to Discretizable Distance Geometry Problems. CoRR abs/1907.12468 (2019) - 2018
- [j7]Merve Bodur, Alberto Del Pia, Santanu S. Dey, Marco Molinaro, Sebastian Pokutta:
Aggregation-based cutting-planes for packing and covering integer programs. Math. Program. 171(1-2): 331-359 (2018) - [j6]Merve Bodur, James R. Luedtke:
Integer programming formulations for minimum deficiency interval coloring. Networks 72(2): 249-271 (2018) - [i1]David Bergman, Merve Bodur, Carlos Cardonha, André A. Ciré:
Network Models for Multiobjective Discrete Optimization. CoRR abs/1802.08637 (2018) - 2017
- [j5]Merve Bodur, Sanjeeb Dash, Oktay Günlük:
A new lift-and-project operator. Eur. J. Oper. Res. 257(2): 420-428 (2017) - [j4]Merve Bodur, Sanjeeb Dash, Oktay Günlük, James R. Luedtke:
Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse. INFORMS J. Comput. 29(1): 77-91 (2017) - [j3]Merve Bodur, James R. Luedtke:
Mixed-Integer Rounding Enhanced Benders Decomposition for Multiclass Service-System Staffing and Scheduling with Arrival Rate Uncertainty. Manag. Sci. 63(7): 2073-2091 (2017) - [j2]Merve Bodur, Sanjeeb Dash, Oktay Günlük:
Cutting planes from extended LP formulations. Math. Program. 161(1-2): 159-192 (2017) - 2013
- [j1]Merve Bodur, Tínaz Ekim, Z. Caner Taskin:
Decomposition algorithms for solving the minimum weight maximal matching problem. Networks 62(4): 273-287 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
