J. Klincewicz

发表

A scaled reduced gradient algorithm for network flow problems with convex separable costs

J. G. Klincewicz, R. Dembo, J. Klincewicz, 1981 .

HUB LOCATION IN BACKBONE/TRIBUTARY NETWORK DESIGN: A REVIEW

J. G. Klincewicz, J. Klincewicz, 1998 .

A dual algorithm for the uncapacitated hub location problem

J. G. Klincewicz, J. Klincewicz, 1996 .

Optimal and heuristic algorithms for multiproduct uncapacitated facility location

J. G. Klincewicz, J. Klincewicz, H. Luss, 1986 .

Special Issue on Converged Optical Networks

Biswanath Mukherjee, Piet Demeester, Ioannis Tomkos, 2009 .

Using grasp to solve the component grouping problem

Arvind Rajan, John G. Klincewicz, J. Klincewicz, 1994 .

Implementing an "exact" Newton method for separable convex transportation problems

J. G. Klincewicz, John G. Klincewicz, J. Klincewicz, 1989, Networks.

Planning and consolidating shipments from a warehouse

John G. Klincewicz, M B Rosenwein, J. Klincewicz, 1997 .

A Dual-Based Algorithm for Multiproduct Uncapacitated Facility Location

Hanan Luss, J. G. Klincewicz, John G. Klincewicz, 1987, Transp. Sci..

Enumeration and Search Procedures for a Hub Location Problem with Economies of Scale

J. G. Klincewicz, John G. Klincewicz, J. Klincewicz, 2002, Ann. Oper. Res..

Solving a Freight Transport Problem Using Facility Location Techniques

John G. Klincewicz, J. Klincewicz, 1990, Oper. Res..

A large-scale multilocation capacity planning model

Chang-Sung Yu, John G. Klincewicz, Hanan Luss, 1988 .

A large-scale distribution and location model

J. G. Klincewicz, J. Klincewicz, 1985, AT&T Technical Journal.

A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints

Hanan Luss, J. G. Klincewicz, John G. Klincewicz, 1986 .

Design of Stacked Self-Healing Rings Using a Genetic Algorithm

Hanan Luss, J. G. Klincewicz, John G. Klincewicz, 2000, J. Heuristics.

Designing tributary networks with multiple ring families

Dicky C. K. Yan, Hanan Luss, J. G. Klincewicz, 1998, Comput. Oper. Res..

Fleet Size Planning when Outside Carrier Services Are Available

John G. Klincewicz, Hanan Luss, Martha G. Pilcher, 1990, Transp. Sci..

Using GRASP to solve the generalised graph colouring problem with application to cell site assignment

J. G. Klincewicz, John G. Klincewicz, J. Klincewicz, 2012 .

Network Design and Architectures for Highly Dynamic Next-Generation IP-Over-Optical Long Distance Networks

Dahai Xu, Guangzhi Li, R. Doverspike, 2009, Journal of Lightwave Technology.

Assigning Telecommunications Nodes to Community of Interest Clusters

John G. Klincewicz, J. Klincewicz, 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

Avoiding local optima in thep-hub location problem using tabu search and GRASP

J. G. Klincewicz, John G. Klincewicz, J. Klincewicz, 1993, Ann. Oper. Res..

Heuristics for the p-hub location problem

J. G. Klincewicz, John G. Klincewicz, J. Klincewicz, 1991 .

The Airline Exception Scheduling Problem

J. G. Klincewicz, John G. Klincewicz, Moshe B. Rosenwein, 1995, Transp. Sci..

Design of metro Ethernet networks

Jian Li, Robert D. Doverspike, David F. Lynch, 2010, 2010 17th IEEE Workshop on Local & Metropolitan Area Networks (LANMAN).

A Newton method for convex separable network flow problems

John G. Klincewicz, J. Klincewicz, 1983, Networks.

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

Dahai Xu, Gi Tae Kim, R. Doverspike, 2012, IEEE/OSA Journal of Optical Communications and Networking.

Optimization Issues in Quality of Service

J. G. Klincewicz, John G. Klincewicz, J. Klincewicz, 2006, Handbook of Optimization in Telecommunications.