Person:1066817

Available identifiers

zbMath Open kennington.jeffery-lMaRDI QIDQ1066817

List of research outcomes

Publication	Date of Publication	Type
Use of hidden network structure in the set partitioning problem	2022-08-30	Paper
The Uncapacitated Time-Space Fixed-Charge Network Flow Problem: An Empirical Investigation of Procedures for Arc Capacity Assignment	2012-07-28	Paper
Generalized Networks: The Theory of Preprocessing and an Empirical Analysis	2012-06-08	Paper
Wavelength Translation in WDM Networks: Optimization Models and Solution Procedures	2012-06-08	Paper
The Path Restoration Version of the Spare Capacity Allocation Problem with Modularity Restrictions: Models, Algorithms, and an Empirical Analysis	2012-05-30	Paper
Wavelength Routing and Assignment in a Survivable WDM Mesh Network	2009-07-05	Paper
https://portal.mardi4nfdi.de/entity/Q5294046	2007-07-23	Paper
Hierarchical cellular network design with channel allocation	2004-11-22	Paper
An Efficient Decomposition Algorithm to Optimize Spare Capacity in a Telecommunications Network	2003-12-16	Paper
A truncated exponential algorithm for the lightly constrained assignment problem	1997-10-20	Paper
https://portal.mardi4nfdi.de/entity/Q4352220	1997-08-28	Paper
Recovery from numerical instability during basis reinversion	1997-07-17	Paper
https://portal.mardi4nfdi.de/entity/Q4845364	1996-06-23	Paper
The singly constrained assignment problem: An AP basis algorithm	1996-03-31	Paper
The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm	1994-03-27	Paper
The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm	1993-08-30	Paper
Generalized Networks: Parallel Algorithms and an Empirical Analysis	1993-04-01	Paper
Performance Characteristics of the Jacobi and the Gauss-Seidel Versions of the Auction Algorithm on the Alliant FX/8	1993-02-18	Paper
An Empirical Analysis of the Dense Assignment Problem: Sequential and Parallel Implementations	1993-02-11	Paper
A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem	1992-06-28	Paper
Minimal spanning trees: An empirical investigation of parallel algorithms	1989-01-01	Paper
The equal flow problem	1988-01-01	Paper
The frequency assignment problem: A solution via nonlinear programming	1987-01-01	Paper
A generalization of Polyak's convergence result for subgradient optimization	1987-01-01	Paper
Reoptimization procedures for bounded variable primal simplex network algorithms	1986-01-01	Paper
The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm	1986-01-01	Paper
A note on splitting the bump in an elimination factorization	1982-01-01	Paper
Spike swapping in basis reinversion	1980-01-01	Paper
A polynomially bounded algorithm for a singly constrained quadratic program	1980-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3968758	1980-01-01	Paper
A new storage reduction technique for the solution of the group problem	1979-01-01	Paper
Nonextreme point solution strategies for linear programs	1979-01-01	Paper
A Survey of Linear Cost Multicommodity Network Flows	1978-01-01	Paper
A product form representation of the inverse of a multicommodity cycle matrix	1977-01-01	Paper
Solving multicommodity transportation problems using a primal partitioning simplex technique	1977-01-01	Paper
A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem	1976-01-01	Paper
Efficient computational devices for the capacitated transportation problem	1975-01-01	Paper
The Group-Theoretic Structure in the Fixed-Charge Transportation Problem	1973-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Jeffrey L. Kennington