Refael Hassin

According to our database1, Refael Hassin authored at least 145 papers between 1981 and 2019.

Collaborative distances:



In proceedings 
PhD thesis 





On Rational Behavior in a Loss System with One Observable Queue and One Unobservable Queue.
Proceedings of the Queueing Theory and Network Applications, 2019

A Closed Queueing Network with Strategic Service Differentiation.
Proceedings of the Queueing Theory and Network Applications, 2019

Operations research applications of dichotomous search.
Eur. J. Oper. Res., 2018

Cascade equilibrium strategies in a two-server queueing system with inspection cost.
Eur. J. Oper. Res., 2018

On the price of anarchy in a single-server queue with heterogeneous service valuations induced by travel costs.
Eur. J. Oper. Res., 2018

Strategic customer behavior in a queueing system with a loss subsystem.
Queueing Syst. Theory Appl., 2017

Customer equilibrium in a single-server system with virtual and system queues.
Queueing Syst. Theory Appl., 2017

Profit maximization in the M/M/1 queue.
Oper. Res. Lett., 2017

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

The Impact of Inspection Cost on Equilibrium, Revenue, and Social Welfare in a Single-Server Queue.
Oper. Res., 2017

Equilibrium and efficient clustering of arrival times to a queue.
CoRR, 2017

Self, Social and Monopoly Optimization in Observable Queues.
Proceedings of the 11th EAI International Conference on Performance Evaluation Methodologies and Tools, 2017

Strategic Overtaking in a Monopolistic M/M/1 Queue.
IEEE Trans. Autom. Control., 2015

Sequential scheduling on identical machines.
Oper. Res. Lett., 2015

Equilibrium strategies for placing duplicate orders in a single server queue.
Oper. Res. Lett., 2015

Optimal Control of a Queue With High-Low Delay Announcements: The Significance of the Queue.
EAI Endorsed Trans. Energy Web, 2015

The Price of Anarchy in the Markovian Single Server Queue.
IEEE Trans. Autom. Control., 2014

Regulation under partial cooperation: The case of a queueing system.
Oper. Res. Lett., 2014

On the advantage of leadership in service pricing competition.
Oper. Res. Lett., 2013

A local search algorithm for binary maximum 2-path partitioning.
Discret. Optim., 2013

Series-parallel orientations preserving the cycle-radius.
Inf. Process. Lett., 2012

Strategic behavior and social optimization in Markovian vacation queues: The case of heterogeneous customers.
Eur. J. Oper. Res., 2012

The (K, k)-capacitated spanning tree problem.
Discret. Optim., 2012

Information cascades in a queueing system with parallel servers.
Proceedings of the 6th International ICST Conference on Performance Evaluation Methodologies and Tools, 2012

Strategic Behavior and Social Optimization in Markovian Vacation Queues.
Oper. Res., 2011

On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph.
Discret. Optim., 2011

Minimum diameter and cycle-diameter orientations on planar graphs
CoRR, 2011

On two restricted ancestors tree problems.
Inf. Process. Lett., 2010

Inducing search by periodic advertising.
Inf. Econ. Policy, 2010

Min sum clustering with penalties.
Eur. J. Oper. Res., 2010

The Complexity of Bottleneck Labeled Graph Problems.
Algorithmica, 2010

Multi-Color Pebble Motion on Graphs.
Algorithmica, 2010

The (<i>K</i>, <i>k</i>)-Capacitated Spanning Tree Problem.
Proceedings of the Algorithmic Aspects in Information and Management, 2010

Approximating the minimum quadratic assignment problems.
ACM Trans. Algorithms, 2009

Equilibrium customers' choice between FCFS and random servers.
Queueing Syst. Theory Appl., 2009

The use of relative priorities in optimizing the performance of a queueing system.
Eur. J. Oper. Res., 2009

Approximation algorithms for maximum latency and partial cycle cover.
Discret. Optim., 2009

Equilibrium solutions in the observable <i>M/M/1</i> queue with overtaking.
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

Rounding to an integral program.
Oper. Res. Lett., 2008

Greedy heuristics with regret, with application to the cheapest insertion algorithm for the TSP.
Oper. Res. Lett., 2008

Scheduling Arrivals to Queues: A Single-Server Model with No-Shows.
Manag. Sci., 2008

