Donald W. Hearn

18 papers Journal 14Unranked 2
YearRankTypeTitle / Venue / Authors
2010 J jnl
A heuristic method for the minimum toll booth problem.
J. Glob. Optim.
Lihui Bai, Donald W. Hearn, Siriphong Lawphongpanich
2009 — ch.
Lagrangian Duality: BASICS.
Encyclopedia of Optimization
Donald W. Hearn, Timothy J. Lowe
2009 — ch.
Single Facility Location: Circle Covering Problem.
Encyclopedia of Optimization
Donald W. Hearn
2004 J jnl
An MPEC approach to second-best toll pricing.
Math. Program.
Siriphong Lawphongpanich, Donald W. Hearn
2004 J jnl
Decomposition techniques for the minimum toll revenue problem.
Networks
Lihui Bai, Donald W. Hearn, Siriphong Lawphongpanich
2001 J jnl
Approximate solutions to the turbine balancing problem.
Eur. J. Oper. Res.
Leonidas S. Pitsoulis, Panos M. Pardalos, Donald W. Hearn
1997 J jnl
Continuous Characterizations of the Maximum Clique Problem.
Math. Oper. Res.
Luana E. Gibbons, Donald W. Hearn, Panos M. Pardalos, Motakuri V. Ramana
1995 J jnl
Minimizing the error bound for the dynamic lot size model.
Oper. Res. Lett.
Hsin-Der Chen, Donald W. Hearn, Chung-Yee Lee
1994 J jnl
A dynamic programming algorithm for dynamic lot size models with piecewise linear costs.
J. Glob. Optim.
Hsin-Der Chen, Donald W. Hearn, Chung-Yee Lee
1994 J jnl
A new dynamic programming algorithm for the single item capacitated dynamic lot size model.
J. Glob. Optim.
Hsin-Der Chen, Donald W. Hearn, Chung-Yee Lee
1993 — conf
A continuous based heuristic for the maximum clique problem.
Cliques, Coloring, and Satisfiability
Luana E. Gibbons, Donald W. Hearn, Panos M. Pardalos
1993 J jnl
Application of the dual active set algorithm to quadratic network optimization.
Comput. Optim. Appl.
William W. Hager, Donald W. Hearn
1993 J jnl
Restricted simplicial decomposition for convex constrained problems.
Math. Program.
José A. Ventura, Donald W. Hearn
1990 J jnl
Benders Decomposition for Variational Inequalities.
Math. Program.
Siriphong Lawphongpanich, Donald W. Hearn
1982 J jnl
Efficient Algorithms for the (Weighted) Minimum Circle Problem.
Oper. Res.
Donald W. Hearn, James Vijay
1982 J jnl
The gap function of a convex program.
Oper. Res. Lett.
Donald W. Hearn
1978 J jnl
A subgradient algorithm for certain minimax and minisum problems.
Math. Program.
Jacques A. Chatelon, Donald W. Hearn, Timothy J. Lowe
1973 — conf
Computational aspects of a Dual algorithm for quadratically constrained quadratic programs.
ACM Annual Conference
Donald W. Hearn, William D. Randolph