default search action
Hanan Luss
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
- [j30]Wlodzimierz Ogryczak
, Hanan Luss
Fair Optimization and Networks: Models, Algorithms, and Applications. J. Appl. Math. 2014: 340913:1-340913:3 (2014) - [j29]Wlodzimierz Ogryczak
Fair Optimization and Networks: A Survey. J. Appl. Math. 2014: 612018:1-612018:25 (2014) - 2012
- [j28]Hanan Luss:
A distributed algorithm for equitable bandwidth allocation for content distribution in a tree network. J. Oper. Res. Soc. 63(4): 460-469 (2012) - [j27]Martin I. Eiger, Hanan Luss, David Shallcross:
Network restoration under dual failures using path-protecting preconfigured cycles. Telecommun. Syst. 49(3): 271-286 (2012) - 2011
- [j26]Martin I. Eiger, Hanan Luss, David Shallcross:
Network restoration under a single link or node failure using Preconfigured Virtual Cycles. Telecommun. Syst. 46(1): 17-30 (2011) - [c2]K. R. Krishnan, Hanan Luss:
Power selection for maximizing SINR in femtocells for specified SINR in macrocell. WCNC 2011: 563-568 - 2010
- [j25]Hanan Luss:
Optimal Content Distribution in Video-on-Demand Tree Networks. IEEE Trans. Syst. Man Cybern. Part A 40(1): 68-75 (2010)
2000 – 2009
- 2009
- [j24]Hanan Luss, Arnold L. Neidhardt, K. R. Krishnan:
An adaptive automated method for identity verification with performance guarantees. Electron. Commer. Res. 9(3): 225-242 (2009) - 2006
- [p1]Tamra Carpenter, Hanan Luss:
Telecommunications Access Network Design. Handbook of Optimization in Telecommunications 2006: 313-339 - 2005
- [j23]Hanan Luss, Richard T. Wong:
Graceful reassignment of excessively long communications paths in networks. Eur. J. Oper. Res. 160(2): 395-415 (2005) - [c1]Stefano Galli, Hanan Luss, John Sucec, Anthony J. McAuley, Sunil Samtani, Dave Dubois, Kevin DeTerra, Rick Stewart, Bill Kelley:
A novel approach to OSPF-area design for large wireless ad-hoc networks. ICC 2005: 2986-2992 - 2004
- [j22]Hanan Luss, Richard T. Wong:
Survivable telecommunications network design under different types of failures. IEEE Trans. Syst. Man Cybern. Part A 34(4): 521-530 (2004) - 2001
- [j21]Hanan Luss, Andrew Vakhutinsky:
A Resource Allocation Approach for the Generation of Service-Dependent Demand Matrices for Communications Networks. Telecommun. Syst. 17(4): 411-433 (2001) - 2000
- [j20]Mor Armony, John G. Klincewicz
Design of Stacked Self-Healing Rings Using a Genetic Algorithm. J. Heuristics 6(1): 85-105 (2000)
1990 – 1999
- 1999
- [j19]Hanan Luss:
On Equitable Resource Allocation Problems: A Lexicographic Minimax Approach. Oper. Res. 47(3): 361-378 (1999) - 1998
- [j18]John G. Klincewicz, Hanan Luss, Dicky C. K. Yan:
Designing tributary networks with multiple ring families. Comput. Oper. Res. 25(12): 1145-1157 (1998) - [j17]Muralidharan S. Kodialam, Hanan Luss:
Algorithms for Separable Nonlinear Resource Allocation Problems. Oper. Res. 46(2): 272-284 (1998) - [j16]Hanan Luss, Moshe B. Rosenwein, Richard T. Wong:
Topological network design for SONET ring architecture. IEEE Trans. Syst. Man Cybern. Part A 28(6): 780-790 (1998) - 1994
- [j15]Rachelle S. Klein, Hanan Luss, Uriel G. Rothblum:
Relaxation-based algorithms for minimax optimization problems with resource allocation applications. Math. Program. 64: 337-363 (1994) - 1993
- [j14]Rachelle S. Klein, Hanan Luss, Uriel G. Rothblum:
Minimax Resource Allocation Problems with Resource-Substitutions Represented by Graphs. Oper. Res. 41(5): 959-971 (1993) - 1992
- [j13]Rachelle S. Klein, Hanan Luss, Donald R. Smith:
A lexicographic minimax algorithm for multiperiod resource allocation. Math. Program. 55: 213-234 (1992) - 1991
- [j12]Rachelle S. Klein, Hanan Luss:
Minimax Resource Allocation with Tree Structured Substitutable Resources. Oper. Res. 39(2): 285-295 (1991) - [j11]Hanan Luss:
A nonlinear minimax allocation problem with multiple knapsack constraints. Oper. Res. Lett. 10(4): 183-187 (1991) - 1990
- [j10]John G. Klincewicz, Hanan Luss, Martha G. Pilcher:
Fleet Size Planning when Outside Carrier Services Are Available. Transp. Sci. 24(3): 169-182 (1990)
1980 – 1989
- 1987
- [j9]Sang-Bum Lee, Hanan Luss:
Multifacility-Type Capacity Expansion Planning: Algorithms and Complexities. Oper. Res. 35(2): 249-253 (1987) - [j8]John G. Klincewicz, Hanan Luss:
A Dual-Based Algorithm for Multiproduct Uncapacitated Facility Location. Transp. Sci. 21(3): 198-206 (1987) - 1984
- [j7]Hanan Luss:
A capacity expansion model with applications to multiplexing in communication networks. IEEE Trans. Syst. Man Cybern. 14(3): 419-423 (1984) - 1982
- [j6]Ranel E. Erickson, Shlomo Halfin, Hanan Luss:
Optimal Sizing of Records when Divided Messages Can Be Stored in Records of Different Sizes. Oper. Res. 30(1): 29-39 (1982) - [j5]Hanan Luss:
Operations Research and Capacity Expansion Problems: A Survey. Oper. Res. 30(5): 907-947 (1982)
1970 – 1979
- 1977
- [j4]Lawrence J. Ackerman, Hanan Luss, Raymond S. Berkowitz:
Application of Sequencing Policies to Telephone Switching Facilities. IEEE Trans. Syst. Man Cybern. 7(8): 604-609 (1977) - 1976
- [j3]Hanan Luss:
Maintenance Policies When Deterioration Can be Observed by Inspections. Oper. Res. 24(2): 359-366 (1976) - 1975
- [j2]Hanan Luss, Shiv K. Gupta:
Technical Note - Allocation of Effort Resources among Competing Activities. Oper. Res. 23(2): 360-366 (1975) - 1974
- [j1]Hanan Luss, Zvi Kander:
A Preparedness Model Dealing with N Systems Operating Simultaneously. Oper. Res. 22(1): 117-128 (1974)
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-04-25 05:47 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: