Jeffery L. Kennington

Publication Activity (10 Years)

Years Active: 1977-2013
Publications (10 Years): 0

Top Topics

Ant Colony Algorithm

Constrained Global Optimization

Top Venues

Telecommun. Syst.

Publications

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) (2013)
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) (2010)
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) (2009)
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) (2006)
Joakim Kalvenes, Jeffery L. Kennington, Eli V. Olinick
Base Station Location and Service Assignments in W - CDMA Networks. INFORMS J. Comput. 18 (3) (2006)
Joakim Kalvenes, Jeffery L. Kennington, Eli V. Olinick
Hierarchical cellular network design with channel allocation. Eur. J. Oper. Res. 160 (1) (2005)
Jeffery L. Kennington, Eli V. Olinick
Wavelength Translation in WDM Networks: Optimization Models and Solution Procedures. INFORMS J. Comput. 16 (2) (2004)
Jeffery L. Kennington, Karen R. Lewis
Generalized Networks: The Theory of Preprocessing and an Empirical Analysis. INFORMS J. Comput. 16 (2) (2004)
Jeffery L. Kennington, Eli V. Olinick, Augustyn Ortynski, Gheorghe Spiride
Wavelength Routing and Assignment in a Survivable WDM Mesh Network. Oper. Res. 51 (1) (2003)
D. Allen, I. Ismail, Jeffery L. Kennington, Eli V. Olinick
An Incremental Procedure for Improving Path Assignment in a Telecommunications Network. J. Heuristics 9 (5) (2003)
Richard V. Helgason, Jeffery L. Kennington, Karen R. Lewis
Cruise Missile Mission Planning: A Heuristic Algorithm for Automatic Path Generation. J. Heuristics 7 (5) (2001)
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) (2001)
Tae H. Oh, Thomas M. Chen, Jeffery L. Kennington
Fault restoration and spare capacity allocation with QoS constraints for MPLS networks. GLOBECOM (2000)
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) (1999)
Jeffery L. Kennington, Jason E. Whitler
An Efficient Decomposition Algorithm to Optimize Spare Capacity in a Telecommunications Network. INFORMS J. Comput. 11 (2) (1999)
Jeffery L. Kennington, Riad A. K. Mohamed
Recovery from Numerical Instability during Basis Reinversion. Comput. Optim. Appl. 8 (1) (1997)
Jeffery L. Kennington, Farin Mohammadi
A Truncated Exponential Algorithm for the Lightly Constrained Assignment Problem. Comput. Optim. Appl. 8 (3) (1997)
Jeffery L. Kennington, Farin Mohammadi
The singly constrained assignment problem: An AP basis algorithm. Comput. Optim. Appl. 4 (4) (1995)
Agha Iqbal Ali, Hyun-Soo Han, Jeffery L. Kennington
Use of Hidden Network Structure in the Set Partitioning Problem. IPCO (1995)
Jeffery L. Kennington, Farin Mohammadi
The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm. Comput. Optim. Appl. 3 (1) (1994)
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) (1993)
Robert H. Clark, Jeffery L. Kennington, Robert R. Meyer, Muthukrishnan Ramamurti
Generalized Networks: Parallel Algorithms and an Empirical Analysis. INFORMS J. Comput. 4 (2) (1992)
Jeffery L. Kennington, Zhiming Wang
A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem. Oper. Res. 40 (1) (1992)
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) (1991)
Jeffery L. Kennington, Zhiming Wang
An Empirical Analysis of the Dense Assignment Problem: Sequential and Parallel Implementations. INFORMS J. Comput. 3 (4) (1991)
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) (1990)
Richard S. Barr, R. V. Helgaon, Jeffery L. Kennington
Minimal spanning trees: an empirical investigation of parallel algorithms. Parallel Comput. 12 (1) (1989)
Ellen Allen, Richard V. Helgason, Jeffery L. Kennington, Bala Shetty
A generalization of Polyak's convergence result for subgradient optimization. Math. Program. 37 (3) (1987)
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) (1980)
Richard V. Helgason, Jeffery L. Kennington, H. S. Lall
A polynomially bounded algorithm for a singly constrained quadratic program. Math. Program. 18 (1) (1980)
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) (1978)
Richard V. Helgason, Jeffery L. Kennington
A product form representation of the inverse of a multicommodity cycle matrix. Networks 7 (4) (1977)