Search Results - "AYKUT ÖZSOY, F"
-
1
A branch-and-cut algorithm for the partitioning-hub location-routing problem
Published in Computers & operations research (01-02-2011)“…We introduce the Partitioning-Hub-Location-Routing Problem (PHLRP), a hub location problem involving graph partitioning and routing features. The PHLRP…”
Get full text
Journal Article -
2
Size-constrained graph partitioning polytopes
Published in Discrete mathematics (28-12-2010)“…We consider the problem of clustering a set of items into subsets whose sizes are bounded from above and below. We formulate the problem as a graph…”
Get full text
Journal Article -
3
An exact algorithm for the capacitated vertex -center problem
Published in Computers & operations research (01-05-2006)“…We develop a simple and practical exact algorithm for the problem of locating p facilities and assigning clients to them within capacity restrictions in order…”
Get full text
Journal Article -
4
An exact algorithm for the capacitated vertex p-center problem
Published in Computers & operations research (01-05-2006)“…We develop a simple and practical exact algorithm for the problem of locating p facilities and assigning clients to them within capacity restrictions in order…”
Get full text
Journal Article -
5
Algorithms for some Discrete Location Problems
Published 01-01-2003“…In this thesis we propose and analyze three algorithms for three different discrete location problems: the p-center problem, the capacitated p-center problem…”
Get full text
Dissertation