Donald W. Hearn

Available identifiers

zbMath Open hearn.donald-wMaRDI QIDQ177052

List of research outcomes

Publication	Date of Publication	Type
A heuristic method for the minimum toll booth problem	2010-11-12	Paper
Traffic assignment: equilibrium models	2008-10-17	Paper
Relaxed toll sets for congestion pricing problems	2006-10-17	Paper
Decomposition techniques for the minimum toll revenue problem	2005-01-12	Paper
An MPEC approach to second-best toll pricing.	2005-01-11	Paper
https://portal.mardi4nfdi.de/entity/Q4811402	2004-09-06	Paper
Approximate solutions to the turbine balancing problem.	2001-01-01	Paper
Continuous Characterizations of the Maximum Clique Problem	1998-03-29	Paper
https://portal.mardi4nfdi.de/entity/Q4495158	1998-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4363160	1997-12-18	Paper
https://portal.mardi4nfdi.de/entity/Q5687197	1996-12-11	Paper
https://portal.mardi4nfdi.de/entity/Q5687252	1996-12-11	Paper
Minimizing the error bound for the dynamic lot size model	1996-01-07	Paper
A new dynamic programming algorithm for the single item capacitated dynamic lot size model	1995-05-15	Paper
A dynamic programming algorithm for dynamic lot size models with piecewise linear costs	1995-05-15	Paper
https://portal.mardi4nfdi.de/entity/Q4293525	1994-05-29	Paper
Restricted simplicial decomposition for convex constrained problems	1993-08-30	Paper
Application of the dual active set algorithm to quadratic network optimization	1993-08-23	Paper
Restricted Simplicial Decomposition for Symmetric Convex Cost Flow Problems	1993-08-17	Paper
Benders decomposition for variational inequalities	1990-01-01	Paper
Lagrangian dual ascent by generalized linear programming	1989-01-01	Paper
Restricted simplicial decomposition: Computation and extensions	1987-01-01	Paper
Finiteness in restricted simplicial decomposition	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3720262	1984-01-01	Paper
Efficient Algorithms for the (Weighted) Minimum Circle Problem	1982-01-01	Paper
The gap function of a convex program	1982-01-01	Paper
A Subgradient Algorithm for Certain Minimax and Minisum Problems—The Constrained Case	1982-01-01	Paper
A subgradient algorithm for certain minimax and minisum problems	1978-01-01	Paper
The minimum sphere covering a convex polyhedron	1975-01-01	Paper
The Minimum Covering Sphere Problem	1972-01-01	Paper

Research outcomes over time

This page was built for person: Donald W. Hearn