Jeffrey L. Kennington

From MaRDI portal
Person:1066817

Available identifiers

zbMath Open kennington.jeffery-lMaRDI QIDQ1066817

List of research outcomes

PublicationDate of PublicationType
Use of hidden network structure in the set partitioning problem2022-08-30Paper
The Uncapacitated Time-Space Fixed-Charge Network Flow Problem: An Empirical Investigation of Procedures for Arc Capacity Assignment2012-07-28Paper
Generalized Networks: The Theory of Preprocessing and an Empirical Analysis2012-06-08Paper
Wavelength Translation in WDM Networks: Optimization Models and Solution Procedures2012-06-08Paper
The Path Restoration Version of the Spare Capacity Allocation Problem with Modularity Restrictions: Models, Algorithms, and an Empirical Analysis2012-05-30Paper
Wavelength Routing and Assignment in a Survivable WDM Mesh Network2009-07-05Paper
https://portal.mardi4nfdi.de/entity/Q52940462007-07-23Paper
Hierarchical cellular network design with channel allocation2004-11-22Paper
An Efficient Decomposition Algorithm to Optimize Spare Capacity in a Telecommunications Network2003-12-16Paper
A truncated exponential algorithm for the lightly constrained assignment problem1997-10-20Paper
https://portal.mardi4nfdi.de/entity/Q43522201997-08-28Paper
Recovery from numerical instability during basis reinversion1997-07-17Paper
https://portal.mardi4nfdi.de/entity/Q48453641996-06-23Paper
The singly constrained assignment problem: An AP basis algorithm1996-03-31Paper
The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm1994-03-27Paper
The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm1993-08-30Paper
Generalized Networks: Parallel Algorithms and an Empirical Analysis1993-04-01Paper
Performance Characteristics of the Jacobi and the Gauss-Seidel Versions of the Auction Algorithm on the Alliant FX/81993-02-18Paper
An Empirical Analysis of the Dense Assignment Problem: Sequential and Parallel Implementations1993-02-11Paper
A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem1992-06-28Paper
Minimal spanning trees: An empirical investigation of parallel algorithms1989-01-01Paper
The equal flow problem1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37472021987-01-01Paper
A generalization of Polyak's convergence result for subgradient optimization1987-01-01Paper
Reoptimization procedures for bounded variable primal simplex network algorithms1986-01-01Paper
The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm1986-01-01Paper
A note on splitting the bump in an elimination factorization1982-01-01Paper
Spike swapping in basis reinversion1980-01-01Paper
A polynomially bounded algorithm for a singly constrained quadratic program1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39687581980-01-01Paper
A new storage reduction technique for the solution of the group problem1979-01-01Paper
Nonextreme point solution strategies for linear programs1979-01-01Paper
A Survey of Linear Cost Multicommodity Network Flows1978-01-01Paper
A product form representation of the inverse of a multicommodity cycle matrix1977-01-01Paper
Solving multicommodity transportation problems using a primal partitioning simplex technique1977-01-01Paper
A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem1976-01-01Paper
Efficient computational devices for the capacitated transportation problem1975-01-01Paper
The Group-Theoretic Structure in the Fixed-Charge Transportation Problem1973-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Jeffrey L. Kennington