Year-end Sale % OFF 
Abstract
A new scheme of approximate lexicographic search is proposed for the solution of the multidimensional Boolean knapsack problem. The main idea of the algorithm is to gradually define the lexicographic order (ordering of variables) in which “qualitative” solutions of the problem belong to a direct two-sided lexicographic constraint whose upper bound is the lexicographic maximum of the set of feasible solutions of the problem in this order. Since the search for “qualitative” solutions in each order is carried out on a bounded lexicographic interval, the proposed algorithm is called a bounded lexicographic search. The quality of the approximate method of bounded lexicographic search is investigated by solving test tasks from the well-known Beasley and Glover–Kochenberger sets.
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 callDisclaimer: 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.
