activity
20162023
most citedCopositive Duality for Discrete Markets and Games

6 citations · 13 across the 5 of their papers we have counts for

collaborators

7 papers

cs.CY2021

Optimization Helps Scheduling Nursing Staff at the Long-Term Care Homes of the City of Toronto

Manion Anderson, Merve Bodur, Scott Rathwell +1

The City of Toronto Long Term Care Homes & Services (LTCH&S) division is one of the largest providers of long-term care in the Canadian province of Ontario, providing care to 2,640…

math.OC20216 cited

Copositive Duality for Discrete Markets and Games

Cheng Guo, Merve Bodur, Joshua A. Taylor

Optimization problems with discrete decisions are nonconvex and thus lack strong duality, which limits the usefulness of tools such as shadow prices and the KKT conditions. It was…

math.OC20205 cited

Digital Annealer for quadratic unconstrained binary optimization: a comparative performance analysis

Oylum Şeker, Neda Tanoumand, Merve Bodur

Digital Annealer (DA) is a computer architecture designed for tackling combinatorial optimization problems formulated as quadratic unconstrained binary optimization (QUBO) models.…

math.OC2019

Logic-based Benders Decomposition and Binary Decision Diagram Based Approaches for Stochastic Distributed Operating Room Scheduling

Cheng Guo, Merve Bodur, Dionne M. Aleman +1

The distributed operating room (OR) scheduling problem aims to find an assignment of surgeries to ORs across collaborating hospitals that share their waiting lists and ORs. We prop…

math.OC2019

Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to Discretizable Distance Geometry Problems

Moira MacNeil, Merve Bodur

Given an integer dimension K and a simple, undirected graph G with positive edge weights, the Distance Geometry Problem (DGP) aims to find a realization function mapping each verte…

math.OC2018

Network Models for Multiobjective Discrete Optimization

David Bergman, Merve Bodur, Carlos Cardonha +1

This paper provides a novel framework for solving multiobjective discrete optimization problems with an arbitrary number of objectives. Our framework formulates these problems as n…