Donald W. Hearn

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

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2010

A heuristic method for the minimum toll booth problem.

Lihui Bai, Donald W. Hearn, Siriphong Lawphongpanich

J. Glob. Optim., 2010

2009

Lagrangian Duality: BASICS.

Donald W. Hearn, Timothy J. Lowe

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Single Facility Location: Circle Covering Problem.

Donald W. Hearn

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

2004

Decomposition techniques for the minimum toll revenue problem.

Lihui Bai, Donald W. Hearn, Siriphong Lawphongpanich

Networks, 2004

An MPEC approach to second-best toll pricing.

Siriphong Lawphongpanich, Donald W. Hearn

Math. Program., 2004

2001

Approximate solutions to the turbine balancing problem.

Leonidas S. Pitsoulis, Panos M. Pardalos, Donald W. Hearn

Eur. J. Oper. Res., 2001

1997

Continuous Characterizations of the Maximum Clique Problem.

Luana E. Gibbons, Donald W. Hearn, Panos M. Pardalos, Motakuri V. Ramana

Math. Oper. Res., 1997

1995

Minimizing the error bound for the dynamic lot size model.

Hsin-Der Chen, Donald W. Hearn, Chung-Yee Lee

Oper. Res. Lett., 1995

1994

A dynamic programming algorithm for dynamic lot size models with piecewise linear costs.

Hsin-Der Chen, Donald W. Hearn, Chung-Yee Lee

J. Glob. Optim., 1994

A new dynamic programming algorithm for the single item capacitated dynamic lot size model.

Hsin-Der Chen, Donald W. Hearn, Chung-Yee Lee

J. Glob. Optim., 1994

1993

Restricted simplicial decomposition for convex constrained problems.

José A. Ventura, Donald W. Hearn

Math. Program., 1993

Application of the dual active set algorithm to quadratic network optimization.

William W. Hager, Donald W. Hearn

Comput. Optim. Appl., 1993

A continuous based heuristic for the maximum clique problem.

Luana E. Gibbons, Donald W. Hearn, Panos M. Pardalos

Proceedings of the Cliques, 1993

1990

Benders Decomposition for Variational Inequalities.

Siriphong Lawphongpanich, Donald W. Hearn

Math. Program., 1990

1982

The gap function of a convex program.

Donald W. Hearn

Oper. Res. Lett., 1982

Efficient Algorithms for the (Weighted) Minimum Circle Problem.

Donald W. Hearn, James Vijay

Oper. Res., 1982

1978

A subgradient algorithm for certain minimax and minisum problems.

Jacques A. Chatelon, Donald W. Hearn, Timothy J. Lowe

Math. Program., 1978

1973

Computational aspects of a Dual algorithm for quadratically constrained quadratic programs.

Donald W. Hearn, William D. Randolph

Proceedings of the ACM annual conference, Atlanta, Georgia, USA, August 27-29, 1973, 1973