15 citations · 27 across the 4 of their papers we have counts for
4 papers
A parallel approach to bi-objective integer programming
William Pettersson, Melih Ozlen
To obtain a better understanding of the trade-offs between various objectives, Bi-Objective Integer Programming (BOIP) algorithms calculate the set of all non-dominated vectors and…
A heuristic scheme for the Cooperative Team Orienteering Problem with Time Windows
Iman Roozbeh, Melih Ozlen, John W. Hearne
The Cooperative Orienteering Problem with Time Windows (COPTW)is a class of problems with some important applications and yet has received relatively little attention. In the COPTW…
A fast branching algorithm for unknot recognition with experimental polynomial-time behaviour
Benjamin A. Burton, Melih Ozlen
It is a major unsolved problem as to whether unknot recognition - that is, testing whether a given closed loop in R^3 can be untangled to form a plain circle - has a polynomial tim…
A tree traversal algorithm for decision problems in knot theory and 3-manifold topology
Benjamin A. Burton, Melih Ozlen
In low-dimensional topology, many important decision algorithms are based on normal surface enumeration, which is a form of vertex enumeration over a high-dimensional and highly de…