The k-path tree matroid and its applications to survivable network design.
Discret. Optim., 2008

Approximation algorithms and hardness results for labeled connectivity problems.
J. Comb. Optim., 2007

Flow trees for vertex-capacitated networks.
Discret. Appl. Math., 2007

Robust subgraphs for trees and paths.
ACM Trans. Algorithms, 2006

The minimum generalized vertex cover problem.
ACM Trans. Algorithms, 2006

Who should be given priority in a queue?
Oper. Res. Lett., 2006

Approximations for minimum and min-max vehicle routing problems.
J. Algorithms, 2006

An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes.
Inf. Process. Lett., 2006

Optimizing Chemotherapy Scheduling Using Local Search Heuristics.
Oper. Res., 2006

Erratum to "An approximation algorithm for maximum triangle packing": [Discrete Applied Mathematics 154 (2006) 971-979].
Discret. Appl. Math., 2006

An approximation algorithm for maximum triangle packing.
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

A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem.
SIAM J. Comput., 2005

Equilibrium in Queueing Systems with Complementary Products.
Queueing Syst. Theory Appl., 2005

On the complexity of the <i>k</i>-customer vehicle routing problem.
Oper. Res. Lett., 2005

The maximum saving partition problem.
Oper. Res. Lett., 2005

The Number of Solutions Sufficient for Solving a Family of Problems.
Math. Oper. Res., 2005

Approximation algorithms for some vehicle routing problems.
Discret. Appl. Math., 2005

Machine scheduling with earliness, tardiness and non-execution penalties.
Comput. Oper. Res., 2005

Approximation Algorithms for Quickest Spanning Tree Problems.
Algorithmica, 2005

The Multi-radius Cover Problem.
Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

The Set Cover with Pairs Problem.
Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005

An Approximation Algorithm for the Minimum Latency Set Cover Problem.
Proceedings of the Algorithms, 2005

An efficient polynomial time approximation scheme for the constrained minimum spanning tree problem using matroid intersection.
SIAM J. Comput., 2004

Synthesis of 2-Commodity Flow Networks.
Math. Oper. Res., 2004

Minimum restricted diameter spanning trees.
Discret. Appl. Math., 2004

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

Approximations for Maximum Transportation with Permutable Supply Vector and Other Capacitated Star Packing Problems.
Algorithmica, 2004

Approximation algorithms for the metric maximum clustering problem with given cluster sizes.
Oper. Res. Lett., 2003

Reconstructing edge-disjoint paths.
Oper. Res. Lett., 2003

Minimum spanning tree with hop restrictions.
J. Algorithms, 2003

Capacitated vertex covering.
J. Algorithms, 2003

Lexicographic local search and the p.
Eur. J. Oper. Res., 2003

Subgraphs decomposable into two trees and k-edge-connected subgraphs.
Discret. Appl. Math., 2003

Differential Approximation for Some Routing Problems.
Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

Robust Matchings.
SIAM J. Discret. Math., 2002

Approximation algorithms for constructing wavelength routing networks.
Networks, 2002

A 7/8-approximation algorithm for metric Max TSP.
Inf. Process. Lett., 2002

Complexity of finding dense subgraphs.
Discret. Appl. Math., 2002

Increasing digraph arc-connectivity by arc addition, reversal and complement.
Discret. Appl. Math., 2002

A note on orientations of mixed graphs.
Discret. Appl. Math., 2002

Nash Equilibrium and Subgame Perfection in Observable Queues.
Annals OR, 2002

Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems.
Proceedings of the Algorithm Theory, 2002

Capacitated vertex covering with applications.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

A 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts.
SIAM J. Discret. Math., 2001

J. Algorithms, 2001

Approximation algorithms for maximum linear arrangement.
Inf. Process. Lett., 2001

Approximating the maximum quadratic assignment problem.
Inf. Process. Lett., 2001

Minimum-diameter covering problems.
Networks, 2000

Better approximations for max TSP.
Inf. Process. Lett., 2000

Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem.
Algorithmica, 2000

Approximation Algorithms for Minimum <i>K</i>-Cut.
Algorithmica, 2000

Robust Matchings and Maximum Clustering.
Proceedings of the Algorithm Theory, 2000

Approximating the maximum quadratic assignment problem.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

An approximation algorithm for MAX DICUT with given sizes of parts.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2000

Scheduling maintenance services to three machines.
Annals OR, 1999

