Hassin Refael

Refael Hassin

Information about the author Refael Hassin will soon be added to the site.
Found 38 papers in total
Customer equilibrium in a single-server system with virtual and system queues
Customer equilibrium in a single-server system with virtual and system queues
2017
Consider a non‐preemptive M/M/1 system with two first‐come...
Strategic customer behavior in a queueing system with a loss subsystem
Strategic customer behavior in a queueing system with a loss subsystem
2017
We study a non‐cooperative multi‐player game of rational customers in a...
The Impact of Inspection Cost on Equilibrium, Revenue, and Social Welfare in a Single-Server Queue
The Impact of Inspection Cost on Equilibrium, Revenue, and Social Welfare in a Single-Server Queue
2017
Classical models of customer decision making in unobservable queues assume acquiring...
Two Backorder Compensation Mechanisms in Inventory Systems with Impatient Customers
Two Backorder Compensation Mechanisms in Inventory Systems with Impatient Customers
2015
We study a compensation mechanism design problem with customer‐choice behavior...
The (K,k) ‐capacitated spanning tree problem
The (K,k) ‐capacitated spanning tree problem
2012
This paper considers a generalization of the capacitated spanning tree problem, in...
Multi-color pebble motion on graphs
Multi-color pebble motion on graphs
2010
We consider a graph with n vertices, and p < n pebbles of m colors. A pebble move...
Equilibrium customers' choice between FCFS and random servers
Equilibrium customers' choice between FCFS and random servers
2009
Consider two servers of equal service capacity, one serving in a first-come...
Greedy heuristics with regret, with application to the cheapest insertion algorithm for the TSP
Greedy heuristics with regret, with application to the cheapest insertion algorithm for the TSP
2008
We consider greedy algorithms that allow partial regret. As an example we consider a...
The k-path tree matroid and its applications to survivable network design
The k-path tree matroid and its applications to survivable network design
2008
We define the k -path tree matroid, and use it to solve network design problems in...
Optimizing chemotherapy scheduling using local search heuristics
Optimizing chemotherapy scheduling using local search heuristics
2006
We develop a method for computing efficient patient-specific drug protocols. Using...
Synthesis of 2-commodity flow networks
Synthesis of 2-commodity flow networks
2004
We investigate network design under volatile conditions of link failures and traffic...
Who should be given priority in a queue?
Who should be given priority in a queue?
2006
We consider a memoryless single server queue with two classes of customers, each...
The number of solutions sufficient for solving a family of problems
The number of solutions sufficient for solving a family of problems
2005
This paper deals with families of optimization problems defined over a common set of...
Approximation algorithms for a capacitated network design problem
Approximation algorithms for a capacitated network design problem
2003
We study a capacitated network design problem with applications in local access...
The maximum saving partition problem
The maximum saving partition problem
2005
The input to the maximum saving partition problem consists of a set...
Machine scheduling with earliness, tardiness and non-execution penalties
Machine scheduling with earliness, tardiness and non-execution penalties
2005
The study of scheduling problems with earliness–tardiness (E/T) penalties is...
On the complexity of the k-customer vehicle routing problem
On the complexity of the k-customer vehicle routing problem
2005
We investigate the complexity of the k -customer vehicle routing problem: Given an...
Lexicographic local search and the p-center problem
Lexicographic local search and the p-center problem
2003
We introduce a local search strategy that suits combinatorial optimization problems...
Approximation algorithms for the metric maximum clustering problem with given cluster sizes
Approximation algorithms for the metric maximum clustering problem with given cluster sizes
2003
The input to the metric maximum clustering problem with given cluster sizes consists...
Reconstructing edge-disjoint paths
Reconstructing edge-disjoint paths
2003
For an undirected graph G = (V, E), the edge connectivity values between every pair of...
Approximation algorithms for constructing wavelength routing networks
Approximation algorithms for constructing wavelength routing networks
2002
Consider a requirement graph whose vertices represent customers and an edge represents...
Nash equilibrium and subgame perfection in observable queues
Nash equilibrium and subgame perfection in observable queues
2002
A subgame perfection refinement of Nash equilibrium is suggested for games of the...
Minimum-diameter covering problems
Minimum-diameter covering problems
2000
A set V and a collection of (possibly nondisjoint) subsets are given. Also given is a...
Restricted delivery problems on a network
Restricted delivery problems on a network
1997
We consider a delivery problem on a network in which nodes have supplies or demands...
Papers per page: