F. Sibel Salman

Orcid: 0000-0001-6833-2552

According to our database1, F. Sibel Salman authored at least 54 papers between 1997 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Minimizing total weighted latency in home healthcare routing and scheduling with patient prioritization.
OR Spectr., 2023

2022
Optimizing two-dimensional vehicle loading and dispatching decisions in freight logistics.
Eur. J. Oper. Res., 2022

Logistics planning of cash transfer to Syrian refugees in Turkey.
Eur. J. Oper. Res., 2022

Relief Aid Provision to En Route Refugees: Multi-Period Mobile Facility Location with Mobile Demand.
Eur. J. Oper. Res., 2022

Routing multiple work teams to minimize latency in post-disaster road network restoration.
Eur. J. Oper. Res., 2022

Two dimensional guillotine cutting stock and scheduling problem in printing industry.
Comput. Oper. Res., 2022

A learning based algorithm for drone routing.
Comput. Oper. Res., 2022

A Capacitated Mobile Facility Location Problem with Mobile Demand: Recurrent Service Provision to En Route Refugees.
Proceedings of the 10th International Network Optimization Conference, 2022

2021
Prioritized single nurse routing and scheduling for home healthcare services.
Eur. J. Oper. Res., 2021

2020
Online routing and scheduling of search-and-rescue teams.
OR Spectr., 2020

Online optimization of first-responder routes in disaster response logistics.
IBM J. Res. Dev., 2020

Role of Analytics for Operational Risk Management in the Era of Big Data.
Decis. Sci., 2020

Data Analytics for Operational Risk Management.
Decis. Sci., 2020

A data-driven optimization framework for routing mobile medical facilities.
Ann. Oper. Res., 2020

The Approximability of Multiple Facility Location on Directed Networks with Random Arc Failures.
Algorithmica, 2020

2019
On the randomized online strategies for the k-Canadian traveler problem.
J. Comb. Optim., 2019

Competitive analysis of randomized online strategies for the multi-agent k-Canadian Traveler Problem.
J. Comb. Optim., 2019

Inequity-averse shelter location for disaster preparedness.
IISE Trans., 2019

The capacitated mobile facility location problem.
Eur. J. Oper. Res., 2019

Minimizing latency in post-disaster road clearance operations.
Eur. J. Oper. Res., 2019

Seasonal Labor Migration Among Syrian Refugees and Urban Deep Map for Integration in Turkey.
Proceedings of the Guide to Mobile Data Analytics in Refugee Scenarios, 2019

2018
Improving post-disaster road network accessibility by strengthening links against failures.
Eur. J. Oper. Res., 2018

2017
An adaptive and diversified vehicle routing approach to reducing the security risk of cash-in-transit operations.
Networks, 2017

On the online multi-agent O-D k-Canadian Traveler Problem.
J. Comb. Optim., 2017

Multiple facility location on a network with linear reliability order of edges.
J. Comb. Optim., 2017

Multi-vehicle synchronized arc routing problem to restore post-disaster network connectivity.
Eur. J. Oper. Res., 2017

Multi-vehicle prize collecting arc routing for connectivity problem.
Comput. Oper. Res., 2017

2015
Emergency facility location under random network damage: Insights from the Istanbul case.
Comput. Oper. Res., 2015

2014
An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem.
Eur. J. Oper. Res., 2014

Deployment of field hospitals in mass casualty incidents.
Comput. Ind. Eng., 2014

A Model-Based Heuristic to the Min Max K-Arc Routing for Connectivity Problem.
Proceedings of the 4th Student Conference on Operational Research, 2014

2013
A constant-factor approximation algorithm for multi-vehicle collection for processing problem.
Optim. Lett., 2013

Optimizing specimen collection for processing in clinical testing laboratories.
Eur. J. Oper. Res., 2013

Modeling Earthquake Vulnerability of Highway Networks.
Electron. Notes Discret. Math., 2013

2012
Selective and periodic inventory routing problem for waste vegetable oil collection.
Optim. Lett., 2012

Hybrid Adaptive Large Neighborhood Search for the Optimal Statistic Median Problem.
Comput. Oper. Res., 2012

A tabu search algorithm for order acceptance and scheduling.
Comput. Oper. Res., 2012

2011
Assessing the reliability and the expected performance of a network under disaster risk.
OR Spectr., 2011

Locating disaster response facilities in Istanbul.
J. Oper. Res. Soc., 2011

2010
Pre-disaster investment decisions for strengthening a highway network.
Comput. Oper. Res., 2010

2009
Optimizing product assortment under customer-driven demand substitution.
Eur. J. Oper. Res., 2009

Tractable Cases of Facility Location on a Network with a Linear Reliability Order of Links.
Proceedings of the Algorithms, 2009

2008
Solving the Capacitated Local Access Network Design Problem.
INFORMS J. Comput., 2008

System optimization for peer-to-peer multi hop video broadcasting in wireless ad hoc networks.
Proceedings of the 9th IEEE International Symposium on a World of Wireless, 2008

2006
A mixed-integer programming approach to the clustering problem with an application in customer segmentation.
Eur. J. Oper. Res., 2006

2004
Approximation Algorithms for a Capacitated Network Design Problem.
Algorithmica, 2004

2002
Cooperative Strategies for Solving the Bicriteria Sparse Multiple Knapsack Problem.
J. Heuristics, 2002

2001
Approximating the Single-Sink Link-Installation Problem in Network Design.
SIAM J. Optim., 2001

On approximating planar metrics by tree metrics.
Inf. Process. Lett., 2001

On the Integrality Gap of a Natural Formulation of the Single-Sink Buy-at-Bulk Network Design Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 2001

2000
Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions.
J. Comb. Optim., 2000

1999
Approximation Algorithms for the Traveling Purchaser Problem and its Variants in Network Design.
Proceedings of the Algorithms, 1999

Cooperative strategies for solving the bicriteria sparse multiple knapsack problem.
Proceedings of the 1999 Congress on Evolutionary Computation, 1999

1997
Buy-at-Bulk Network Design: Approximating the Single-Sink Edge Installation Problem.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997


  Loading...