Jeffrey Dean Kelly

Learn More
This article describes an effective and simple primal heuristic to greedily encourage a reduction in the number of binary or 0-1 logic variables before an implicit enumerative-type search heuristic is deployed to find integer-feasible solutions to " hard " production scheduling problems. The basis of the technique is to employ well-known smoothing functions(More)
  • 1