# Donald W. Hearn - Publications

## Affiliations: | Industrial and Systems Engineering | University of Florida, Gainesville, Gainesville, FL, United States |

##### Area:

Industrial Engineering, Operations Research##### Website:

https://www.ise.ufl.edu/hearn/Year | Citation | Score | |||
---|---|---|---|---|---|

2020 | Benincasa G, Pavlikov K, Hearn D. Algorithms and Software for the Golf Director Problem Journal of Systems Architecture. 1-18. DOI: 10.3233/Jsa-200346 |
0.532 | |||

2010 | Bai L, Hearn DW, Lawphongpanich S. A heuristic method for the minimum toll booth problem Journal of Global Optimization. 48: 533-548. DOI: 10.1007/S10898-010-9527-7 |
0.675 | |||

2008 | Florian M, Hearn DW. Traffic assignment: Equilibrium models Springer Optimization and Its Applications. 17: 571-592. DOI: 10.1007/978-0-387-77247-9_22 |
0.388 | |||

2007 | Hamdouch Y, Florian M, Hearn DW, Lawphongpanich S. Congestion pricing for multi-modal transportation systems Transportation Research Part B: Methodological. 41: 275-291. DOI: 10.1016/J.Trb.2006.04.003 |
0.439 | |||

2005 | Yildirim MB, Hearn DW. A first best toll pricing framework for variable demand traffic assignment problems Transportation Research Part B: Methodological. 39: 659-678. DOI: 10.1016/J.Trb.2004.08.001 |
0.493 | |||

2004 | Lawphongpanich S, Hearn DW. An MPEC approach to second-best toll pricing Mathematical Programming. 101: 33-55. DOI: 10.1007/S10107-004-0536-5 |
0.608 | |||

2004 | Bai L, Hearn DW, Lawphongpanich S. Decomposition techniques for the minimum toll revenue problem Networks. 44: 142-150. DOI: 10.1002/Net.20024 |
0.669 | |||

2001 | Florian M, Hearn DW. Traffic assignment: Equilibrium models Proceedings of the Institution of Mechanical Engineers. Part I: Journal of Systems and Control Engineering. 215: 305-315. DOI: 10.1243/0959651011541139 |
0.399 | |||

2001 | Pitsoulis LS, Pardalos PM, Hearn DW. Approximate solutions to the turbine balancing problem European Journal of Operational Research. 130: 147-155. DOI: 10.1016/S0377-2217(00)00029-1 |
0.621 | |||

1997 | Gibbons LE, Hearn DW, Pardalos PM, Ramana MV. Continuous Characterizations of the Maximum Clique Problem Mathematics of Operations Research. 22: 754-768. DOI: 10.1287/Moor.22.3.754 |
0.438 | |||

1997 | Gibbons LE, Hearn DW, Pardalos PM, Ramana MV. Continuous characterizations of the maximum clique problem Mathematics of Operations Research. 22: 754-768. |
0.315 | |||

1995 | Chen HD, Hearn DW, Lee CY. Minimizing the error bound for the dynamic lot size model Operations Research Letters. 17: 57-68. DOI: 10.1016/0167-6377(94)00063-C |
0.362 | |||

1994 | Chen HD, Hearn DW, Lee CY. A dynamic programming algorithm for dynamic lot size models with piecewise linear costs Journal of Global Optimization. 4: 397-413. DOI: 10.1007/Bf01099265 |
0.505 | |||

1994 | Chen HD, Hearn DW, Lee CY. A new dynamic programming algorithm for the single item capacitated dynamic lot size model Journal of Global Optimization. 4: 285-300. DOI: 10.1007/Bf01098363 |
0.543 | |||

1993 | Ventura JA, Hearn DW. Restricted simplicial decomposition for convex constrained problems Mathematical Programming. 59: 71-85. DOI: 10.1007/Bf01581238 |
0.627 | |||

1993 | Hager WW, Hearn DW. Application of the dual active set algorithm to quadratic network optimization Computational Optimization and Applications. 1: 349-373. DOI: 10.1007/Bf00248762 |
0.602 | |||

1992 | Ventura JA, Hearn DW. Restricted Simplicial Decomposition for Symmetric Convex Cost Flow Problems American Journal of Mathematical and Management Sciences. 12: 363-381. DOI: 10.1080/01966324.1992.10737340 |
0.605 | |||

1990 | Hearn DW, Lawphongpanich S. A dual ascent algorithm for traffic assignment problems Transportation Research Part B. 24: 423-430. DOI: 10.1016/0191-2615(90)90037-Y |
0.549 | |||

1990 | Lawphongpanich S, Hearn DW. Benders decomposition for variational inequalities Mathematical Programming. 48: 231-247. DOI: 10.1007/Bf01582257 |
0.538 | |||

