2008 |
11 | EE | Volkan Dedeoglu,
Cagdas Atici,
F. Sibel Salman,
M. Oguz Sunay:
System optimization for peer-to-peer multi hop video broadcasting in wireless ad hoc networks.
WOWMOM 2008: 1-6 |
10 | EE | F. Sibel Salman,
R. Ravi,
John N. Hooker:
Solving the Capacitated Local Access Network Design Problem.
INFORMS Journal on Computing 20(2): 243-254 (2008) |
2006 |
9 | EE | Burcu Saglam,
F. Sibel Salman,
Serpil Sayin,
Metin Türkay:
A mixed-integer programming approach to the clustering problem with an application in customer segmentation.
European Journal of Operational Research 173(3): 866-879 (2006) |
2003 |
8 | EE | Refael Hassin,
R. Ravi,
F. Sibel Salman:
Approximation Algorithms for a Capacitated Network Design Problem.
Algorithmica 38(3): 417-431 (2003) |
2002 |
7 | | F. Sibel Salman,
Jayant Kalagnanam,
Sesh Murthy,
Andrew J. Davenport:
Cooperative Strategies for Solving the Bicriteria Sparse Multiple Knapsack Problem.
J. Heuristics 8(2): 215-239 (2002) |
2001 |
6 | EE | Naveen Garg,
Rohit Khandekar,
Goran Konjevod,
R. Ravi,
F. Sibel Salman,
Amitabh Sinha II:
On the Integrality Gap of a Natural Formulation of the Single-Sink Buy-at-Bulk Network Design Problem.
IPCO 2001: 170-184 |
5 | EE | Goran Konjevod,
R. Ravi,
F. Sibel Salman:
On approximating planar metrics by tree metrics.
Inf. Process. Lett. 80(4): 213-219 (2001) |
2000 |
4 | EE | Refael Hassin,
R. Ravi,
F. Sibel Salman:
Approximation algorithms for a capacitated network design problem.
APPROX 2000: 167-176 |
3 | | Milind Dawande,
Jayant Kalagnanam,
Pinar Keskinocak,
F. Sibel Salman,
R. Ravi:
Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions.
J. Comb. Optim. 4(2): 171-186 (2000) |
1999 |
2 | EE | R. Ravi,
F. Sibel Salman:
Approximation Algorithms for the Traveling Purchaser Problem and its Variants in Network Design.
ESA 1999: 29-40 |
1997 |
1 | | F. Sibel Salman,
Joseph Cheriyan,
R. Ravi,
S. Subramanian:
Buy-at-Bulk Network Design: Approximating the Single-Sink Edge Installation Problem.
SODA 1997: 619-628 |