Hearn D.W.

D.W. Hearn

Information about the author D.W. Hearn will soon be added to the site.
Found 4 papers in total
Continuous characterizations of the maximum clique problem
Continuous characterizations of the maximum clique problem
1997
Given a graph G whose adjacency matrix is A , the Motzkin–Strauss formulation of...
A new dynamic-programming algorithm for the single item capacitated dynamic lot-size model
A new dynamic-programming algorithm for the single item capacitated dynamic lot-size model
1994
We develop a new dynamic programming method for the single item capacitated dynamic...
A dynamic-programming algorithm for dynamic lot-size models with piecewise-linear costs
A dynamic-programming algorithm for dynamic lot-size models with piecewise-linear costs
1994
We propose a new algorithm for dynamic lot size models (LSM) in which production and...
Benders decomposition for variational inequalities
Benders decomposition for variational inequalities
1990
The partitioning technique of J.F. Benders, which was generalized to nonlinear...
Papers per page: