5 citations · 5 across the 4 of their papers we have counts for
5 papers
A Multiobjective Approach for Sector Duration Optimization in Stereotactic Radiosurgery Treatment Planning
Oylum Şeker, Mucahit Cevik, Merve Bodur +2
Sector duration optimization (SDO) is a problem arising in treatment planning for stereotactic radiosurgery on Gamma Knife. Given a set of isocenter locations, SDO aims to select c…
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.…
Routing and Wavelength Assignment with Protection: A Quadratic Unconstrained Binary Optimization Approach
Oylum Şeker, Merve Bodur, Hamed Pouya
The routing and wavelength assignment with protection is an important problem in telecommunications. Given an optical network and incoming connection requests, a commonly studied v…
The Complexity of Subtree Intersection Representation of Chordal Graphs and Linear Time Chordal Graph Generation
Tınaz Ekim, Mordechai Shalom, Oylum Şeker
It is known that any chordal graph on vertices can be represented as the intersection of subtrees in a tree on nodes. This fact is recently used in [2] to generate rand…
An Exact Cutting Plane Algorithm to Solve the Selective Graph Coloring Problem in Perfect Graphs
Oylum Şeker, Tınaz Ekim, Z. Caner Taşkın
We consider the selective graph coloring problem, which is a generalization of the classical graph coloring problem. Given a graph together with a partition of its vertex set into…