Abstract
The paper considers the solution of mixed combinatorial optimization problems on arrangements by the method of construction of lexicographic equivalence. A generalization of the relation of equivalence, which is used for space splitting, is proposed and its properties are analyzed. The algorithms of the method known earlier are modified, an approximated algorithm is validated.
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.