Merve Bodur

Orcid: 0000-0002-9276-3755

Affiliations:
  • University of Edinburgh, School of Mathematics, UK
  • University of Toronto, Department of Mechanical and Industrial Engineering, Canada (former)


According to our database1, Merve Bodur authored at least 32 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A Branch-and-Price Algorithm Enhanced by Decision Diagrams for the Kidney Exchange Problem.
Manuf. Serv. Oper. Manag., 2024

Lagrangian Dual Decision Rules for Multistage Stochastic Mixed-Integer Programming.
Oper. Res., 2024

Leveraging decision diagrams to solve two-stage stochastic programs with binary recourse and logical linking constraints.
Eur. J. Oper. Res., 2024

A novel model for transfer synchronization in transit networks and a Lagrangian-based heuristic solution method.
Eur. J. Oper. Res., 2024

2023
Multistage stochastic fractionated intensity modulated radiation therapy planning.
Comput. Oper. Res., December, 2023

Optimization Helps Scheduling Nursing Staff at the Long-Term Care Homes of the City of Toronto.
INFORMS J. Appl. Anal., 2023

A Multiobjective Approach for Sector Duration Optimization in Stereotactic Radiosurgery Treatment Planning.
INFORMS J. Comput., 2023

Dynamic AGV Task Allocation in Intelligent Warehouses.
CoRR, 2023

Neural Approximate Dynamic Programming for the Ultra-fast Order Dispatching Problem.
CoRR, 2023

2022
Stochastic Last-Mile Delivery with Crowd-Shipping and Mobile Depots.
Transp. Sci., 2022

Constraint programming approaches for the discretizable molecular distance geometry problem.
Networks, 2022

Two-stage linear decision rules for multi-stage stochastic programming.
Math. Program., 2022

Decomposition of loosely coupled integer programs: a multiobjective perspective.
Math. Program., 2022

Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to Discretizable Distance Geometry Problems.
INFORMS J. Comput., 2022

Stochastic RWA and Lightpath Rerouting in WDM Networks.
INFORMS J. Comput., 2022

Inverse Mixed Integer Optimization: Polyhedral Insights and Trust Region Methods.
INFORMS J. Comput., 2022

Network Models for Multiobjective Discrete Optimization.
INFORMS J. Comput., 2022

On the impact of deep learning-based time-series forecasts on multistage stochastic programming policies.
INFOR Inf. Syst. Oper. Res., 2022

Tightening Quadratic Convex Relaxations for the AC Optimal Transmission Switching Problem.
CoRR, 2022

Generation expansion planning with revenue adequacy constraints.
Comput. Oper. Res., 2022

Digital Annealer for quadratic unconstrained binary optimization: A comparative performance analysis.
Appl. Soft Comput., 2022

Neur2SP: Neural Two-Stage Stochastic Programming.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021
Logic-Based Benders Decomposition and Binary Decision Diagram Based Approaches for Stochastic Distributed Operating Room Scheduling.
INFORMS J. Comput., 2021

2020
Time series sampling for probabilistic forecasting.
Proceedings of the CASCON '20: Proceedings of the 30th Annual International Conference on Computer Science and Software Engineering, Toronto, Ontario, Canada, November 10, 2020

2019
Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs.
SIAM J. Optim., 2019

2018
Integer programming formulations for minimum deficiency interval coloring.
Networks, 2018

Aggregation-based cutting-planes for packing and covering integer programs.
Math. Program., 2018

2017
Cutting planes from extended LP formulations.
Math. Program., 2017

Mixed-Integer Rounding Enhanced Benders Decomposition for Multiclass Service-System Staffing and Scheduling with Arrival Rate Uncertainty.
Manag. Sci., 2017

Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse.
INFORMS J. Comput., 2017

A new lift-and-project operator.
Eur. J. Oper. Res., 2017

2013
Decomposition algorithms for solving the minimum weight maximal matching problem.
Networks, 2013


  Loading...