1989 | Barton RR, Hearn DW, Lawphongpanich S. The equivalence of transfer and generalized benders decomposition methods for traffic assignment Transportation Research Part B. 23: 61-73. DOI: 10.1016/0191-2615(89)90024-6 |
0.549 | |||

1989 | Hearn DW, Lawphongpanich S. Lagrangian dual ascent by generalized linear programming Operations Research Letters. 8: 189-196. DOI: 10.1016/0167-6377(89)90059-X |
0.516 | |||

1988 | Ventura JA, Hearn DW. Computing the effective resistance in a aystem of conducting sticks Computers and Industrial Engineering. 14: 171-179. DOI: 10.1016/0360-8352(88)90026-5 |
0.539 | |||

1987 | Hearn DW, Lawphongpanich S, Ventura JA. RESTRICTED SIMPLICIAL DECOMPOSITION: COMPUTATION AND EXTENSIONS Mathematical Programming Study. 99-118. |
0.519 | |||

1985 | Hearn DW, Lawphongpanich S, Ventura JA. Finiteness in restricted simplicial decomposition Operations Research Letters. 4: 125-130. DOI: 10.1016/0167-6377(85)90016-1 |
0.498 | |||

1984 | Lawphongpanich S, Hearn DW. Simplical decomposition of the asymmetric traffic assignment problem Transportation Research Part B. 18: 123-133. DOI: 10.1016/0191-2615(84)90026-2 |
0.61 | |||

1984 | Hearn DW, Lawphongpanich S, Nguyen S. Convex programming formulations of the asymmetric traffic assignment problem Transportation Research Part B. 18: 357-365. DOI: 10.1016/0191-2615(84)90017-1 |
0.6 | |||

1983 | Elzinga DJ, Hearn DW. On stopping rules for facilities location algorithms Iie Transactions (Institute of Industrial Engineers). 15: 81-83. DOI: 10.1080/05695558308974616 |
0.459 | |||

1982 | Hearn DW, Vijay J. Efficient Algorithms for the Weighted Minimum Circle Problem Operations Research. 30: 777-795. DOI: 10.1287/Opre.30.4.777 |
0.558 | |||

1982 | Chatelon J, Hearn D, Lowe TJ. A Subgradient Algorithm for Certain Minimax and Minisum Problems—The Constrained Case Siam Journal On Control and Optimization. 20: 455-469. DOI: 10.1137/0320034 |
0.557 | |||

1982 | Hearn DW. The gap function of a convex program Operations Research Letters. 1: 67-71. DOI: 10.1016/0167-6377(82)90049-9 |
0.501 | |||

1981 | Hearn DW, Ribera J. Convergence of the Frank-Wolfe method for certain bounded variable traffic assignment problems Transportation Research Part B. 15: 437-442. DOI: 10.1016/0191-2615(81)90028-X |
0.575 | |||

1980 | Hearn DW, Ribera J. BOUNDED FLOW EQUILIBRIUM PROBLEMS BY PENALTY METHODS Journal De Physique Paris. 1: 162-166. |
0.436 | |||

1978 | Hearn D, Lowe TJ. A subgradient procedure for the solution of minimax location problems Computers and Industrial Engineering. 2: 17-25. DOI: 10.1016/0360-8352(78)90004-9 |
0.569 | |||

1978 | Chatelon JA, Hearn DW, Lowe TJ. A subgradient algorithm for certain minimax and minisum problems Mathematical Programming. 15: 130-145. DOI: 10.1007/Bf01609012 |
0.64 | |||

1977 | Chan AW, Hearn DW. A Rectilinear Distance Round-Trip Location Problem Transportation Science. 11: 107-123. DOI: 10.1287/Trsc.11.2.107 |
0.518 | |||

1976 | Elzinga J, Hearn D, Randolph WD. Minimax Multifacility Location with Euclidean Distances Transportation Science. 10: 321-336. DOI: 10.1287/Trsc.10.4.321 |
0.521 | |||

1974 | Elzinga J, Hearn D. The minimum sphere covering a convex polyhedron Naval Research Logistics Quarterly. 21: 715-718. DOI: 10.1002/Nav.3800210414 |
0.452 | |||

1973 | Elzinga J, Hearn DW. Letter to the Editor—A Note on a Minimax Location Problem Transportation Science. 7: 100-103. DOI: 10.1287/Trsc.7.1.100 |
0.512 | |||

1972 | Elzinga J, Hearn DW. Geometrical Solutions for Some Minimax Location Problems Transportation Science. 6: 379-394. DOI: 10.1287/Trsc.6.4.379 |
0.484 | |||

1972 | Elzinga DJ, Hearn DW. The Minimum Covering Sphere Problem Management Science. 19: 96-104. DOI: 10.1287/Mnsc.19.1.96 |
0.57 | |||

Show low-probability matches. |