Refael Hassin

ORCID

Publication Activity (10 Years)

Years Active: 1981-2024
Publications (10 Years): 28

Top Venues

Oper. Res. Lett.

Eur. J. Oper. Res.

Manuf. Serv. Oper. Manag.

Queueing Syst. Theory Appl.

Publications

Nili Guttmann-Beck, Refael Hassin, Michal Stern
On partitioning minimum spanning trees. Discret. Appl. Math. 359 (2024)
Refael Hassin, Isaac Meilijson, Yael Perlman
Queueing with Negative Network Effects. Manuf. Serv. Oper. Manag. 25 (5) (2023)
Refael Hassin, Moshe Haviv, Binyamin Oz
Strategic behavior in queues with arrival rate uncertainty. Eur. J. Oper. Res. 309 (1) (2023)
Amihai Glazer, Refael Hassin, Irit Nowik
How Advance Sales Can Reduce Profits: When to Buy, When to Sell, and What Price to Charge. Manuf. Serv. Oper. Manag. 25 (5) (2023)
Nimrod Dvir, Refael Hassin, Moshe Haviv
On equilibrium threshold strategies when choosing between observable and unobservable queues. Oper. Res. Lett. 50 (5) (2022)
Refael Hassin
Profit maximization and cost balancing in queueing systems. Queueing Syst. Theory Appl. 100 (3-4) (2022)
Refael Hassin, Renata Poznanski
Integrality in the multinetwork min-cost equal-flow problem. Networks 80 (3) (2022)
Michal Benelli, Refael Hassin
Rational joining behavior in a queueing system with abandonments. Oper. Res. Lett. 49 (3) (2021)
Refael Hassin, Adam Nathaniel
Self-Selected Task Allocation. Manuf. Serv. Oper. Manag. 23 (6) (2021)
Refael Hassin, Ricky Roet-Green
On Queue-Length Information when Customers Travel to a Queue. Manuf. Serv. Oper. Manag. 23 (4) (2021)
Refael Hassin, Nikita Leshenko
Greedy Differencing Edge-Contraction heuristic for the Max-Cut problem. Oper. Res. Lett. 49 (3) (2021)
Souvik Ghosh, Refael Hassin
Inefficiency in stochastic queueing systems with strategic customers. Eur. J. Oper. Res. 295 (1) (2021)
Refael Hassin
Equilibrium and optimal one-shot delegated search. IISE Trans. 53 (8) (2021)
Refael Hassin, Ran I. Snitkovsky
Social and Monopoly Optimization in Observable Queues. Oper. Res. 68 (4) (2020)
Nimrod Dvir, Refael Hassin, Uri Yechiali
Strategic behaviour in a tandem queue with alternating server. Queueing Syst. Theory Appl. 96 (3-4) (2020)
Refael Hassin, R. Ravi, F. Sibel Salman, Danny Segev
The Approximability of Multiple Facility Location on Directed Networks with Random Arc Failures. Algorithmica 82 (9) (2020)
Michal Benelli, Refael Hassin
A Closed Queueing Network with Strategic Service Differentiation. QTNA (2019)
Refael Hassin, Jonathan H. P. Milo
On Rational Behavior in a Loss System with One Observable Queue and One Unobservable Queue. QTNA (2019)
Refael Hassin, Ricky Roet-Green
Cascade equilibrium strategies in a two-server queueing system with inspection cost. Eur. J. Oper. Res. 267 (3) (2018)
Refael Hassin, Irit Nowik, Yair Y. Shaki
On the price of anarchy in a single-server queue with heterogeneous service valuations induced by travel costs. Eur. J. Oper. Res. 265 (2) (2018)
Refael Hassin, Anna Sarid
Operations research applications of dichotomous search. Eur. J. Oper. Res. 265 (3) (2018)
Refael Hassin, R. Ravi, F. Sibel Salman
Multiple facility location on a network with linear reliability order of edges. J. Comb. Optim. 34 (3) (2017)
Roei Engel, Refael Hassin
Customer equilibrium in a single-server system with virtual and system queues. Queueing Syst. Theory Appl. 87 (1-2) (2017)
Refael Hassin, Ricky Roet-Green
The Impact of Inspection Cost on Equilibrium, Revenue, and Social Welfare in a Single-Server Queue. Oper. Res. 65 (3) (2017)
Refael Hassin, Alexandra Koshman-Kaz
Profit maximization in the M/M/1 queue. Oper. Res. Lett. 45 (5) (2017)
Refael Hassin, Ran I. Snitkovsky
Self, Social and Monopoly Optimization in Observable Queues. VALUETOOLS (2017)
Refael Hassin, Ran I. Snitkovsky
Strategic customer behavior in a queueing system with a loss subsystem. Queueing Syst. Theory Appl. 86 (3-4) (2017)
Amihai Glazer, Refael Hassin, Liron Ravner
Equilibrium and efficient clustering of arrival times to a queue. CoRR (2017)
Pengfei Guo, Refael Hassin
Equilibrium strategies for placing duplicate orders in a single server queue. Oper. Res. Lett. 43 (3) (2015)
Refael Hassin, Uri Yovel
Sequential scheduling on identical machines. Oper. Res. Lett. 43 (5) (2015)
Alexandra Koshman-Kaz, Refael Hassin
Optimal Control of a Queue With High-Low Delay Announcements: The Significance of the Queue. EAI Endorsed Trans. Energy Web 2 (7) (2015)
Jenny Erlichman, Refael Hassin
Strategic Overtaking in a Monopolistic M/M/1 Queue. IEEE Trans. Autom. Control. 60 (8) (2015)
Gail Gilboa-Freedman, Refael Hassin, Yoav Kerner
The Price of Anarchy in the Markovian Single Server Queue. IEEE Trans. Autom. Control. 59 (2) (2014)
Alexandra Koshman-Kaz, Refael Hassin
Optimal Control of a Queue With High-Low Delay Announcements: The Significance of the Queue. VALUETOOLS (2014)
Gail Gilboa-Freedman, Refael Hassin
Regulation under partial cooperation: The case of a queueing system. Oper. Res. Lett. 42 (3) (2014)
Pengfei Guo, Refael Hassin
On the advantage of leadership in service pricing competition. Oper. Res. Lett. 41 (4) (2013)
Refael Hassin, Ohad Schneider
A local search algorithm for binary maximum 2-path partitioning. Discret. Optim. 10 (4) (2013)
Nili Guttmann-Beck, Refael Hassin
Series-parallel orientations preserving the cycle-radius. Inf. Process. Lett. 112 (4) (2012)
Refael Hassin, Ricky Roet-Green
Information cascades in a queueing system with parallel servers. VALUETOOLS (2012)
Esther M. Arkin, Nili Guttmann-Beck, Refael Hassin
The (K, k)-capacitated spanning tree problem. Discret. Optim. 9 (4) (2012)
Pengfei Guo, Refael Hassin
Strategic behavior and social optimization in Markovian vacation queues: The case of heterogeneous customers. Eur. J. Oper. Res. 222 (2) (2012)
Nili Guttmann-Beck, Refael Hassin
Minimum diameter and cycle-diameter orientations on planar graphs CoRR (2011)
Pengfei Guo, Refael Hassin
Strategic Behavior and Social Optimization in Markovian Vacation Queues. Oper. Res. 59 (4) (2011)
Nili Guttmann-Beck, Refael Hassin
On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph. Discret. Optim. 8 (2) (2011)
Esther M. Arkin, Nili Guttmann-Beck, Refael Hassin
)-Capacitated Spanning Tree Problem. AAIM (2010)
Gilad Goraly, Refael Hassin
Multi-Color Pebble Motion on Graphs. Algorithmica 58 (3) (2010)
Refael Hassin, Jérôme Monnot, Danny Segev
The Complexity of Bottleneck Labeled Graph Problems. Algorithmica 58 (2) (2010)
Refael Hassin, Einat Or
Min sum clustering with penalties. Eur. J. Oper. Res. 206 (3) (2010)
Nili Guttmann-Beck, Refael Hassin
On two restricted ancestors tree problems. Inf. Process. Lett. 110 (14-15) (2010)
Amihai Glazer, Refael Hassin
Inducing search by periodic advertising. Inf. Econ. Policy 22 (3) (2010)
Jenny Erlichman, Refael Hassin
queue with overtaking. VALUETOOLS (2009)
Refael Hassin, Justo Puerto, Francisco R. Fernández
The use of relative priorities in optimizing the performance of a queueing system. Eur. J. Oper. Res. 193 (2) (2009)
Refael Hassin, Asaf Levin, Shlomi Rubinstein
Approximation algorithms for maximum latency and partial cycle cover. Discret. Optim. 6 (2) (2009)
Refael Hassin, Asaf Levin, Maxim Sviridenko
Approximating the minimum quadratic assignment problems. ACM Trans. Algorithms 6 (1) (2009)
Refael Hassin
Equilibrium customers' choice between FCFS and random servers. Queueing Syst. Theory Appl. 62 (3) (2009)
Refael Hassin, R. Ravi, F. Sibel Salman
Tractable Cases of Facility Location on a Network with a Linear Reliability Order of Links. ESA (2009)
Esther M. Arkin, Refael Hassin
The k-path tree matroid and its applications to survivable network design. Discret. Optim. 5 (2) (2008)
Refael Hassin, Ariel Keinan
Greedy heuristics with regret, with application to the cheapest insertion algorithm for the TSP. Oper. Res. Lett. 36 (2) (2008)
Refael Hassin, Sharon Mendel
Scheduling Arrivals to Queues: A Single-Server Model with No-Shows. Manag. Sci. 54 (3) (2008)
Refael Hassin, Danny Segev
Rounding to an integral program. Oper. Res. Lett. 36 (3) (2008)
Refael Hassin, Jérôme Monnot, Danny Segev
The Complexity of Bottleneck Labeled Graph Problems. WG (2007)
Refael Hassin, Asaf Levin
Flow trees for vertex-capacitated networks. Discret. Appl. Math. 155 (4) (2007)
Refael Hassin, Jérôme Monnot, Danny Segev
Approximation algorithms and hardness results for labeled connectivity problems. J. Comb. Optim. 14 (4) (2007)
Refael Hassin, Danny Segev
Robust subgraphs for trees and paths. ACM Trans. Algorithms 2 (2) (2006)
Refael Hassin, Shlomi Rubinstein
An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes. Inf. Process. Lett. 98 (3) (2006)
Zvia Agur, Refael Hassin, Sigal Levy
Optimizing Chemotherapy Scheduling Using Local Search Heuristics. Oper. Res. 54 (5) (2006)
Refael Hassin, Shlomi Rubinstein
An approximation algorithm for maximum triangle packing. Discret. Appl. Math. 154 (6) (2006)
Esther M. Arkin, Refael Hassin, Asaf Levin
Approximations for minimum and min-max vehicle routing problems. J. Algorithms 59 (1) (2006)
Refael Hassin, Jérôme Monnot, Danny Segev
Approximation Algorithms and Hardness Results for Labeled Connectivity Problems. MFCS (2006)
Refael Hassin, Shlomi Rubinstein
Erratum to "An approximation algorithm for maximum triangle packing": [Discrete Applied Mathematics 154 (2006) 971-979]. Discret. Appl. Math. 154 (18) (2006)
Refael Hassin, Moshe Haviv
Who should be given priority in a queue? Oper. Res. Lett. 34 (2) (2006)
Refael Hassin, Einat Or
A Maximum Profit Coverage Algorithm with Application to Small Molecules Cluster Identification. WEA (2006)
Refael Hassin, Asaf Levin
The minimum generalized vertex cover problem. ACM Trans. Algorithms 2 (1) (2006)
Refael Hassin, Mati Shani
Machine scheduling with earliness, tardiness and non-execution penalties. Comput. Oper. Res. 32 (2005)
Ori Einstein, Refael Hassin
The Number of Solutions Sufficient for Solving a Family of Problems. Math. Oper. Res. 30 (4) (2005)
Refael Hassin, Danny Segev
The Set Cover with Pairs Problem. FSTTCS (2005)
Refael Hassin, Danny Segev
Rounding to an Integral Program. WEA (2005)
Refael Hassin, Asaf Levin
An Approximation Algorithm for the Minimum Latency Set Cover Problem. ESA (2005)
Refael Hassin, Einat Or
Min Sum Clustering with Penalties. ESA (2005)
Refael Hassin, Jérôme Monnot
The maximum saving partition problem. Oper. Res. Lett. 33 (3) (2005)
Refael Hassin, Asaf Levin
A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem. SIAM J. Comput. 35 (1) (2005)
Refael Hassin, Danny Segev
The Multi-radius Cover Problem. WADS (2005)
Ari Veltman, Refael Hassin
Equilibrium in Queueing Systems with Complementary Products. Queueing Syst. Theory Appl. 50 (2-3) (2005)
Refael Hassin, Asaf Levin
Approximation Algorithms for Quickest Spanning Tree Problems. Algorithmica 41 (1) (2005)
Refael Hassin, Shlomi Rubinstein
-customer vehicle routing problem. Oper. Res. Lett. 33 (1) (2005)
Cristina Bazgan, Refael Hassin, Jérôme Monnot
Approximation algorithms for some vehicle routing problems. Discret. Appl. Math. 146 (1) (2005)
Refael Hassin, Asaf Levin
An efficient polynomial time approximation scheme for the constrained minimum spanning tree problem using matroid intersection. SIAM J. Comput. 33 (2) (2004)
Refael Hassin, R. Ravi, F. Sibel Salman
Approximation Algorithms for a Capacitated Network Design Problem. Algorithmica 38 (3) (2004)
Refael Hassin, Asaf Levin
Synthesis of 2-Commodity Flow Networks. Math. Oper. Res. 29 (2) (2004)
Esther M. Arkin, Refael Hassin, Shlomi Rubinstein, Maxim Sviridenko
Approximations for Maximum Transportation with Permutable Supply Vector and Other Capacitated Star Packing Problems. Algorithmica 39 (2) (2004)
Refael Hassin, Asaf Levin
Approximation Algorithms for Quickest Spanning Tree Problems. ESA (2004)
Refael Hassin, Shlomi Rubinstein
An Approximation Algorithm for Maximum Triangle Packing. ESA (2004)
Refael Hassin, Danny Segev
Robust Subgraphs for Trees and Paths. SWAT (2004)
Refael Hassin, Asaf Levin
Minimum restricted diameter spanning trees. Discret. Appl. Math. 137 (3) (2004)
Refael Hassin, Asaf Levin
Subgraphs decomposable into two trees and k-edge-connected subgraphs. Discret. Appl. Math. 126 (2-3) (2003)
Sudipto Guha, Refael Hassin, Samir Khuller, Einat Or
Capacitated vertex covering. J. Algorithms 48 (1) (2003)
Refael Hassin, Asaf Levin
The Minimum Generalized Vertex Cover Problem. ESA (2003)
Cristina Bazgan, Refael Hassin, Jérôme Monnot
Differential Approximation for Some Routing Problems. CIAC (2003)
Refael Hassin, Asaf Levin
Minimum spanning tree with hop restrictions. J. Algorithms 48 (1) (2003)
Michele Conforti, Refael Hassin, R. Ravi
Reconstructing edge-disjoint paths. Oper. Res. Lett. 31 (3) (2003)

Refael Hassin.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Refael Hassin