On Local Search for Weighted <i>k</i>-Set Packing.
Math. Oper. Res., 1998

An Approximation Algorithm for the Maximum Traveling Salesman Problem.
Inf. Process. Lett., 1998

Graph partitions with minimum degree constraints.
Discret. Math., 1998

Approximation Algorithms for Min-sum p-clustering.
Discret. Appl. Math., 1998

Approximation Algorithms for Minimum Tree Partition.
Discret. Appl. Math., 1998

The Scheduling of Maintenance Service.
Discret. Appl. Math., 1998

Approximation algorithms for maximum dispersion.
Oper. Res. Lett., 1997

Restricted delivery problems on a network.
Networks, 1997

Approximation Algorithms for Min-Max Tree Partition.
J. Algorithms, 1997

An Approximation Algorithm for Maximum Packing of 3-Edge Paths.
Inf. Process. Lett., 1997

Equilibrium Threshold Strategies: The Case of Queues with Priorities.
Oper. Res., 1997

On Local Search for Weighted k-Set Packing.
Proceedings of the Algorithms, 1997

A Flow Algorithm for Network Synchronization.
Oper. Res., 1996

Equilibrium strategies for queues with impatient customers.
Oper. Res. Lett., 1995

On the Minimum Diameter Spanning Tree Problem.
Inf. Process. Lett., 1995

optimal Separable Partitioning in the Plane.
Discret. Appl. Math., 1995

Approximations for the Maximum Acyclic Subgraph Problem.
Inf. Process. Lett., 1994

Maximizing the Number of Unused Colors in the Vertex Coloring Problem.
Inf. Process. Lett., 1994

Approximation Algorithms for the Geometric Covering Salesman Problem.
Discret. Appl. Math., 1994

Approximating the Tree and Tour Covers of a Graph.
Inf. Process. Lett., 1993

Monotonicity and Efficient Computation of Optimal Dichotomous Search.
Discret. Appl. Math., 1993

Mean Passage Times and Nearly Uncoupled Markov Chains.
SIAM J. Discret. Math., 1992

Algorithms for the minimum cost circulation problem based on maximizing the mean improvement.
Oper. Res. Lett., 1992

The swapping problem.
Networks, 1992

Approximation Schemes for the Restricted Shortest Path Problem.
Math. Oper. Res., 1992

Improved complexity bounds for location problems on the real line.
Oper. Res. Lett., 1991

Exact Computation of Optimal Inventory Policies Over an Unbounded Horizon.
Math. Oper. Res., 1991

Approximation algorithms for hitting objects with straight lines.
Discret. Appl. Math., 1991

Multiterminal xcut problems.
Annals OR, 1991

Simultaneous Solution of Families of Problems.
Proceedings of the Algorithms, 1990

Ranking the Best Binary Trees.
SIAM J. Comput., 1989

Maximizing Classes of Two-Parameter Objectives Over Matroids.
Math. Oper. Res., 1989

Probabilistic Analysis of the Capacitated Transportation Problem.
Math. Oper. Res., 1988

Solution Bases of Multiterminal Cut Problems.
Math. Oper. Res., 1988

Equilibrium Arrivals in Queues with Bulk Service at Scheduled Times.
Transportation Science, 1987

A Deterministic Single-Item Inventory Model with Seller Holding Cost and Buyer Holding and Shortage Costs.
Oper. Res., 1986

Multi-terminal maximum flows in node-capacitated networks.
Discret. Appl. Math., 1986

An O(n log<sup>2</sup> n) Algorithm for Maximum Flow in Undirected Planar Networks.
SIAM J. Comput., 1985

On Shortest Paths in Graphs with Random Weights.
Math. Oper. Res., 1985

An Optimal Algorithm for Finding all the Jumps of a Monotone Step-Function.
J. Algorithms, 1985

On multicommodity flows in planar graphs.
Networks, 1984

Dichotomous Search for Random Objects on an Interval.
Math. Oper. Res., 1984

A Dichotomous Search for a Geometric Random Variable.
Oper. Res., 1984

The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm.
Math. Program., 1983

Minimum cost flow with set-constraints.
Networks, 1982

Generalizations of Hoffman's existence theorem for circulations.
Networks, 1981

Maximum Flow in (s, t) Planar Networks.
Inf. Process. Lett., 1981