( en | de | ru )

 

Disambiguation of "Salman, F. Sibel"

Author of the publication

copydeleteadd this publication to your clipboard
On the Integrality Gap of a Natural Formulation of the Single-Sink Buy-at-Bulk Network Design Problem.

, , , , , and . IPCO, volume 2081 of Lecture Notes in Computer Science, page 170-184. Springer, (2001)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Sibel Savran

Abdullah Salman Salman

Salman Abdullah Salman

Thomas Sibelis

Ulf Sibelius

 

Other publications of authors with the same name

On the randomized online strategies for the k-Canadian traveler problem., and . J. Comb. Optim., 38 (1): 254-267 (2019)On the online multi-agent O-D k-Canadian Traveler Problem., and . J. Comb. Optim., 34 (2): 453-461 (2017)Approximation Algorithms for a Capacitated Network Design Problem., , and . Algorithmica, 38 (3): 417-431 (2003)Two dimensional guillotine cutting stock and scheduling problem in printing industry., , and . Comput. Oper. Res., (2022)Relief Aid Provision to En Route Refugees: Multi-Period Mobile Facility Location with Mobile Demand., , , and . Eur. J. Oper. Res., 301 (2): 708-725 (2022)Minimizing latency in post-disaster road clearance operations., , and . Eur. J. Oper. Res., 277 (3): 1098-1112 (2019)Role of Analytics for Operational Risk Management in the Era of Big Data., , , and . Decis. Sci., 51 (6): 1320-1346 (2020)System optimization for peer-to-peer multi hop video broadcasting in wireless ad hoc networks., , , and . WOWMOM, page 1-6. IEEE Computer Society, (2008)Hybrid Adaptive Large Neighborhood Search for the Optimal Statistic Median Problem., , and . Comput. Oper. Res., 39 (11): 2679-2687 (2012)Minimizing total weighted latency in home healthcare routing and scheduling with patient prioritization., , , and . OR Spectr., 45 (3): 807-852 (2023)