John G. Klincewicz

Orcid: 0000-0002-7778-5817

According to our database1, John G. Klincewicz authored at least 21 papers between 1982 and 2013.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2013
Designing an IP Link Topology for a Metro Area Backbone Network.
Int. J. Interdiscip. Telecommun. Netw., 2013

2012
Architectures and Protocols for Capacity Efficient, Highly Dynamic and Highly Resilient Core Networks [Invited].
JOCN, 2012

2010
Design of metro Ethernet networks.
Proceedings of the 17th IEEE Workshop on Local and Metropolitan Area Networks, 2010

2009
Survivable IP link topology design in an IP-over-WDM architecture.
Proceedings of the 7th International Workshop on Design of Reliable Communication Networks, 2009

2007
Assigning Telecommunications Nodes to Community of Interest Clusters.
Proceedings of the Global Communications Conference, 2007

2006
Optimization Issues in Quality of Service.
Proceedings of the Handbook of Optimization in Telecommunications, 2006

2002
Incorporating QoS into IP Enterprise Network Design.
Telecommun. Syst., 2002

Enumeration and Search Procedures for a Hub Location Problem with Economies of Scale.
Ann. Oper. Res., 2002

2000
Design of Stacked Self-Healing Rings Using a Genetic Algorithm.
J. Heuristics, 2000

1998
Designing tributary networks with multiple ring families.
Comput. Oper. Res., 1998

1995
The Airline Exception Scheduling Problem.
Transp. Sci., 1995

1992
Avoiding local optima in the<i>p</i>-hub location problem using tabu search and GRASP.
Ann. Oper. Res., 1992

1990
Fleet Size Planning when Outside Carrier Services Are Available.
Transp. Sci., 1990

Solving a Freight Transport Problem Using Facility Location Techniques.
Oper. Res., 1990

1989
Implementing an "exact" Newton method for separable convex transportation problems.
Networks, 1989

1987
A Dual-Based Algorithm for Multiproduct Uncapacitated Facility Location.
Transp. Sci., 1987

1985
Dealing with degeneracy in reduced gradient algorithms.
Math. Program., 1985

A large-scale distribution and location model.
AT&T Tech. J., 1985

1983
A Newton method for convex separable network flow problems.
Networks, 1983

On cycling in the network simplex method.
Math. Program., 1983

1982
Algorithms for Network Programming, by J. L. Kennington and R. V. Helgason, Wiley, New York, 1980, 291 pp. Price: $25.00.
Networks, 1982


  Loading...