Abstract
A number of results on constructing polynomial asymptotic optimal algorithms for several hard optimization problems problems is presented. Asymptotically optimal approach is applying to TSP and its variations; degree constrained connected subgraph problem; multi-index assignment problems; maximum total weight subset problem; spanning tree problem with a bounded below diameter; bin packing problem; uncapacitated facility location problem. 1
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.