Abstract
The paper describes an objective function hyperplane search heuristic for solving the general all-integer linear programming problem (ILP). The algorithm searches a series of objective function hyperplanes and the search over any given hyperplane is formulated as a bounded knapsack problem. Theory developed for combinations of the objective function and problem constraints is used to guide the search. We evaluate the algorithm's performance on a class of ILP problems to assess the areas of effectiveness.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.