rust code algorithm

Job ID: 37624428

Budget: €30 – €250 EUR

I am on the lookout for an incredibly efficient programmer with expertise in Rust. I need an algorithm to find the upper bound for the travelling salesman problem (TSP) using the Lin-Kernighan method. This project demands a solid understanding of algorithms, data compression, and advanced problem-solving.
There is also provided code which you should use, because it will be a part of another algorithm. There are also instances you will need. So it is solely about implementation of this algorithm.

Primary responsibilities include:
- Understanding the requirement and purpose succinctly.
- Designing and crafting the algorithm in Rust code reliably.
- Ensuring the code sorts data, searches data, and compresses data efficiently.
- Testing the code diligently to ensure it meets the project's expectations.

The ideal candidate:
- Has significant experience programming in Rust.
- Has core knowledge about the Lin-Kernighan method.
- Understands data sorting, searching, and compression techniques.

Time is of utmost importance as I need this project completed ASAP. Although the previous work wasn't specified, a detailed project proposal covering the implementation strategy, specific knowledge about the Lin-Kernighan method, and past experience with similar projects will be advantageous. I look forward to your bid.
Related categories: Algorithm RUST Programming