Jeffery L. Kennington

According to our database1, Jeffery L. Kennington authored at least 36 papers between 1977 and 2013.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2013
A WLAN design problem with known mobile device locations: a global optimization approach.
Telecommunication Systems, 2013

2010
The Uncapacitated Time-Space Fixed-Charge Network Flow Problem: An Empirical Investigation of Procedures for Arc Capacity Assignment.
INFORMS Journal on Computing, 2010

2009
Generalized Networks.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Design procedures for backbone transport networks with shared protection: optimization-based models, exact and heuristic algorithms, and unavailability computations.
Telecommunication Systems, 2009

2006
Practical Integrated Design Strategies for Opaque and All-Optical DWDM Networks: Optimization Models and Solution Procedures.
Telecommunication Systems, 2006

Base Station Location and Service Assignments in W - CDMA Networks.
INFORMS Journal on Computing, 2006

Minimum Cost Network Flow Algorithms.
Proceedings of the Handbook of Optimization in Telecommunications, 2006

2005
Hierarchical cellular network design with channel allocation.
European Journal of Operational Research, 2005

2004
Wavelength Translation in WDM Networks: Optimization Models and Solution Procedures.
INFORMS Journal on Computing, 2004

Generalized Networks: The Theory of Preprocessing and an Empirical Analysis.
INFORMS Journal on Computing, 2004

2003
Wavelength Routing and Assignment in a Survivable WDM Mesh Network.
Operations Research, 2003

An Incremental Procedure for Improving Path Assignment in a Telecommunications Network.
J. Heuristics, 2003

2001
The Path Restoration Version of the Spare Capacity Allocation Problem with Modularity Restrictions: Models, Algorithms, and an Empirical Analysis.
INFORMS Journal on Computing, 2001

Cruise Missile Mission Planning: A Heuristic Algorithm for Automatic Path Generation.
J. Heuristics, 2001

2000
Fault restoration and spare capacity allocation with QoS constraints for MPLS networks.
Proceedings of the Global Telecommunications Conference, 2000. GLOBECOM 2000, San Francisco, CA, USA, 27 November, 2000

1999
An Efficient Decomposition Algorithm to Optimize Spare Capacity in a Telecommunications Network.
INFORMS Journal on Computing, 1999

Optimization Based Algorithms for Finding Minimal Cost Ring Covers in Survivable Networks.
Comp. Opt. and Appl., 1999

1997
A Truncated Exponential Algorithm for the Lightly Constrained Assignment Problem.
Comp. Opt. and Appl., 1997

Recovery from Numerical Instability during Basis Reinversion.
Comp. Opt. and Appl., 1997

1995
The singly constrained assignment problem: An AP basis algorithm.
Comp. Opt. and Appl., 1995

Use of Hidden Network Structure in the Set Partitioning Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 1995

1994
The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm.
Comp. Opt. and Appl., 1994

1993
The one-to-one shortest-path problem: An empirical analysis with the two-tree Dijkstra algorithm.
Comp. Opt. and Appl., 1993

1992
A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem.
Operations Research, 1992

Generalized Networks: Parallel Algorithms and an Empirical Analysis.
INFORMS Journal on Computing, 1992

1991
An Empirical Analysis of the Dense Assignment Problem: Sequential and Parallel Implementations.
INFORMS Journal on Computing, 1991

Performance Characteristics of the Jacobi and the Gauss-Seidel Versions of the Auction Algorithm on the Alliant FX/8.
INFORMS Journal on Computing, 1991

1990
An Empirical Evaluation of the KORBX® Algorithms for Military Airlift Applications.
Operations Research, 1990

1989
Minimal spanning trees: an empirical investigation of parallel algorithms.
Parallel Computing, 1989

1987
A generalization of Polyak's convergence result for subgradient optimization.
Math. Program., 1987

1986
The asymmetric M-travelling salesmen problem: A duality based branch-and-bound algorithm.
Discrete Applied Mathematics, 1986

1980
A polynomially bounded algorithm for a singly constrained quadratic program.
Math. Program., 1980

Technical Note - Computational Comparison among Three Multicommodity Network Flow Algorithms.
Operations Research, 1980

1978
Primal simplex network codes: State-of-the-art implementation technology.
Networks, 1978

A Survey of Linear Cost Multicommodity Network Flows.
Operations Research, 1978

1977
A product form representation of the inverse of a multicommodity cycle matrix.
Networks, 1977


  Loading...