Hanan Luss

2.7k total citations
80 papers, 1.9k citations indexed

About

Hanan Luss is a scholar working on Industrial and Manufacturing Engineering, Computer Networks and Communications and Management Information Systems. According to data from OpenAlex, Hanan Luss has authored 80 papers receiving a total of 1.9k indexed citations (citations by other indexed papers that have themselves been cited), including 30 papers in Industrial and Manufacturing Engineering, 28 papers in Computer Networks and Communications and 17 papers in Management Information Systems. Recurrent topics in Hanan Luss's work include Scheduling and Optimization Algorithms (15 papers), Optimization and Search Problems (13 papers) and Supply Chain and Inventory Management (12 papers). Hanan Luss is often cited by papers focused on Scheduling and Optimization Algorithms (15 papers), Optimization and Search Problems (13 papers) and Supply Chain and Inventory Management (12 papers). Hanan Luss collaborates with scholars based in United States, Germany and Israel. Hanan Luss's co-authors include John G. Klincewicz, S. K. Gupta, Donald R. Smith, Moshe B. Rosenwein, Sang-Bum Lee, Richard T. Wong, Michał Pióro, Oktay Günlük, K.R. Krishnan and Dritan Nace and has published in prestigious journals such as Management Science, European Journal of Operational Research and Operations Research.

In The Last Decade

Hanan Luss

74 papers receiving 1.7k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Hanan Luss United States 23 802 464 415 326 250 80 1.9k
Gerald G. Brown United States 25 1.1k 1.3× 571 1.2× 298 0.7× 381 1.2× 309 1.2× 92 3.4k
Amedeo R. Odoni United States 38 1.1k 1.3× 248 0.5× 220 0.5× 403 1.2× 343 1.4× 97 4.6k
Jeremy F. Shapiro United States 21 572 0.7× 553 1.2× 184 0.4× 341 1.0× 169 0.7× 53 1.8k
Alper Atamtürk United States 25 701 0.9× 342 0.7× 227 0.5× 431 1.3× 201 0.8× 58 1.9k
Dingwei Wang China 28 823 1.0× 364 0.8× 171 0.4× 565 1.7× 211 0.8× 204 2.7k
Prakash Mirchandani United States 24 548 0.7× 249 0.5× 259 0.6× 159 0.5× 183 0.7× 78 2.0k
K.S. Hindi United Kingdom 26 1.1k 1.3× 198 0.4× 178 0.4× 229 0.7× 111 0.4× 62 1.7k
Richard T. Wong United States 18 1.7k 2.1× 264 0.6× 398 1.0× 347 1.1× 507 2.0× 37 3.2k
Fulya Altıparmak Türkiye 21 1.2k 1.5× 419 0.9× 150 0.4× 218 0.7× 173 0.7× 44 2.3k
Leyuan Shi United States 29 1.3k 1.6× 448 1.0× 300 0.7× 729 2.2× 119 0.5× 151 2.5k

Countries citing papers authored by Hanan Luss

Since Specialization
Citations

This map shows the geographic impact of Hanan Luss's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Hanan Luss with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Hanan Luss more than expected).

Fields of papers citing papers by Hanan Luss

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Hanan Luss. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Hanan Luss. The network helps show where Hanan Luss may publish in the future.

Co-authorship network of co-authors of Hanan Luss

This figure shows the co-authorship network connecting the top 25 collaborators of Hanan Luss. A scholar is included among the top collaborators of Hanan Luss based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Hanan Luss. Hanan Luss is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Ogryczak, Włodzimierz, Hanan Luss, Michał Pióro, Dritan Nace, & Artur Tomaszewski. (2014). Fair Optimization and Networks: A Survey. Journal of Applied Mathematics. 2014. 1–25. 51 indexed citations
2.
Krishnan, K.R. & Hanan Luss. (2011). Power selection for maximizing SINR in femtocells for specified SINR in macrocell. 563–568. 15 indexed citations
3.
Luss, Hanan. (2011). A distributed algorithm for equitable bandwidth allocation for content distribution in a tree network. Journal of the Operational Research Society. 63(4). 460–469. 3 indexed citations
4.
Luss, Hanan, et al.. (2010). Network restoration under dual failures using path-protecting preconfigured cycles. Telecommunication Systems. 49(3). 271–286. 5 indexed citations
5.
Luss, Hanan. (2010). Equitable bandwidth allocation in content distribution networks. Naval Research Logistics (NRL). 57(3). 266–278. 10 indexed citations
6.
Luss, Hanan, Arnold L. Neidhardt, & K.R. Krishnan. (2009). An adaptive automated method for identity verification with performance guarantees. Electronic Commerce Research. 9(3). 225–242. 2 indexed citations
7.
Luss, Hanan. (2005). Allocation of resources of modular sizes with an application to Internet Protocol (IP) address allocation. Naval Research Logistics (NRL). 52(8). 713–723. 2 indexed citations
8.
Luss, Hanan & Moshe B. Rosenwein. (1997). Operations Research applications: Opportunities and accomplishments. European Journal of Operational Research. 97(2). 220–244. 8 indexed citations
9.
Luss, Hanan, et al.. (1994). Relaxation-based algorithms for minimax optimization problems with resource allocation applications. Mathematical Programming. 64(1-3). 337–363. 9 indexed citations
10.
Brown, James R., et al.. (1994). Minimax resource allocation problems with ordering constraints. Naval Research Logistics (NRL). 41(6). 719–738. 10 indexed citations
11.
Luss, Hanan & Moshe B. Rosenwein. (1993). A due date assignment algorithm for multiproduct manufacturing facilities. European Journal of Operational Research. 65(2). 187–198. 16 indexed citations
12.
Luss, Hanan. (1992). Minimax resource allocation problems: Optimization and parametric analysis. European Journal of Operational Research. 60(1). 76–86. 33 indexed citations
13.
Luss, Hanan. (1987). An algorithm for separable non-linear minimax problems. Operations Research Letters. 6(4). 159–162. 20 indexed citations
14.
Luss, Hanan. (1986). A heuristic for capacity expansion planning with multiple facility types. Naval Research Logistics Quarterly. 33(4). 685–701. 18 indexed citations
15.
Klincewicz, John G. & Hanan Luss. (1985). Optimal timing decisions for the introduction of new technologies. European Journal of Operational Research. 20(2). 211–220. 13 indexed citations
16.
Luss, Hanan. (1984). A capacity expansion model with applications to multiplexing in communication networks. IEEE Transactions on Systems Man and Cybernetics. SMC-14(3). 419–423. 4 indexed citations
17.
Luss, Hanan. (1983). An Extended Model for the Optimal Sizing of Records. Journal of the Operational Research Society. 34(11). 1099–1099.
18.
Erickson, Ranel E., S. Halfin, & Hanan Luss. (1982). Optimal Sizing of Records when Divided Messages Can Be Stored in Records of Different Sizes. Operations Research. 30(1). 29–39. 1 indexed citations
19.
Luss, Hanan. (1982). Production planning with capacity bounds: A modified algorithm. European Journal of Operational Research. 10(4). 412–412. 1 indexed citations
20.
Luss, Hanan. (1977). Inspection Policies for A System which Is Inoperative During Inspection Periods. A I I E Transactions. 9(2). 189–194. 14 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026