Abstract

The main idea of Regular Sequences of Similar Algorithm based on Sparse Linear (HR Algorithm) is to calculation the near optimal solution from the solution of sparse integer programming model. The advantages of HR algorithm are simplifying the problem of huge solution space of integer programming, reducing the number of goal constraints, and turning the problem into a simplified integer programming. The near optimal solution, which is hard to apply accurate method, can be found under limited time by using HR algorithm based on regular sequences.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.