Refael Hassin
According to our database^{1},
Refael Hassin
authored at least 145 papers
between 1981 and 2019.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at zbmath.org
On csauthors.net:
Bibliography
2019
On Rational Behavior in a Loss System with One Observable Queue and One Unobservable Queue.
Proceedings of the Queueing Theory and Network Applications, 2019
Proceedings of the Queueing Theory and Network Applications, 2019
2018
Eur. J. Oper. Res., 2018
Cascade equilibrium strategies in a twoserver queueing system with inspection cost.
Eur. J. Oper. Res., 2018
On the price of anarchy in a singleserver queue with heterogeneous service valuations induced by travel costs.
Eur. J. Oper. Res., 2018
2017
Queueing Syst. Theory Appl., 2017
Queueing Syst. Theory Appl., 2017
Oper. Res. Lett., 2017
J. Comb. Optim., 2017
The Impact of Inspection Cost on Equilibrium, Revenue, and Social Welfare in a SingleServer Queue.
Oper. Res., 2017
CoRR, 2017
Proceedings of the 11th EAI International Conference on Performance Evaluation Methodologies and Tools, 2017
2015
IEEE Trans. Autom. Control., 2015
Oper. Res. Lett., 2015
Oper. Res. Lett., 2015
Optimal Control of a Queue With HighLow Delay Announcements: The Significance of the Queue.
EAI Endorsed Trans. Energy Web, 2015
2014
IEEE Trans. Autom. Control., 2014
Oper. Res. Lett., 2014
2013
Oper. Res. Lett., 2013
Discret. Optim., 2013
2012
Inf. Process. Lett., 2012
Strategic behavior and social optimization in Markovian vacation queues: The case of heterogeneous customers.
Eur. J. Oper. Res., 2012
Discret. Optim., 2012
Proceedings of the 6th International ICST Conference on Performance Evaluation Methodologies and Tools, 2012
2011
Oper. Res., 2011
On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph.
Discret. Optim., 2011
CoRR, 2011
2010
Inf. Process. Lett., 2010
Inf. Econ. Policy, 2010
Eur. J. Oper. Res., 2010
Algorithmica, 2010
Algorithmica, 2010
Proceedings of the Algorithmic Aspects in Information and Management, 2010
2009
ACM Trans. Algorithms, 2009
Queueing Syst. Theory Appl., 2009
The use of relative priorities in optimizing the performance of a queueing system.
Eur. J. Oper. Res., 2009
Discret. Optim., 2009
Proceedings of the 4th International Conference on Performance Evaluation Methodologies and Tools, 2009
Tractable Cases of Facility Location on a Network with a Linear Reliability Order of Links.
Proceedings of the Algorithms, 2009
2008
Oper. Res. Lett., 2008
Greedy heuristics with regret, with application to the cheapest insertion algorithm for the TSP.
Oper. Res. Lett., 2008
Manag. Sci., 2008
Discret. Optim., 2008
2007
J. Comb. Optim., 2007
Discret. Appl. Math., 2007
2006
ACM Trans. Algorithms, 2006
ACM Trans. Algorithms, 2006
Oper. Res. Lett., 2006
J. Algorithms, 2006
An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes.
Inf. Process. Lett., 2006
Oper. Res., 2006
Erratum to "An approximation algorithm for maximum triangle packing": [Discrete Applied Mathematics 154 (2006) 971979].
Discret. Appl. Math., 2006
Discret. Appl. Math., 2006
A Maximum Profit Coverage Algorithm with Application to Small Molecules Cluster Identification.
Proceedings of the Experimental Algorithms, 5th International Workshop, 2006
2005
SIAM J. Comput., 2005
Queueing Syst. Theory Appl., 2005
Oper. Res. Lett., 2005
Oper. Res. Lett., 2005
Math. Oper. Res., 2005
Discret. Appl. Math., 2005
Comput. Oper. Res., 2005
Algorithmica, 2005
Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005
Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005
Proceedings of the Algorithms, 2005
2004
An efficient polynomial time approximation scheme for the constrained minimum spanning tree problem using matroid intersection.
SIAM J. Comput., 2004
Math. Oper. Res., 2004
Discret. Appl. Math., 2004
Algorithmica, 2004
Approximations for Maximum Transportation with Permutable Supply Vector and Other Capacitated Star Packing Problems.
Algorithmica, 2004
2003
Approximation algorithms for the metric maximum clustering problem with given cluster sizes.
Oper. Res. Lett., 2003
Oper. Res. Lett., 2003
J. Algorithms, 2003
J. Algorithms, 2003
Eur. J. Oper. Res., 2003
Discret. Appl. Math., 2003
Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003
2002
SIAM J. Discret. Math., 2002
Networks, 2002
Inf. Process. Lett., 2002
Discret. Appl. Math., 2002
Discret. Appl. Math., 2002
Discret. Appl. Math., 2002
Annals OR, 2002
Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems.
Proceedings of the Algorithm Theory, 2002
Proceedings of the Thirteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2002
2001
SIAM J. Discret. Math., 2001
J. Algorithms, 2001
Inf. Process. Lett., 2001
Inf. Process. Lett., 2001
2000
Networks, 2000
Inf. Process. Lett., 2000
Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem.
Algorithmica, 2000
Algorithmica, 2000
Proceedings of the Algorithm Theory, 2000
Proceedings of the Eleventh Annual ACMSIAM Symposium on Discrete Algorithms, 2000
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2000
1999
Annals OR, 1999
1998
Math. Oper. Res., 1998
Inf. Process. Lett., 1998
Discret. Math., 1998
Discret. Appl. Math., 1998
Discret. Appl. Math., 1998
Discret. Appl. Math., 1998
1997
Oper. Res. Lett., 1997
Networks, 1997
J. Algorithms, 1997
Inf. Process. Lett., 1997
Oper. Res., 1997
Proceedings of the Algorithms, 1997
1996
Oper. Res., 1996
1995
Oper. Res. Lett., 1995
Inf. Process. Lett., 1995
Discret. Appl. Math., 1995
1994
Inf. Process. Lett., 1994
Inf. Process. Lett., 1994
Discret. Appl. Math., 1994
1993
Inf. Process. Lett., 1993
Discret. Appl. Math., 1993
1992
SIAM J. Discret. Math., 1992
Algorithms for the minimum cost circulation problem based on maximizing the mean improvement.
Oper. Res. Lett., 1992
Networks, 1992
Math. Oper. Res., 1992
1991
Oper. Res. Lett., 1991
Math. Oper. Res., 1991
Discret. Appl. Math., 1991
Annals OR, 1991
1990
Proceedings of the Algorithms, 1990
1989
SIAM J. Comput., 1989
Math. Oper. Res., 1989
1988
Math. Oper. Res., 1988
Math. Oper. Res., 1988
1987
Transportation Science, 1987
1986
A Deterministic SingleItem Inventory Model with Seller Holding Cost and Buyer Holding and Shortage Costs.
Oper. Res., 1986
Discret. Appl. Math., 1986
1985
An O(n log<sup>2</sup> n) Algorithm for Maximum Flow in Undirected Planar Networks.
SIAM J. Comput., 1985
Math. Oper. Res., 1985
J. Algorithms, 1985
1984
Networks, 1984
Math. Oper. Res., 1984
Oper. Res., 1984
1983
The minimum cost flow problem: A unifying approach to dual algorithms and a new treesearch algorithm.
Math. Program., 1983
1982
Networks, 1982
1981
Networks, 1981
Inf. Process. Lett., 1981