Jeffery L. Kennington
According to our database1,
Jeffery L. Kennington
authored at least 39 papers
between 1973 and 2013.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2013
A WLAN design problem with known mobile device locations: a global optimization approach.
Telecommun. Syst., 2013
2010
The Uncapacitated Time-Space Fixed-Charge Network Flow Problem: An Empirical Investigation of Procedures for Arc Capacity Assignment.
INFORMS J. Comput., 2010
Int. J. Oper. Res. Inf. Syst., 2010
2009
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.
Telecommun. Syst., 2009
2006
Practical Integrated Design Strategies for Opaque and All-Optical DWDM Networks: Optimization Models and Solution Procedures.
Telecommun. Syst., 2006
INFORMS J. Comput., 2006
Proceedings of the Handbook of Optimization in Telecommunications, 2006
2005
Eur. J. Oper. Res., 2005
2004
Manag. Sci., 2004
INFORMS J. Comput., 2004
INFORMS J. Comput., 2004
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 J. Comput., 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 J. Comput., 1999
Optimization Based Algorithms for Finding Minimal Cost Ring Covers in Survivable Networks.
Comput. Optim. Appl., 1999
1997
Comput. Optim. Appl., 1997
Comput. Optim. Appl., 1997
1995
Comput. Optim. Appl., 1995
Proceedings of the Integer Programming and Combinatorial Optimization, 1995
1994
The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm.
Comput. Optim. Appl., 1994
1993
The one-to-one shortest-path problem: An empirical analysis with the two-tree Dijkstra algorithm.
Comput. Optim. Appl., 1993
1992
Oper. Res., 1992
INFORMS J. Comput., 1992
1991
An Empirical Analysis of the Dense Assignment Problem: Sequential and Parallel Implementations.
INFORMS J. Comput., 1991
Performance Characteristics of the Jacobi and the Gauss-Seidel Versions of the Auction Algorithm on the Alliant FX/8.
INFORMS J. Comput., 1991
1990
Oper. Res., 1990
1989
Parallel Comput., 1989
1987
Math. Program., 1987
1986
The asymmetric M-travelling salesmen problem: A duality based branch-and-bound algorithm.
Discret. Appl. Math., 1986
1980
Math. Program., 1980
Technical Note - Computational Comparison among Three Multicommodity Network Flow Algorithms.
Oper. Res., 1980
1978
Networks, 1978
1977
Networks, 1977
1973
Oper. Res., 1973