Donald W. Hearn

According to our database1, Donald W. Hearn authored at least 18 papers between 1973 and 2010.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2010
A heuristic method for the minimum toll booth problem.
J. Glob. Optim., 2010

2009
Lagrangian Duality: BASICS.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Single Facility Location: Circle Covering Problem.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

2004
Decomposition techniques for the minimum toll revenue problem.
Networks, 2004

An MPEC approach to second-best toll pricing.
Math. Program., 2004

2001
Approximate solutions to the turbine balancing problem.
Eur. J. Oper. Res., 2001

1997
Continuous Characterizations of the Maximum Clique Problem.
Math. Oper. Res., 1997

1995
Minimizing the error bound for the dynamic lot size model.
Oper. Res. Lett., 1995

1994
A dynamic programming algorithm for dynamic lot size models with piecewise linear costs.
J. Glob. Optim., 1994

A new dynamic programming algorithm for the single item capacitated dynamic lot size model.
J. Glob. Optim., 1994

1993
Restricted simplicial decomposition for convex constrained problems.
Math. Program., 1993

Application of the dual active set algorithm to quadratic network optimization.
Comput. Optim. Appl., 1993

A continuous based heuristic for the maximum clique problem.
Proceedings of the Cliques, 1993

1990
Benders Decomposition for Variational Inequalities.
Math. Program., 1990

1982
The gap function of a convex program.
Oper. Res. Lett., 1982

Efficient Algorithms for the (Weighted) Minimum Circle Problem.
Oper. Res., 1982

1978
A subgradient algorithm for certain minimax and minisum problems.
Math. Program., 1978

1973
Computational aspects of a Dual algorithm for quadratically constrained quadratic programs.
Proceedings of the ACM annual conference, Atlanta, Georgia, USA, August 27-29, 1973, 1973


  Loading...