default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRefael Hassin
Person information
- affiliation: Tel Aviv University, Israel
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j141]Refael Hassin
, Justo Puerto:
Pricing heterogeneous products to heterogeneous customers who buy sequentially. Ann. Oper. Res. 340(2): 863-890 (2024)- [j140]Nili Guttmann-Beck, Refael Hassin, Michal Stern:
On partitioning minimum spanning trees. Discret. Appl. Math. 359: 45-54 (2024) - 2023
- [j139]Refael Hassin, Moshe Haviv, Binyamin Oz:
Strategic behavior in queues with arrival rate uncertainty. Eur. J. Oper. Res. 309(1): 217-224 (2023) - [j138]Amihai Glazer, Refael Hassin, Irit Nowik:
How Advance Sales Can Reduce Profits: When to Buy, When to Sell, and What Price to Charge. Manuf. Serv. Oper. Manag. 25(5): 1730-1747 (2023) - [j137]Refael Hassin, Isaac Meilijson, Yael Perlman:
Queueing with Negative Network Effects. Manuf. Serv. Oper. Manag. 25(5): 1984-1998 (2023) - 2022
- [j136]Refael Hassin, Renata Poznanski:
Integrality in the multinetwork min-cost equal-flow problem. Networks 80(3): 267-273 (2022) - [j135]Nimrod Dvir, Refael Hassin, Moshe Haviv:
On equilibrium threshold strategies when choosing between observable and unobservable queues. Oper. Res. Lett. 50(5): 555-560 (2022) - [j134]Refael Hassin:
Profit maximization and cost balancing in queueing systems. Queueing Syst. Theory Appl. 100(3-4): 429-431 (2022) - 2021
- [j133]Souvik Ghosh, Refael Hassin:
Inefficiency in stochastic queueing systems with strategic customers. Eur. J. Oper. Res. 295(1): 1-11 (2021) - [j132]Refael Hassin:
Equilibrium and optimal one-shot delegated search. IISE Trans. 53(8): 928-941 (2021) - [j131]Refael Hassin, Ricky Roet-Green:
On Queue-Length Information when Customers Travel to a Queue. Manuf. Serv. Oper. Manag. 23(4): 989-1004 (2021) - [j130]Refael Hassin, Adam Nathaniel:
Self-Selected Task Allocation. Manuf. Serv. Oper. Manag. 23(6): 1669-1682 (2021) - [j129]Refael Hassin, Nikita Leshenko:
Greedy Differencing Edge-Contraction heuristic for the Max-Cut problem. Oper. Res. Lett. 49(3): 320-325 (2021) - [j128]Michal Benelli, Refael Hassin:
Rational joining behavior in a queueing system with abandonments. Oper. Res. Lett. 49(3): 426-430 (2021) - 2020
- [j127]Refael Hassin, R. Ravi, F. Sibel Salman, Danny Segev:
The Approximability of Multiple Facility Location on Directed Networks with Random Arc Failures. Algorithmica 82(9): 2474-2501 (2020) - [j126]Refael Hassin, Ran I. Snitkovsky:
Social and Monopoly Optimization in Observable Queues. Oper. Res. 68(4): 1178-1198 (2020) - [j125]Nimrod Dvir, Refael Hassin, Uri Yechiali:
Strategic behaviour in a tandem queue with alternating server. Queueing Syst. Theory Appl. 96(3-4): 205-244 (2020)
2010 – 2019
- 2019
- [c34]Michal Benelli, Refael Hassin:
A Closed Queueing Network with Strategic Service Differentiation. QTNA 2019: 149-165 - [c33]Refael Hassin, Jonathan H. P. Milo:
On Rational Behavior in a Loss System with One Observable Queue and One Unobservable Queue. QTNA 2019: 166-182 - 2018
- [j124]Refael Hassin, Irit Nowik, Yair Y. Shaki:
On the price of anarchy in a single-server queue with heterogeneous service valuations induced by travel costs. Eur. J. Oper. Res. 265(2): 580-588 (2018) - [j123]Refael Hassin, Anna Sarid:
Operations research applications of dichotomous search. Eur. J. Oper. Res. 265(3): 795-812 (2018) - [j122]Refael Hassin, Ricky Roet-Green:
Cascade equilibrium strategies in a two-server queueing system with inspection cost. Eur. J. Oper. Res. 267(3): 1014-1026 (2018) - 2017
- [j121]Refael Hassin, Ricky Roet-Green:
The Impact of Inspection Cost on Equilibrium, Revenue, and Social Welfare in a Single-Server Queue. Oper. Res. 65(3): 804-820 (2017) - [j120]Refael Hassin, R. Ravi, F. Sibel Salman:
Multiple facility location on a network with linear reliability order of edges. J. Comb. Optim. 34(3): 931-955 (2017) - [j119]Refael Hassin, Alexandra Koshman-Kaz:
Profit maximization in the M/M/1 queue. Oper. Res. Lett. 45(5): 436-441 (2017) - [j118]Refael Hassin, Ran I. Snitkovsky:
Strategic customer behavior in a queueing system with a loss subsystem. Queueing Syst. Theory Appl. 86(3-4): 361-387 (2017) - [j117]Roei Engel, Refael Hassin:
Customer equilibrium in a single-server system with virtual and system queues. Queueing Syst. Theory Appl. 87(1-2): 161-180 (2017) - [c32]Refael Hassin, Ran I. Snitkovsky:
Self, Social and Monopoly Optimization in Observable Queues. VALUETOOLS 2017: 214-220 - [i2]Amihai Glazer, Refael Hassin, Liron Ravner:
Equilibrium and efficient clustering of arrival times to a queue. CoRR abs/1701.04776 (2017) - 2015
- [j116]Alexandra Koshman-Kaz, Refael Hassin:
Optimal Control of a Queue With High-Low Delay Announcements: The Significance of the Queue. EAI Endorsed Trans. Energy Web 2(7): e3 (2015) - [j115]Pengfei Guo, Refael Hassin:
Equilibrium strategies for placing duplicate orders in a single server queue. Oper. Res. Lett. 43(3): 343-348 (2015) - [j114]Refael Hassin, Uri Yovel:
Sequential scheduling on identical machines. Oper. Res. Lett. 43(5): 530-533 (2015) - [j113]Jenny Erlichman, Refael Hassin:
Strategic Overtaking in a Monopolistic M/M/1 Queue. IEEE Trans. Autom. Control. 60(8): 2189-2194 (2015) - 2014
- [j112]Gail Gilboa-Freedman, Refael Hassin:
Regulation under partial cooperation: The case of a queueing system. Oper. Res. Lett. 42(3): 217-221 (2014) - [j111]Gail Gilboa-Freedman, Refael Hassin, Yoav Kerner:
The Price of Anarchy in the Markovian Single Server Queue. IEEE Trans. Autom. Control. 59(2): 455-459 (2014) - [c31]Alexandra Koshman-Kaz, Refael Hassin:
Optimal Control of a Queue With High-Low Delay Announcements: The Significance of the Queue. VALUETOOLS 2014 - 2013
- [j110]Refael Hassin, Ohad Schneider:
A local search algorithm for binary maximum 2-path partitioning. Discret. Optim. 10(4): 333-360 (2013) - [j109]Pengfei Guo, Refael Hassin:
On the advantage of leadership in service pricing competition. Oper. Res. Lett. 41(4): 397-402 (2013) - 2012
- [j108]Esther M. Arkin, Nili Guttmann-Beck, Refael Hassin:
The (K, k)-capacitated spanning tree problem. Discret. Optim. 9(4): 258-266 (2012) - [j107]Pengfei Guo, Refael Hassin:
Strategic behavior and social optimization in Markovian vacation queues: The case of heterogeneous customers. Eur. J. Oper. Res. 222(2): 278-286 (2012) - [j106]Nili Guttmann-Beck, Refael Hassin:
Series-parallel orientations preserving the cycle-radius. Inf. Process. Lett. 112(4): 153-160 (2012) - [c30]Refael Hassin, Ricky Roet-Green:
Information cascades in a queueing system with parallel servers. VALUETOOLS 2012: 31-37 - 2011
- [j105]Nili Guttmann-Beck, Refael Hassin:
On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph. Discret. Optim. 8(2): 302-314 (2011) - [j104]Pengfei Guo, Refael Hassin:
Strategic Behavior and Social Optimization in Markovian Vacation Queues. Oper. Res. 59(4): 986-997 (2011) - [i1]Nili Guttmann-Beck, Refael Hassin:
Minimum diameter and cycle-diameter orientations on planar graphs. CoRR abs/1105.4770 (2011) - 2010
- [j103]Refael Hassin, Jérôme Monnot, Danny Segev:
The Complexity of Bottleneck Labeled Graph Problems. Algorithmica 58(2): 245-262 (2010) - [j102]Gilad Goraly, Refael Hassin:
Multi-Color Pebble Motion on Graphs. Algorithmica 58(3): 610-636 (2010) - [j101]Refael Hassin, Einat Or:
Min sum clustering with penalties. Eur. J. Oper. Res. 206(3): 547-554 (2010) - [j100]Amihai Glazer, Refael Hassin:
Inducing search by periodic advertising. Inf. Econ. Policy 22(3): 276-286 (2010) - [j99]Nili Guttmann-Beck, Refael Hassin:
On two restricted ancestors tree problems. Inf. Process. Lett. 110(14-15): 570-575 (2010) - [c29]Esther M. Arkin, Nili Guttmann-Beck, Refael Hassin:
The (K, k)-Capacitated Spanning Tree Problem. AAIM 2010: 25-34
2000 – 2009
- 2009
- [j98]Refael Hassin, Asaf Levin, Shlomi Rubinstein:
Approximation algorithms for maximum latency and partial cycle cover. Discret. Optim. 6(2): 197-205 (2009) - [j97]Refael Hassin, Justo Puerto, Francisco R. Fernández:
The use of relative priorities in optimizing the performance of a queueing system. Eur. J. Oper. Res. 193(2): 476-483 (2009) - [j96]Refael Hassin:
Equilibrium customers' choice between FCFS and random servers. Queueing Syst. Theory Appl. 62(3): 243-254 (2009) - [j95]Refael Hassin, Asaf Levin, Maxim Sviridenko:
Approximating the minimum quadratic assignment problems. ACM Trans. Algorithms 6(1): 18:1-18:10 (2009) - [c28]Refael Hassin, R. Ravi, F. Sibel Salman:
Tractable Cases of Facility Location on a Network with a Linear Reliability Order of Links. ESA 2009: 275-276 - [c27]Jenny Erlichman, Refael Hassin:
Equilibrium solutions in the observable M/M/1 queue with overtaking. VALUETOOLS 2009: 64 - 2008
- [j94]Esther M. Arkin, Refael Hassin:
The k-path tree matroid and its applications to survivable network design. Discret. Optim. 5(2): 314-322 (2008) - [j93]Refael Hassin, Sharon Mendel:
Scheduling Arrivals to Queues: A Single-Server Model with No-Shows. Manag. Sci. 54(3): 565-572 (2008) - [j92]Refael Hassin, Ariel Keinan:
Greedy heuristics with regret, with application to the cheapest insertion algorithm for the TSP. Oper. Res. Lett. 36(2): 243-246 (2008) - [j91]Refael Hassin, Danny Segev:
Rounding to an integral program. Oper. Res. Lett. 36(3): 321-326 (2008) - 2007
- [j90]Refael Hassin, Asaf Levin:
Flow trees for vertex-capacitated networks. Discret. Appl. Math. 155(4): 572-578 (2007) - [j89]Refael Hassin, Jérôme Monnot, Danny Segev:
Approximation algorithms and hardness results for labeled connectivity problems. J. Comb. Optim. 14(4): 437-453 (2007) - [c26]Refael Hassin, Jérôme Monnot, Danny Segev:
The Complexity of Bottleneck Labeled Graph Problems. WG 2007: 328-340 - 2006
- [j88]Refael Hassin, Shlomi Rubinstein:
An approximation algorithm for maximum triangle packing. Discret. Appl. Math. 154(6): 971-979 (2006) - [j87]Refael Hassin, Shlomi Rubinstein:
Erratum to "An approximation algorithm for maximum triangle packing": [Discrete Applied Mathematics 154 (2006) 971-979]. Discret. Appl. Math. 154(18): 2620 (2006) - [j86]Zvia Agur, Refael Hassin, Sigal Levy:
Optimizing Chemotherapy Scheduling Using Local Search Heuristics. Oper. Res. 54(5): 829-846 (2006) - [j85]Refael Hassin, Shlomi Rubinstein:
An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes. Inf. Process. Lett. 98(3): 92-95 (2006) - [j84]Esther M. Arkin, Refael Hassin, Asaf Levin:
Approximations for minimum and min-max vehicle routing problems. J. Algorithms 59(1): 1-18 (2006) - [j83]Refael Hassin, Moshe Haviv:
Who should be given priority in a queue? Oper. Res. Lett. 34(2): 191-198 (2006) - [j82]Refael Hassin, Asaf Levin:
The minimum generalized vertex cover problem. ACM Trans. Algorithms 2(1): 66-78 (2006) - [j81]Refael Hassin, Danny Segev:
Robust subgraphs for trees and paths. ACM Trans. Algorithms 2(2): 263-281 (2006) - [c25]Refael Hassin, Jérôme Monnot, Danny Segev:
Approximation Algorithms and Hardness Results for Labeled Connectivity Problems. MFCS 2006: 480-491 - [c24]Refael Hassin, Einat Or:
A Maximum Profit Coverage Algorithm with Application to Small Molecules Cluster Identification. WEA 2006: 265-276 - 2005
- [j80]Refael Hassin, Asaf Levin:
Approximation Algorithms for Quickest Spanning Tree Problems. Algorithmica 41(1): 43-52 (2005) - [j79]Refael Hassin, Mati Shani:
Machine scheduling with earliness, tardiness and non-execution penalties. Comput. Oper. Res. 32: 683-705 (2005) - [j78]Cristina Bazgan, Refael Hassin, Jérôme Monnot:
Approximation algorithms for some vehicle routing problems. Discret. Appl. Math. 146(1): 27-42 (2005) - [j77]Ori Einstein, Refael Hassin:
The Number of Solutions Sufficient for Solving a Family of Problems. Math. Oper. Res. 30(4): 880-896 (2005) - [j76]Refael Hassin, Shlomi Rubinstein:
On the complexity of the k-customer vehicle routing problem. Oper. Res. Lett. 33(1): 71-76 (2005) - [j75]Refael Hassin, Jérôme Monnot:
The maximum saving partition problem. Oper. Res. Lett. 33(3): 242-248 (2005) - [j74]Ari Veltman, Refael Hassin:
Equilibrium in Queueing Systems with Complementary Products. Queueing Syst. Theory Appl. 50(2-3): 325-342 (2005) - [j73]Refael Hassin, Asaf Levin:
A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem. SIAM J. Comput. 35(1): 189-200 (2005) - [c23]Refael Hassin, Einat Or:
Min Sum Clustering with Penalties. ESA 2005: 167-178 - [c22]Refael Hassin, Asaf Levin:
An Approximation Algorithm for the Minimum Latency Set Cover Problem. ESA 2005: 726-733 - [c21]Refael Hassin, Danny Segev:
The Set Cover with Pairs Problem. FSTTCS 2005: 164-176 - [c20]Refael Hassin, Danny Segev:
The Multi-radius Cover Problem. WADS 2005: 24-35 - [c19]Refael Hassin, Danny Segev:
Rounding to an Integral Program. WEA 2005: 44-54 - 2004
- [j72]Refael Hassin, R. Ravi, F. Sibel Salman:
Approximation Algorithms for a Capacitated Network Design Problem. Algorithmica 38(3): 417-431 (2004) - [j71]Esther M. Arkin, Refael Hassin, Shlomi Rubinstein, Maxim Sviridenko:
Approximations for Maximum Transportation with Permutable Supply Vector and Other Capacitated Star Packing Problems. Algorithmica 39(2): 175-187 (2004) - [j70]Refael Hassin, Asaf Levin:
Minimum restricted diameter spanning trees. Discret. Appl. Math. 137(3): 343-357 (2004) - [j69]Refael Hassin, Asaf Levin:
Synthesis of 2-Commodity Flow Networks. Math. Oper. Res. 29(2): 280-288 (2004) - [j68]Refael Hassin, Asaf Levin:
An efficient polynomial time approximation scheme for the constrained minimum spanning tree problem using matroid intersection. SIAM J. Comput. 33(2): 261-268 (2004) - [c18]Refael Hassin, Asaf Levin:
Approximation Algorithms for Quickest Spanning Tree Problems. ESA 2004: 395-402 - [c17]Refael Hassin, Shlomi Rubinstein:
An Approximation Algorithm for Maximum Triangle Packing. ESA 2004: 403-413 - [c16]Refael Hassin, Danny Segev:
Robust Subgraphs for Trees and Paths. SWAT 2004: 51-63 - 2003
- [j67]Refael Hassin, Asaf Levin:
Subgraphs decomposable into two trees and k-edge-connected subgraphs. Discret. Appl. Math. 126(2-3): 181-195 (2003) - [j66]Refael Hassin, Asaf Levin, Dana Morad:
Lexicographic local search and the p. Eur. J. Oper. Res. 151(2): 265-279 (2003) - [j65]Refael Hassin, Asaf Levin:
Minimum spanning tree with hop restrictions. J. Algorithms 48(1): 220-238 (2003) - [j64]Sudipto Guha, Refael Hassin, Samir Khuller, Einat Or:
Capacitated vertex covering. J. Algorithms 48(1): 257-270 (2003) - [j63]Refael Hassin, Shlomi Rubinstein:
Approximation algorithms for the metric maximum clustering problem with given cluster sizes. Oper. Res. Lett. 31(3): 179-184 (2003) - [j62]Michele Conforti, Refael Hassin, R. Ravi:
Reconstructing edge-disjoint paths. Oper. Res. Lett. 31(3): 273-276 (2003) - [c15]Cristina Bazgan, Refael Hassin, Jérôme Monnot:
Differential Approximation for Some Routing Problems. CIAC 2003: 277-288 - [c14]Refael Hassin, Asaf Levin:
The Minimum Generalized Vertex Cover Problem. ESA 2003: 289-300 - 2002
- [j61]Refael Hassin, Moshe Haviv:
Nash Equilibrium and Subgame Perfection in Observable Queues. Ann. Oper. Res. 113(1-4): 15-26 (2002) - [j60]Esther M. Arkin, Refael Hassin:
A note on orientations of mixed graphs. Discret. Appl. Math. 116(3): 271-278 (2002) - [j59]Yuichi Asahiro, Refael Hassin, Kazuo Iwama:
Complexity of finding dense subgraphs. Discret. Appl. Math. 121(1-3): 15-26 (2002) - [j58]Esther M. Arkin, Refael Hassin, Shimon Shahar:
Increasing digraph arc-connectivity by arc addition, reversal and complement. Discret. Appl. Math. 122(1-3): 13-22 (2002) - [j57]Refael Hassin, Shlomi Rubinstein:
A 7/8-approximation algorithm for metric Max TSP. Inf. Process. Lett. 81(5): 247-251 (2002) - [j56]Refael Hassin, Asaf Levin:
Approximation algorithms for constructing wavelength routing networks. Networks 40(1): 32-37 (2002) - [j55]Refael Hassin, Shlomi Rubinstein:
Robust Matchings. SIAM J. Discret. Math. 15(4): 530-537 (2002) - [c13]Refael Hassin, Asaf Levin:
Minimum Restricted Diameter Spanning Trees. APPROX 2002: 175-184 - [c12]Sudipto Guha, Refael Hassin, Samir Khuller, Einat Or:
Capacitated vertex covering with applications. SODA 2002: 858-865 - [c11]Esther M. Arkin, Refael Hassin, Shlomi Rubinstein, Maxim Sviridenko:
Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems. SWAT 2002: 280-287 - 2001
- [j54]Esther M. Arkin, Refael Hassin, Maxim Sviridenko:
Approximating the maximum quadratic assignment problem. Inf. Process. Lett. 77(1): 13-16 (2001) - [j53]Refael Hassin, Shlomi Rubinstein:
Approximation algorithms for maximum linear arrangement. Inf. Process. Lett. 80(4): 171-177 (2001) - [j52]Refael Hassin, Samir Khuller:
z-Approximations. J. Algorithms 41(2): 429-442 (2001) - [j51]Alexander A. Ageev, Refael Hassin, Maxim Sviridenko:
A 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts. SIAM J. Discret. Math. 14(2): 246-255 (2001) - [c10]Refael Hassin, Asaf Levin:
Synthesis of 2-Commodity Flow Networks. IPCO 2001: 226-235 - [c9]Refael Hassin, Shlomi Rubinstein:
A 7/8-Approximation Algorithm for Metric Max TSP. WADS 2001: 205-209 - 2000
- [j50]Nili Guttmann-Beck, Refael Hassin:
Approximation Algorithms for Minimum K-Cut. Algorithmica 27(2): 198-207 (2000) - [j49]Nili Guttmann-Beck, Refael Hassin, Samir Khuller, Balaji Raghavachari:
Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem. Algorithmica 28(4): 422-437 (2000) - [j48]Refael Hassin, Shlomi Rubinstein:
Better approximations for max TSP. Inf. Process. Lett. 75(4): 181-186 (2000) - [j47]Esther M. Arkin, Refael Hassin:
Minimum-diameter covering problems. Networks 36(3): 147-155 (2000) - [c8]Alexander A. Ageev, Refael Hassin, Maxim Sviridenko:
An approximation algorithm for MAX DICUT with given sizes of parts. APPROX 2000: 34-41 - [c7]Refael Hassin, R. Ravi, F. Sibel Salman:
Approximation algorithms for a capacitated network design problem. APPROX 2000: 167-176 - [c6]Esther M. Arkin, Refael Hassin:
Approximating the maximum quadratic assignment problem. SODA 2000: 889-890 - [c5]Refael Hassin, Shlomi Rubinstein:
Approximation Algorithms for Maximum Linear Arrangement. SWAT 2000: 231-236 - [c4]Refael Hassin, Shlomi Rubinstein:
Robust Matchings and Maximum Clustering. SWAT 2000: 251-258
1990 – 1999
- 1999
- [j46]Shoshana Anily, Celia A. Glass, Refael Hassin:
Scheduling maintenance services to three machines. Ann. Oper. Res. 86: 375-391 (1999) - 1998
- [j45]Shoshana Anily, Celia A. Glass, Refael Hassin:
The Scheduling of Maintenance Service. Discret. Appl. Math. 82(1-3): 27-42 (1998) - [j44]Nili Guttmann-Beck, Refael Hassin:
Approximation Algorithms for Minimum Tree Partition. Discret. Appl. Math. 87(1-3): 117-137 (1998) - [j43]Nili Guttmann-Beck, Refael Hassin:
Approximation Algorithms for Min-sum p-clustering. Discret. Appl. Math. 89(1-3): 125-142 (1998) - [j42]Esther M. Arkin, Refael Hassin:
Graph partitions with minimum degree constraints. Discret. Math. 190(1-3): 55-65 (1998) - [j41]Refael Hassin, Shlomi Rubinstein:
An Approximation Algorithm for the Maximum Traveling Salesman Problem. Inf. Process. Lett. 67(3): 125-130 (1998) - [j40]Esther M. Arkin, Refael Hassin:
On Local Search for Weighted k-Set Packing. Math. Oper. Res. 23(3): 640-648 (1998) - [c3]Nili Guttmann-Beck, Refael Hassin, Samir Khuller, Balaji Raghavachari:
Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem. FSTTCS 1998: 6-17 - 1997
- [j39]Refael Hassin, Moshe Haviv:
Equilibrium Threshold Strategies: The Case of Queues with Priorities. Oper. Res. 45(6): 966-973 (1997) - [j38]Refael Hassin, Shlomi Rubinstein:
An Approximation Algorithm for Maximum Packing of 3-Edge Paths. Inf. Process. Lett. 63(2): 63-67 (1997) - [j37]Nili Guttmann-Beck, Refael Hassin:
Approximation Algorithms for Min-Max Tree Partition. J. Algorithms 24(2): 266-286 (1997) - [j36]Esther M. Arkin, Refael Hassin, Limor Klein:
Restricted delivery problems on a network. Networks 29(4): 205-216 (1997) - [j35]Refael Hassin, Shlomi Rubinstein, Arie Tamir:
Approximation algorithms for maximum dispersion. Oper. Res. Lett. 21(3): 133-137 (1997) - [c2]Esther M. Arkin, Refael Hassin:
On Local Search for Weighted k-Set Packing. ESA 1997: 13-22 - 1996
- [j34]Refael Hassin:
A Flow Algorithm for Network Synchronization. Oper. Res. 44(4): 570-579 (1996) - 1995
- [j33]Michal Benelli, Refael Hassin:
optimal Separable Partitioning in the Plane. Discret. Appl. Math. 59(3): 215-224 (1995) - [j32]Refael Hassin, Arie Tamir:
On the Minimum Diameter Spanning Tree Problem. Inf. Process. Lett. 53(2): 109-111 (1995) - [j31]Refael Hassin, Moshe Haviv:
Equilibrium strategies for queues with impatient customers. Oper. Res. Lett. 17(1): 41-45 (1995) - 1994
- [j30]Esther M. Arkin, Refael Hassin:
Approximation Algorithms for the Geometric Covering Salesman Problem. Discret. Appl. Math. 55(3): 197-218 (1994) - [j29]Refael Hassin, Shlomi Rubinstein:
Approximations for the Maximum Acyclic Subgraph Problem. Inf. Process. Lett. 51(3): 133-140 (1994) - [j28]Refael Hassin, Shlomo Lahav:
Maximizing the Number of Unused Colors in the Vertex Coloring Problem. Inf. Process. Lett. 52(2): 87-90 (1994) - 1993
- [j27]Refael Hassin, Mordechai I. Henig:
Monotonicity and Efficient Computation of Optimal Dichotomous Search. Discret. Appl. Math. 46(3): 221-234 (1993) - [j26]Esther M. Arkin, Magnús M. Halldórsson, Refael Hassin:
Approximating the Tree and Tour Covers of a Graph. Inf. Process. Lett. 47(6): 275-282 (1993) - 1992
- [j25]Refael Hassin:
Approximation Schemes for the Restricted Shortest Path Problem. Math. Oper. Res. 17(1): 36-42 (1992) - [j24]Shoshana Anily, Refael Hassin:
The swapping problem. Networks 22(4): 419-433 (1992) - [j23]Refael Hassin:
Algorithms for the minimum cost circulation problem based on maximizing the mean improvement. Oper. Res. Lett. 12(4): 227-233 (1992) - [j22]Refael Hassin, Moshe Haviv:
Mean Passage Times and Nearly Uncoupled Markov Chains. SIAM J. Discret. Math. 5(3): 386-397 (1992) - 1991
- [j21]Refael Hassin:
Multiterminal xcut problems. Ann. Oper. Res. 33(3): 215-225 (1991) - [j20]Refael Hassin, Nimrod Megiddo:
Approximation algorithms for hitting objects with straight lines. Discret. Appl. Math. 30(1): 29-42 (1991) - [j19]Refael Hassin, Nimrod Megiddo:
Exact Computation of Optimal Inventory Policies Over an Unbounded Horizon. Math. Oper. Res. 16(3): 534-546 (1991) - [j18]Refael Hassin, Arie Tamir:
Improved complexity bounds for location problems on the real line. Oper. Res. Lett. 10(7): 395-402 (1991) - 1990
- [c1]Refael Hassin:
Simultaneous Solution of Families of Problems. SIGAL International Symposium on Algorithms 1990: 288-299
1980 – 1989
- 1989
- [j17]Refael Hassin, Arie Tamir:
Maximizing Classes of Two-Parameter Objectives Over Matroids. Math. Oper. Res. 14(2): 362-375 (1989) - [j16]Shoshana Anily, Refael Hassin:
Ranking the Best Binary Trees. SIAM J. Comput. 18(5): 882-892 (1989) - 1988
- [j15]Refael Hassin, Eitan Zemel:
Probabilistic Analysis of the Capacitated Transportation Problem. Math. Oper. Res. 13(1): 80-89 (1988) - [j14]Refael Hassin:
Solution Bases of Multiterminal Cut Problems. Math. Oper. Res. 13(4): 535-542 (1988) - 1987
- [j13]Amihai Glazer, Refael Hassin:
Equilibrium Arrivals in Queues with Bulk Service at Scheduled Times. Transp. Sci. 21(4): 273-278 (1987) - 1986
- [j12]Frieda Granot, Refael Hassin:
Multi-terminal maximum flows in node-capacitated networks. Discret. Appl. Math. 13(2-3): 157-163 (1986) - [j11]Amihai Glazer, Refael Hassin:
A Deterministic Single-Item Inventory Model with Seller Holding Cost and Buyer Holding and Shortage Costs. Oper. Res. 34(4): 613-618 (1986) - 1985
- [j10]Refael Hassin, Nimrod Megiddo:
An Optimal Algorithm for Finding all the Jumps of a Monotone Step-Function. J. Algorithms 6(2): 265-274 (1985) - [j9]Refael Hassin, Eitan Zemel:
On Shortest Paths in Graphs with Random Weights. Math. Oper. Res. 10(4): 557-564 (1985) - [j8]Refael Hassin, Donald B. Johnson:
An O(n log2 n) Algorithm for Maximum Flow in Undirected Planar Networks. SIAM J. Comput. 14(3): 612-624 (1985) - 1984
- [j7]Refael Hassin:
A Dichotomous Search for a Geometric Random Variable. Oper. Res. 32(2): 423-439 (1984) - [j6]Refael Hassin, Mordechai I. Henig:
Dichotomous Search for Random Objects on an Interval. Math. Oper. Res. 9(2): 301-308 (1984) - [j5]Refael Hassin:
On multicommodity flows in planar graphs. Networks 14(2): 225-235 (1984) - 1983
- [j4]Refael Hassin:
The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm. Math. Program. 25(2): 228-239 (1983) - 1982
- [j3]Refael Hassin:
Minimum cost flow with set-constraints. Networks 12(1): 1-21 (1982) - 1981
- [j2]Refael Hassin:
Maximum Flow in (s, t) Planar Networks. Inf. Process. Lett. 13(3): 107 (1981) - [j1]Refael Hassin:
Generalizations of Hoffman's existence theorem for circulations. Networks 11(3): 243-254 (1981)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-21 23:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
