Refael Hassin

178 papers A* 2A 7B 5C 2Journal 144Unranked 18
YearRankTypeTitle / Venue / Authors
2025 J jnl
A strategic double-ended queuing model for shared transportation.
Queueing Syst. Theory Appl.
Yuval Brief, Refael Hassin
2024 J jnl
On partitioning minimum spanning trees.
Discret. Appl. Math.
Nili Guttmann-Beck, Refael Hassin, Michal Stern
2024 J jnl
Pricing heterogeneous products to heterogeneous customers who buy sequentially.
Ann. Oper. Res.
Refael Hassin, Justo Puerto
2023 J jnl
How Advance Sales Can Reduce Profits: When to Buy, When to Sell, and What Price to Charge.
Manuf. Serv. Oper. Manag.
Amihai Glazer, Refael Hassin, Irit Nowik
2023 J jnl
Queueing with Negative Network Effects.
Manuf. Serv. Oper. Manag.
Refael Hassin, Isaac Meilijson, Yael Perlman
2023 J jnl
Strategic behavior in queues with arrival rate uncertainty.
Eur. J. Oper. Res.
Refael Hassin, Moshe Haviv, Binyamin Oz
2022 J jnl
Integrality in the multinetwork min-cost equal-flow problem.
Networks
Refael Hassin, Renata Poznanski
2022 J jnl
On equilibrium threshold strategies when choosing between observable and unobservable queues.
Oper. Res. Lett.
Nimrod Dvir, Refael Hassin, Moshe Haviv
2022 J jnl
Profit maximization and cost balancing in queueing systems.
Queueing Syst. Theory Appl.
Refael Hassin
2021 J jnl
Equilibrium and optimal one-shot delegated search.
IISE Trans.
Refael Hassin
2021 J jnl
Greedy Differencing Edge-Contraction heuristic for the Max-Cut problem.
Oper. Res. Lett.
Refael Hassin, Nikita Leshenko
2021 J jnl
Inefficiency in stochastic queueing systems with strategic customers.
Eur. J. Oper. Res.
Souvik Ghosh, Refael Hassin
2021 J jnl
On Queue-Length Information when Customers Travel to a Queue.
Manuf. Serv. Oper. Manag.
Refael Hassin, Ricky Roet-Green
2021 J jnl
Rational joining behavior in a queueing system with abandonments.
Oper. Res. Lett.
Michal Benelli, Refael Hassin
2021 J jnl
Self-Selected Task Allocation.
Manuf. Serv. Oper. Manag.
Refael Hassin, Adam Nathaniel
2020 J jnl
Social and Monopoly Optimization in Observable Queues.
Oper. Res.
Refael Hassin, Ran I. Snitkovsky
2020 J jnl
Strategic behaviour in a tandem queue with alternating server.
Queueing Syst. Theory Appl.
Nimrod Dvir, Refael Hassin, Uri Yechiali
2020 J jnl
The Approximability of Multiple Facility Location on Directed Networks with Random Arc Failures.
Algorithmica
Refael Hassin, R. Ravi, F. Sibel Salman, Danny Segev
2019 — conf
A Closed Queueing Network with Strategic Service Differentiation.
QTNA
Michal Benelli, Refael Hassin
2019 — conf
On Rational Behavior in a Loss System with One Observable Queue and One Unobservable Queue.
QTNA
Refael Hassin, Jonathan H. P. Milo
2018 J jnl
Cascade equilibrium strategies in a two-server queueing system with inspection cost.
Eur. J. Oper. Res.
Refael Hassin, Ricky Roet-Green
2018 J jnl
On the price of anarchy in a single-server queue with heterogeneous service valuations induced by travel costs.
Eur. J. Oper. Res.
Refael Hassin, Irit Nowik, Yair Y. Shaki
2018 J jnl
Operations research applications of dichotomous search.
Eur. J. Oper. Res.
Refael Hassin, Anna Sarid
2017 J jnl
Customer equilibrium in a single-server system with virtual and system queues.
Queueing Syst. Theory Appl.
Roei Engel, Refael Hassin
2017 J jnl
Equilibrium and efficient clustering of arrival times to a queue.
CoRR
Amihai Glazer, Refael Hassin, Liron Ravner
2017 J jnl
Multiple facility location on a network with linear reliability order of edges.
J. Comb. Optim.
Refael Hassin, R. Ravi, F. Sibel Salman
2017 J jnl
Profit maximization in the M/M/1 queue.
Oper. Res. Lett.
Refael Hassin, Alexandra Koshman-Kaz
2017 — conf
Self, Social and Monopoly Optimization in Observable Queues.
VALUETOOLS
Refael Hassin, Ran I. Snitkovsky
2017 J jnl
Strategic customer behavior in a queueing system with a loss subsystem.
Queueing Syst. Theory Appl.
Refael Hassin, Ran I. Snitkovsky
2017 J jnl
The Impact of Inspection Cost on Equilibrium, Revenue, and Social Welfare in a Single-Server Queue.
Oper. Res.
Refael Hassin, Ricky Roet-Green
2015 J jnl
Equilibrium strategies for placing duplicate orders in a single server queue.
Oper. Res. Lett.
Pengfei Guo, Refael Hassin
2015 J jnl
Optimal Control of a Queue With High-Low Delay Announcements: The Significance of the Queue.
EAI Endorsed Trans. Energy Web
Alexandra Koshman-Kaz, Refael Hassin
2015 J jnl
Sequential scheduling on identical machines.
Oper. Res. Lett.
Refael Hassin, Uri Yovel
2015 J jnl
Strategic Overtaking in a Monopolistic M/M/1 Queue.
IEEE Trans. Autom. Control.
Jenny Erlichman, Refael Hassin
2014 — conf
Optimal Control of a Queue With High-Low Delay Announcements: The Significance of the Queue.
VALUETOOLS
Alexandra Koshman-Kaz, Refael Hassin
2014 J jnl
Regulation under partial cooperation: The case of a queueing system.
Oper. Res. Lett.
Gail Gilboa-Freedman, Refael Hassin
2014 J jnl
The Price of Anarchy in the Markovian Single Server Queue.
IEEE Trans. Autom. Control.
Gail Gilboa-Freedman, Refael Hassin, Yoav Kerner
2013 J jnl
A local search algorithm for binary maximum 2-path partitioning.
Discret. Optim.
Refael Hassin, Ohad Schneider
2013 J jnl
On the advantage of leadership in service pricing competition.
Oper. Res. Lett.
Pengfei Guo, Refael Hassin
2012 — conf
Information cascades in a queueing system with parallel servers.
VALUETOOLS
Refael Hassin, Ricky Roet-Green
2012 J jnl
Series-parallel orientations preserving the cycle-radius.
Inf. Process. Lett.
Nili Guttmann-Beck, Refael Hassin
2012 J jnl
Strategic behavior and social optimization in Markovian vacation queues: The case of heterogeneous customers.
Eur. J. Oper. Res.
Pengfei Guo, Refael Hassin
2012 J jnl
The (K, k)-capacitated spanning tree problem.
Discret. Optim.
Esther M. Arkin, Nili Guttmann-Beck, Refael Hassin
2011 J jnl
Minimum diameter and cycle-diameter orientations on planar graphs
CoRR
Nili Guttmann-Beck, Refael Hassin
2011 J jnl
On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph.
Discret. Optim.
Nili Guttmann-Beck, Refael Hassin
2011 J jnl
Strategic Behavior and Social Optimization in Markovian Vacation Queues.
Oper. Res.
Pengfei Guo, Refael Hassin
2010 J jnl
Inducing search by periodic advertising.
Inf. Econ. Policy
Amihai Glazer, Refael Hassin
2010 J jnl
Min sum clustering with penalties.
Eur. J. Oper. Res.
Refael Hassin, Einat Or
2010 J jnl
Multi-Color Pebble Motion on Graphs.
Algorithmica
Gilad Goraly, Refael Hassin
2010 J jnl
On two restricted ancestors tree problems.
Inf. Process. Lett.
Nili Guttmann-Beck, Refael Hassin
2010 C conf
The (
AAIM
Esther M. Arkin, Nili Guttmann-Beck, Refael Hassin
2010 J jnl
The Complexity of Bottleneck Labeled Graph Problems.
Algorithmica
Refael Hassin, Jérôme Monnot, Danny Segev
2009 J jnl
Approximating the minimum quadratic assignment problems.
ACM Trans. Algorithms
Refael Hassin, Asaf Levin, Maxim Sviridenko
2009 J jnl
Approximation algorithms for maximum latency and partial cycle cover.
Discret. Optim.
Refael Hassin, Asaf Levin, Shlomi Rubinstein
2009 J jnl
Equilibrium customers' choice between FCFS and random servers.
Queueing Syst. Theory Appl.
Refael Hassin
2009 — conf
Equilibrium solutions in the observable
VALUETOOLS
Jenny Erlichman, Refael Hassin
2009 J jnl
The use of relative priorities in optimizing the performance of a queueing system.
Eur. J. Oper. Res.
Refael Hassin, Justo Puerto, Francisco R. Fernández
2009 A conf
Tractable Cases of Facility Location on a Network with a Linear Reliability Order of Links.
ESA
Refael Hassin, R. Ravi, F. Sibel Salman
2008 J jnl
Greedy heuristics with regret, with application to the cheapest insertion algorithm for the TSP.
Oper. Res. Lett.
Refael Hassin, Ariel Keinan
2008 J jnl
Rounding to an integral program.
Oper. Res. Lett.
Refael Hassin, Danny Segev
2008 J jnl
Scheduling Arrivals to Queues: A Single-Server Model with No-Shows.
Manag. Sci.
Refael Hassin, Sharon Mendel
2008 J jnl
The k-path tree matroid and its applications to survivable network design.
Discret. Optim.
Esther M. Arkin, Refael Hassin
2007 J jnl
Approximation algorithms and hardness results for labeled connectivity problems.
J. Comb. Optim.
Refael Hassin, Jérôme Monnot, Danny Segev
2007 J jnl
Flow trees for vertex-capacitated networks.
Discret. Appl. Math.
Refael Hassin, Asaf Levin
2007 B conf
The Complexity of Bottleneck Labeled Graph Problems.
WG
Refael Hassin, Jérôme Monnot, Danny Segev
2006 — conf
A Maximum Profit Coverage Algorithm with Application to Small Molecules Cluster Identification.
WEA
Refael Hassin, Einat Or
2006 J jnl
An approximation algorithm for maximum triangle packing.
Discret. Appl. Math.
Refael Hassin, Shlomi Rubinstein
2006 J jnl
An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes.
Inf. Process. Lett.
Refael Hassin, Shlomi Rubinstein
2006 B conf
Approximation Algorithms and Hardness Results for Labeled Connectivity Problems.
MFCS
Refael Hassin, Jérôme Monnot, Danny Segev
2006 J jnl
Approximations for minimum and min-max vehicle routing problems.
J. Algorithms
Esther M. Arkin, Refael Hassin, Asaf Levin
2006 J jnl
Erratum to "An approximation algorithm for maximum triangle packing": [Discrete Applied Mathematics 154 (2006) 971-979].
Discret. Appl. Math.
Refael Hassin, Shlomi Rubinstein
2006 J jnl
Optimizing Chemotherapy Scheduling Using Local Search Heuristics.
Oper. Res.
Zvia Agur, Refael Hassin, Sigal Levy
2006 J jnl
Robust subgraphs for trees and paths.
ACM Trans. Algorithms
Refael Hassin, Danny Segev
2006 J jnl
The minimum generalized vertex cover problem.
ACM Trans. Algorithms
Refael Hassin, Asaf Levin
2006 J jnl
Who should be given priority in a queue?
Oper. Res. Lett.
Refael Hassin, Moshe Haviv
2005 J jnl
A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem.
SIAM J. Comput.
Refael Hassin, Asaf Levin
2005 A conf
An Approximation Algorithm for the Minimum Latency Set Cover Problem.
ESA
Refael Hassin, Asaf Levin
2005 J jnl
Approximation Algorithms for Quickest Spanning Tree Problems.
Algorithmica
Refael Hassin, Asaf Levin
2005 J jnl
Approximation algorithms for some vehicle routing problems.
Discret. Appl. Math.
Cristina Bazgan, Refael Hassin, Jérôme Monnot
2005 J jnl
Equilibrium in Queueing Systems with Complementary Products.
Queueing Syst. Theory Appl.
Ari Veltman, Refael Hassin
2005 J jnl
Machine scheduling with earliness, tardiness and non-execution penalties.
Comput. Oper. Res.
Refael Hassin, Mati Shani
2005 A conf
Min Sum Clustering with Penalties.
ESA
Refael Hassin, Einat Or
2005 J jnl
On the complexity of the
Oper. Res. Lett.
Refael Hassin, Shlomi Rubinstein
2005 — conf
Rounding to an Integral Program.
WEA
Refael Hassin, Danny Segev
2005 B conf
The Multi-radius Cover Problem.
WADS
Refael Hassin, Danny Segev
2005 J jnl
The Number of Solutions Sufficient for Solving a Family of Problems.
Math. Oper. Res.
Ori Einstein, Refael Hassin
2005 — conf
The Set Cover with Pairs Problem.
FSTTCS
Refael Hassin, Danny Segev
2005 J jnl
The maximum saving partition problem.
Oper. Res. Lett.
Refael Hassin, Jérôme Monnot
2004 A conf
An Approximation Algorithm for Maximum Triangle Packing.
ESA
Refael Hassin, Shlomi Rubinstein
2004 J jnl
An efficient polynomial time approximation scheme for the constrained minimum spanning tree problem using matroid intersection.
SIAM J. Comput.
Refael Hassin, Asaf Levin
2004 A conf
Approximation Algorithms for Quickest Spanning Tree Problems.
ESA
Refael Hassin, Asaf Levin
2004 J jnl
Approximation Algorithms for a Capacitated Network Design Problem.
Algorithmica
Refael Hassin, R. Ravi, F. Sibel Salman
2004 J jnl
Approximations for Maximum Transportation with Permutable Supply Vector and Other Capacitated Star Packing Problems.
Algorithmica
Esther M. Arkin, Refael Hassin, Shlomi Rubinstein, Maxim Sviridenko
2004 J jnl
Minimum restricted diameter spanning trees.
Discret. Appl. Math.
Refael Hassin, Asaf Levin
2004 — conf
Robust Subgraphs for Trees and Paths.
SWAT
Refael Hassin, Danny Segev
2004 J jnl
Synthesis of 2-Commodity Flow Networks.
Math. Oper. Res.
Refael Hassin, Asaf Levin
2003 J jnl
Approximation algorithms for the metric maximum clustering problem with given cluster sizes.
Oper. Res. Lett.
Refael Hassin, Shlomi Rubinstein
2003 J jnl
Capacitated vertex covering.
J. Algorithms
Sudipto Guha, Refael Hassin, Samir Khuller, Einat Or
2003 C conf
Differential Approximation for Some Routing Problems.
CIAC
Cristina Bazgan, Refael Hassin, Jérôme Monnot
2003 J jnl
Lexicographic local search and the p.
Eur. J. Oper. Res.
Refael Hassin, Asaf Levin, Dana Morad
2003 J jnl
Minimum spanning tree with hop restrictions.
J. Algorithms
Refael Hassin, Asaf Levin
2003 J jnl
Reconstructing edge-disjoint paths.
Oper. Res. Lett.
Michele Conforti, Refael Hassin, R. Ravi
2003 J jnl
Subgraphs decomposable into two trees and k-edge-connected subgraphs.
Discret. Appl. Math.
Refael Hassin, Asaf Levin
2003 A conf
The Minimum Generalized Vertex Cover Problem.
ESA
Refael Hassin, Asaf Levin
2002 J jnl
A 7/8-approximation algorithm for metric Max TSP.
Inf. Process. Lett.
Refael Hassin, Shlomi Rubinstein
2002 J jnl
A note on orientations of mixed graphs.
Discret. Appl. Math.
Esther M. Arkin, Refael Hassin
2002 J jnl
Approximation algorithms for constructing wavelength routing networks.
Networks
Refael Hassin, Asaf Levin
2002 — conf
Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems.
SWAT
Esther M. Arkin, Refael Hassin, Shlomi Rubinstein, Maxim Sviridenko
2002 A* conf
Capacitated vertex covering with applications.
SODA
Sudipto Guha, Refael Hassin, Samir Khuller, Einat Or
2002 J jnl
Complexity of finding dense subgraphs.
Discret. Appl. Math.
Yuichi Asahiro, Refael Hassin, Kazuo Iwama
2002 J jnl
Increasing digraph arc-connectivity by arc addition, reversal and complement.
Discret. Appl. Math.
Esther M. Arkin, Refael Hassin, Shimon Shahar
2002 — conf
Minimum Restricted Diameter Spanning Trees.
APPROX
Refael Hassin, Asaf Levin
2002 J jnl
Nash Equilibrium and Subgame Perfection in Observable Queues.
Ann. Oper. Res.
Refael Hassin, Moshe Haviv
2002 J jnl
Robust Matchings.
SIAM J. Discret. Math.
Refael Hassin, Shlomi Rubinstein
2001 J jnl
A 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts.
SIAM J. Discret. Math.
Alexander A. Ageev, Refael Hassin, Maxim Sviridenko
2001 B conf
A 7/8-Approximation Algorithm for Metric Max TSP.
WADS
Refael Hassin, Shlomi Rubinstein
2001 J jnl
Approximating the maximum quadratic assignment problem.
Inf. Process. Lett.
Esther M. Arkin, Refael Hassin, Maxim Sviridenko
2001 J jnl
Approximation algorithms for maximum linear arrangement.
Inf. Process. Lett.
Refael Hassin, Shlomi Rubinstein
2001 B conf
Synthesis of 2-Commodity Flow Networks.
IPCO
Refael Hassin, Asaf Levin
2001 J jnl
z-Approximations.
J. Algorithms
Refael Hassin, Samir Khuller
2000 — conf
An approximation algorithm for MAX DICUT with given sizes of parts.
APPROX
Alexander A. Ageev, Refael Hassin, Maxim Sviridenko
2000 A* conf
Approximating the maximum quadratic assignment problem.
SODA
Esther M. Arkin, Refael Hassin
2000 — conf
Approximation Algorithms for Maximum Linear Arrangement.
SWAT
Refael Hassin, Shlomi Rubinstein
2000 J jnl
Approximation Algorithms for Minimum
Algorithmica
Nili Guttmann-Beck, Refael Hassin
2000 J jnl
Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem.
Algorithmica
Nili Guttmann-Beck, Refael Hassin, Samir Khuller, Balaji Raghavachari
2000 — conf
Approximation algorithms for a capacitated network design problem.
APPROX
Refael Hassin, R. Ravi, F. Sibel Salman
2000 J jnl
Better approximations for max TSP.
Inf. Process. Lett.
Refael Hassin, Shlomi Rubinstein
2000 J jnl
Minimum-diameter covering problems.
Networks
Esther M. Arkin, Refael Hassin
2000 — conf
Robust Matchings and Maximum Clustering.
SWAT
Refael Hassin, Shlomi Rubinstein
1999 J jnl
Scheduling maintenance services to three machines.
Ann. Oper. Res.
Shoshana Anily, Celia A. Glass, Refael Hassin
1998 J jnl
An Approximation Algorithm for the Maximum Traveling Salesman Problem.
Inf. Process. Lett.
Refael Hassin, Shlomi Rubinstein
1998 J jnl
Approximation Algorithms for Min-sum p-clustering.
Discret. Appl. Math.
Nili Guttmann-Beck, Refael Hassin
1998 J jnl
Approximation Algorithms for Minimum Tree Partition.
Discret. Appl. Math.
Nili Guttmann-Beck, Refael Hassin
1998 — conf
Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem.
FSTTCS
Nili Guttmann-Beck, Refael Hassin, Samir Khuller, Balaji Raghavachari
1998 J jnl
Graph partitions with minimum degree constraints.
Discret. Math.
Esther M. Arkin, Refael Hassin
1998 J jnl
On Local Search for Weighted
Math. Oper. Res.
Esther M. Arkin, Refael Hassin
1998 J jnl
The Scheduling of Maintenance Service.
Discret. Appl. Math.
Shoshana Anily, Celia A. Glass, Refael Hassin
1997 J jnl
An Approximation Algorithm for Maximum Packing of 3-Edge Paths.
Inf. Process. Lett.
Refael Hassin, Shlomi Rubinstein
1997 J jnl
Approximation Algorithms for Min-Max Tree Partition.
J. Algorithms
Nili Guttmann-Beck, Refael Hassin
1997 J jnl
Approximation algorithms for maximum dispersion.
Oper. Res. Lett.
Refael Hassin, Shlomi Rubinstein, Arie Tamir
1997 J jnl
Equilibrium Threshold Strategies: The Case of Queues with Priorities.
Oper. Res.
Refael Hassin, Moshe Haviv
1997 A conf
On Local Search for Weighted k-Set Packing.
ESA
Esther M. Arkin, Refael Hassin
1997 J jnl
Restricted delivery problems on a network.
Networks
Esther M. Arkin, Refael Hassin, Limor Klein
1996 J jnl
A Flow Algorithm for Network Synchronization.
Oper. Res.
Refael Hassin
1995 J jnl
Equilibrium strategies for queues with impatient customers.
Oper. Res. Lett.
Refael Hassin, Moshe Haviv
1995 J jnl
On the Minimum Diameter Spanning Tree Problem.
Inf. Process. Lett.
Refael Hassin, Arie Tamir
1995 J jnl
optimal Separable Partitioning in the Plane.
Discret. Appl. Math.
Michal Benelli, Refael Hassin
1994 J jnl
Approximation Algorithms for the Geometric Covering Salesman Problem.
Discret. Appl. Math.
Esther M. Arkin, Refael Hassin
1994 J jnl
Approximations for the Maximum Acyclic Subgraph Problem.
Inf. Process. Lett.
Refael Hassin, Shlomi Rubinstein
1994 J jnl
Maximizing the Number of Unused Colors in the Vertex Coloring Problem.
Inf. Process. Lett.
Refael Hassin, Shlomo Lahav
1993 J jnl
Approximating the Tree and Tour Covers of a Graph.
Inf. Process. Lett.
Esther M. Arkin, Magnús M. Halldórsson, Refael Hassin
1993 J jnl
Monotonicity and Efficient Computation of Optimal Dichotomous Search.
Discret. Appl. Math.
Refael Hassin, Mordechai I. Henig
1992 J jnl
Algorithms for the minimum cost circulation problem based on maximizing the mean improvement.
Oper. Res. Lett.
Refael Hassin
1992 J jnl
Approximation Schemes for the Restricted Shortest Path Problem.
Math. Oper. Res.
Refael Hassin
1992 J jnl
Mean Passage Times and Nearly Uncoupled Markov Chains.
SIAM J. Discret. Math.
Refael Hassin, Moshe Haviv
1992 J jnl
The swapping problem.
Networks
Shoshana Anily, Refael Hassin
1991 J jnl
Approximation algorithms for hitting objects with straight lines.
Discret. Appl. Math.
Refael Hassin, Nimrod Megiddo
1991 J jnl
Exact Computation of Optimal Inventory Policies Over an Unbounded Horizon.
Math. Oper. Res.
Refael Hassin, Nimrod Megiddo
1991 J jnl
Improved complexity bounds for location problems on the real line.
Oper. Res. Lett.
Refael Hassin, Arie Tamir
1991 J jnl
Multiterminal xcut problems.
Ann. Oper. Res.
Refael Hassin
1990 — conf
Simultaneous Solution of Families of Problems.
SIGAL International Symposium on Algorithms
Refael Hassin
1989 J jnl
Maximizing Classes of Two-Parameter Objectives Over Matroids.
Math. Oper. Res.
Refael Hassin, Arie Tamir
1989 J jnl
Ranking the Best Binary Trees.
SIAM J. Comput.
Shoshana Anily, Refael Hassin
1988 J jnl
Probabilistic Analysis of the Capacitated Transportation Problem.
Math. Oper. Res.
Refael Hassin, Eitan Zemel
1988 J jnl
Solution Bases of Multiterminal Cut Problems.
Math. Oper. Res.
Refael Hassin
1987 J jnl
Equilibrium Arrivals in Queues with Bulk Service at Scheduled Times.
Transp. Sci.
Amihai Glazer, Refael Hassin
1986 J jnl
A Deterministic Single-Item Inventory Model with Seller Holding Cost and Buyer Holding and Shortage Costs.
Oper. Res.
Amihai Glazer, Refael Hassin
1986 J jnl
Multi-terminal maximum flows in node-capacitated networks.
Discret. Appl. Math.
Frieda Granot, Refael Hassin
1985 J jnl
An O(n log
SIAM J. Comput.
Refael Hassin, Donald B. Johnson
1985 J jnl
An Optimal Algorithm for Finding all the Jumps of a Monotone Step-Function.
J. Algorithms
Refael Hassin, Nimrod Megiddo
1985 J jnl
On Shortest Paths in Graphs with Random Weights.
Math. Oper. Res.
Refael Hassin, Eitan Zemel
1984 J jnl
A Dichotomous Search for a Geometric Random Variable.
Oper. Res.
Refael Hassin
1984 J jnl
Dichotomous Search for Random Objects on an Interval.
Math. Oper. Res.
Refael Hassin, Mordechai I. Henig
1984 J jnl
On multicommodity flows in planar graphs.
Networks
Refael Hassin
1983 J jnl
The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm.
Math. Program.
Refael Hassin
1982 J jnl
Minimum cost flow with set-constraints.
Networks
Refael Hassin
1981 J jnl
Generalizations of Hoffman's existence theorem for circulations.
Networks
Refael Hassin
1981 J jnl
Maximum Flow in (s, t) Planar Networks.
Inf. Process. Lett.
Refael Hassin