A Heuristic Ceiling Point Algorithm for General Integer Linear Programming
Published in Management Science • Feb 1, 1992
NobleIDNI3P93W36R92S64
Authors:,
Robert M. Saltzman
Frederick S. Hillier
Abstract
This paper first examines the role of ceiling points in solving a pure, general integer linear programming problem (P). Several kinds of ceiling points are defined and analyzed and one kind called “feasible 1-ceiling points” proves to be of special interest. We demonstrate that all optimal solutions...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!