Min sum clustering with penaltiesHASSIN, Refael; OR, Einat.Lecture notes in computer science. 2005, pp 167-178, issn 0302-9743, isbn 3-540-29118-0, 1Vol, 12 p.Conference Paper

Min sum clustering with penaltiesHASSIN, Refael; OR, Einat.European journal of operational research. 2010, Vol 206, Num 3, pp 547-554, issn 0377-2217, 8 p.Article

On two restricted ancestors tree problemsGUTTMANN-BECK, Nili; HASSIN, Refael.Information processing letters. 2010, Vol 110, Num 14-15, pp 570-575, issn 0020-0190, 6 p.Article

Scheduling Arrivals to Queues : A Single-Server Model with No-ShowsHASSIN, Refael; MENDEL, Sharon.Management science. 2008, Vol 54, Num 3, pp 565-572, issn 0025-1909, 8 p.Article

Approximation algorithms for quickest spanning tree problemsHASSIN, Refael; LEVIN, Asaf.Algorithmica. 2005, Vol 41, Num 1, pp 43-52, issn 0178-4617, 10 p.Article

The set cover with pairs problemHASSIN, Refael; SEGEV, Danny.Lecture notes in computer science. 2005, pp 164-176, issn 0302-9743, isbn 3-540-30495-9, 1Vol, 13 p.Conference Paper

Strategic Behavior and Social Optimization in Markovian Vacation QueuesPENGFEI GUO; HASSIN, Refael.Operations research. 2011, Vol 59, Num 4, pp 986-997, issn 0030-364X, 12 p.Article

Who should be given priority in a queue?HASSIN, Refael; HAVIV, Moshe.Operations research letters. 2006, Vol 34, Num 2, pp 191-198, issn 0167-6377, 8 p.Article

On the complexity of the κ-customer vehicle routing problemHASSIN, Refael; RUBINSTEIN, Shlomi.Operations research letters. 2005, Vol 33, Num 1, pp 71-76, issn 0167-6377, 6 p.Article

An efficient polynomial time approximation scheme for the constrained minimum spanning tree problem using matroid intersectionHASSIN, Refael; LEVIN, Asaf.SIAM journal on computing (Print). 2004, Vol 33, Num 2, pp 261-268, issn 0097-5397, 8 p.Article

A 7/8-approximation algorithm for metric Max TSPHASSIN, Refael; RUBINSTEIN, Shlomi.Information processing letters. 2002, Vol 81, Num 5, pp 247-251, issn 0020-0190Article

z-ApproximationsHASSIN, Refael; KHULLER, Samir.Journal of algorithms (Print). 2001, Vol 41, Num 2, pp 429-442, issn 0196-6774Article

Flow trees for vertex-capacitated networksHASSIN, Refael; LEVIN, Asaf.Discrete applied mathematics. 2007, Vol 155, Num 4, pp 572-578, issn 0166-218X, 7 p.Article

An improved approximation algorithm for the metric maximum clustering problem with given cluster sizesHASSIN, Refael; RUBINSTEIN, Shlomi.Information processing letters. 2006, Vol 98, Num 3, pp 92-95, issn 0020-0190, 4 p.Article

An approximation algorithm for the minimum latency set cover problemHASSIN, Refael; LEVIN, Asaf.Lecture notes in computer science. 2005, pp 726-733, issn 0302-9743, isbn 3-540-29118-0, 1Vol, 8 p.Conference Paper

Approximation algorithms for maximum linear arrangementHASSIN, Refael; RUBINSTEIN, Shlomi.Information processing letters. 2001, Vol 80, Num 4, pp 171-177, issn 0020-0190Article

Minimum-diameter covering problemsARKIN, Esther M; HASSIN, Refael.Networks (New York, NY). 2000, Vol 36, Num 3, pp 147-155, issn 0028-3045Article

The use of relative priorities in optimizing the performance of a queueing systemHASSIN, Refael; PUERTO, Justo; FERNANDEZ, Francisco R et al.European journal of operational research. 2009, Vol 193, Num 2, pp 476-483, issn 0377-2217, 8 p.Article

A maximum profit coverage algorithm with application to small molecules cluster identificationHASSIN, Refael; OR, Einat.Lecture notes in computer science. 2006, pp 265-276, issn 0302-9743, isbn 3-540-34597-3, 1Vol, 12 p.Conference Paper

Approximation algorithms for some vehicle routing problemsBAZGAN, Cristina; HASSIN, Refael; MONNOT, Jérome et al.Discrete applied mathematics. 2005, Vol 146, Num 1, pp 27-42, issn 0166-218X, 16 p.Article

Rounding to an integral programHASSIN, Refael; SEGEV, Danny.Lecture notes in computer science. 2005, pp 44-54, issn 0302-9743, isbn 3-540-25920-1, 11 p.Conference Paper

Increasing digraph arc-connectivity by arc addition, reversal and complementARKIN, Esther M; HASSIN, Refael; SHAHAR, Shimon et al.Discrete applied mathematics. 2002, Vol 122, Num 1-3, pp 13-22, issn 0166-218XArticle

The Complexity of Bottleneck Labeled Graph ProblemsHASSIN, Refael; MONNOT, Jérôme; SEGEV, Danny et al.Algorithmica. 2010, Vol 58, Num 2, pp 245-262, issn 0178-4617, 18 p.Article

Optimizing chemotherapy scheduling using local search heuristicsAGUR, Zvia; HASSIN, Refael; LEVY, Sigal et al.Operations research. 2006, Vol 54, Num 5, pp 829-846, issn 0030-364X, 18 p.Article

Robust subgraphs for trees and pathsHASSIN, Refael; SEGEV, Danny.Lecture notes in computer science. 2004, pp 51-63, issn 0302-9743, isbn 3-540-22339-8, 13 p.Conference Paper