default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJeffery L. Kennington
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[j35]Jeffery L. Kennington, T. Jason Kratz, Dinesh Rajan:
A WLAN design problem with known mobile device locations: a global optimization approach. Telecommun. Syst. 53(2): 227-238 (2013)- 2010
- [j34]Mark Frost, Jeff L. Kennington, Anusha Madhavan:
Optimizing Cash Management for Large Scale Bank Operations. Int. J. Oper. Res. Inf. Syst. 1(2): 17-31 (2010) - [j33]Jeffery L. Kennington, Charles D. Nicholson
:
The Uncapacitated Time-Space Fixed-Charge Network Flow Problem: An Empirical Investigation of Procedures for Arc Capacity Assignment. INFORMS J. Comput. 22(2): 326-337 (2010)
2000 – 2009
- 2009
- [j32]Giray Birkan, Jeffery L. Kennington:
Design procedures for backbone transport networks with shared protection: optimization-based models, exact and heuristic algorithms, and unavailability computations. Telecommun. Syst. 41(2): 97-120 (2009) - [r1]Jeffery L. Kennington, Karen R. Lewis:
Generalized Networks. Encyclopedia of Optimization 2009: 1209-1214 - 2006
- [j31]Joakim Kalvenes, Jeffery L. Kennington, Eli V. Olinick:
Base Station Location and Service Assignments in W - CDMA Networks. INFORMS J. Comput. 18(3): 366-376 (2006) - [j30]Giray Birkan, Jeffery L. Kennington, Eli V. Olinick, Augustyn Ortynski, Gheorghe Spiride:
Practical Integrated Design Strategies for Opaque and All-Optical DWDM Networks: Optimization Models and Solution Procedures. Telecommun. Syst. 31(1): 61-83 (2006) - [p1]Jeffery L. Kennington, Richard V. Helgason:
Minimum Cost Network Flow Algorithms. Handbook of Optimization in Telecommunications 2006: 147-162 - 2005
- [j29]Joakim Kalvenes, Jeffery L. Kennington, Eli V. Olinick:
Hierarchical cellular network design with channel allocation. Eur. J. Oper. Res. 160(1): 3-18 (2005) - 2004
- [j28]Jeffery L. Kennington, Karen R. Lewis:
Generalized Networks: The Theory of Preprocessing and an Empirical Analysis. INFORMS J. Comput. 16(2): 162-173 (2004) - [j27]Jeffery L. Kennington, Eli V. Olinick:
Wavelength Translation in WDM Networks: Optimization Models and Solution Procedures. INFORMS J. Comput. 16(2): 174-187 (2004) - [j26]Jeff L. Kennington:
Comments on "A Suggested Computation for Maximal Multi-Commodity Network Flows". Manag. Sci. 50(12-Supplement): 1781 (2004) - 2003
- [j25]D. Allen, Iszaidy Ismail, Jeffery L. Kennington, Eli V. Olinick:
An Incremental Procedure for Improving Path Assignment in a Telecommunications Network. J. Heuristics 9(5): 375-399 (2003) - [j24]Jeffery L. Kennington, Eli V. Olinick, Augustyn Ortynski, Gheorghe Spiride:
Wavelength Routing and Assignment in a Survivable WDM Mesh Network. Oper. Res. 51(1): 67-79 (2003) - 2001
- [j23]Richard V. Helgason, Jeffery L. Kennington, Karen R. Lewis:
Cruise Missile Mission Planning: A Heuristic Algorithm for Automatic Path Generation. J. Heuristics 7(5): 473-494 (2001) - [j22]Jeffery L. Kennington, Mark W. Lewis:
The Path Restoration Version of the Spare Capacity Allocation Problem with Modularity Restrictions: Models, Algorithms, and an Empirical Analysis. INFORMS J. Comput. 13(3): 181-190 (2001) - 2000
- [c2]Tae H. Oh, Thomas M. Chen, Jeffery L. Kennington:
Fault restoration and spare capacity allocation with QoS constraints for MPLS networks. GLOBECOM 2000: 1731-1735
1990 – 1999
- 1999
- [j21]Jeffery L. Kennington, V. S. S. Nair, M. H. Rahman:
Optimization Based Algorithms for Finding Minimal Cost Ring Covers in Survivable Networks. Comput. Optim. Appl. 14(2): 219-230 (1999) - [j20]Jeffery L. Kennington, Jason E. Whitler:
An Efficient Decomposition Algorithm to Optimize Spare Capacity in a Telecommunications Network. INFORMS J. Comput. 11(2): 149-160 (1999) - 1997
- [j19]Jeffery L. Kennington, Riad A. K. Mohamed:
Recovery from Numerical Instability during Basis Reinversion. Comput. Optim. Appl. 8(1): 57-71 (1997) - [j18]Jeffery L. Kennington, Farin Mohammadi:
A Truncated Exponential Algorithm for the Lightly Constrained Assignment Problem. Comput. Optim. Appl. 8(3): 287-299 (1997) - 1995
- [j17]Jeffery L. Kennington, Farin Mohammadi:
The singly constrained assignment problem: An AP basis algorithm. Comput. Optim. Appl. 4(4): 347-374 (1995) - [c1]Agha Iqbal Ali, Hyun-Soo Han, Jeffery L. Kennington:
Use of Hidden Network Structure in the Set Partitioning Problem. IPCO 1995: 172-184 - 1994
- [j16]Jeffery L. Kennington, Farin Mohammadi:
The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm. Comput. Optim. Appl. 3(1): 7-26 (1994) - 1993
- [j15]Richard V. Helgason, Jeffery L. Kennington, B. Douglas Stewart:
The one-to-one shortest-path problem: An empirical analysis with the two-tree Dijkstra algorithm. Comput. Optim. Appl. 2(1): 47-75 (1993) - 1992
- [j14]Robert H. Clark, Jeffery L. Kennington, Robert R. Meyer, Muthukrishnan Ramamurti:
Generalized Networks: Parallel Algorithms and an Empirical Analysis. INFORMS J. Comput. 4(2): 132-145 (1992) - [j13]Jeffery L. Kennington, Zhiming Wang:
A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem. Oper. Res. 40(1): 178-187 (1992) - 1991
- [j12]David N. Kempka, Jeffery L. Kennington, Hossam A. Zaki:
Performance Characteristics of the Jacobi and the Gauss-Seidel Versions of the Auction Algorithm on the Alliant FX/8. INFORMS J. Comput. 3(2): 92-106 (1991) - [j11]Jeffery L. Kennington, Zhiming Wang:
An Empirical Analysis of the Dense Assignment Problem: Sequential and Parallel Implementations. INFORMS J. Comput. 3(4): 299-306 (1991) - 1990
- [j10]William J. Carolan, James E. Hill, Jeffery L. Kennington, Sandra Niemi, Stephen J. Wichmann:
An Empirical Evaluation of the KORBX® Algorithms for Military Airlift Applications. Oper. Res. 38(2): 240-248 (1990)
1980 – 1989
- 1989
- [j9]Richard S. Barr, R. V. Helgaon, Jeffery L. Kennington:
Minimal spanning trees: an empirical investigation of parallel algorithms. Parallel Comput. 12(1): 45-52 (1989) - 1987
- [j8]Ellen Allen, Richard V. Helgason, Jeffery L. Kennington, Bala Shetty:
A generalization of Polyak's convergence result for subgradient optimization. Math. Program. 37(3): 309-317 (1987) - 1986
- [j7]Agha Iqbal Ali, Jeff L. Kennington:
The asymmetric M-travelling salesmen problem: A duality based branch-and-bound algorithm. Discret. Appl. Math. 13(2-3): 259-276 (1986) - 1980
- [j6]Agha Iqbal Ali, Richard V. Helgason, Jeffery L. Kennington, H. S. Lall:
Technical Note - Computational Comparison among Three Multicommodity Network Flow Algorithms. Oper. Res. 28(4): 995-1000 (1980) - [j5]Richard V. Helgason, Jeffery L. Kennington, H. S. Lall:
A polynomially bounded algorithm for a singly constrained quadratic program. Math. Program. 18(1): 338-343 (1980)
1970 – 1979
- 1978
- [j4]Jeff L. Kennington:
A Survey of Linear Cost Multicommodity Network Flows. Oper. Res. 26(2): 209-236 (1978) - [j3]Agha Iqbal Ali, Richard V. Helgason, Jeffery L. Kennington, H. S. Lall:
Primal simplex network codes: State-of-the-art implementation technology. Networks 8(4): 315-339 (1978) - 1977
- [j2]Richard V. Helgason, Jeffery L. Kennington:
A product form representation of the inverse of a multicommodity cycle matrix. Networks 7(4): 297-322 (1977) - 1973
- [j1]Jeffery L. Kennington, V. E. Unger:
The Group-Theoretic Structure in the Fixed-Charge Transportation Problem. Oper. Res. 21(5): 1142-1153 (1973)
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:36 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:
