MOTOR 2025 Challenges

According our previous excellent experience at the MOTOT 2024, we are excited to announce the launch of a new competition focused on solving industrial problems presented as challenges. This competition, provided in collaboration with one of our esteemed industrial partners, offers a unique opportunity for participants to showcase their problem-solving skills and innovative thinking. Whether you're a seasoned professional or an enthusiastic newcomer, this competition is your chance to make a significant impact in the industrial sector. This competition not only provides a platform for participants to demonstrate their technical skills but also fosters innovation and collaboration within the field. We encourage all interested individuals and teams to participate and contribute their creative solutions to real-world industrial challenges.

The event will be structured in several phases, each designed to rigorously evaluate the effectiveness and creativity of the proposed solutions. We encourage all innovators, problem-solvers, and forward-thinkers to participate and take on this exciting challenge. Below are the detailed rules and phases of the competition:

Challenge Rules 

1. Application Phase:
- The list of challenges participating in the competition is available on the conference website at http://old.math.nsc.ru/conference/motor/2025/challenges.html. Additionally, you can obtain it by requesting from the organizing committee via email at jkochet@math.nsc.ru.
- Participation in the competition can be either individual or team-based. The team leader submits proposals on behalf of the entire team. Participation in MOTOR2025 is not mandatory.
- Each participant must prepare a proposal addressing one of the challenges.
- The proposal should provide a comprehensive theoretical analysis along and/or an efficient algorithmic solution. It should be presented in 1-2 pages (A4 size), adhering to a free-form style that maintains mathematical correctness throughout.
- Proposals must be submitted via email to jkochet@math.nsc.ru. Submission deadline is May 25th 2025.
- Each participant is allowed to submit no more than one proposal for each challenge.
2. First Round Shortlisting:
- All submitted proposals will undergo a preliminary evaluation by the Technical Committee before the First Round review session that will be organized online.
- Participants will have the opportunity to present their proposals during the online challenge review session on May 30th 2025. Each presentation will be allocated a time slot of 15 minutes.
- The judges of the Technical Committee will evaluate proposals based on a set of comprehensive criteria, that recognizes the theoretical soundness, creativity, practicality, and potential impact of each proposal.
- The Technical Committee will select the top proposals, up to a maximum of eight among all proposals for all challenges.
- Honorable Awards will be announced on June 4th 2025, with a total prize pool of 1.2 million rubles to be distributed among the top proposals.
3. Second Round Shortlisting:
- Winners from the 1st round will be invited to proceed with their research in close collaboration with the industrial partner. They will be required to prepare a detailed proposal that includes preliminary computational results.
- The detailed proposals will be presented during MOTOR2025. During this meeting, the Technical Committee will select the top two proposals among all participating in the 2nd round.
- The total prize pool for the final Honorable Awards is 1 million rubles that will be distributed among the final winners.
4. Rule Changes
The research-oriented nature of the competition involves various risks related to the feasibility of tasks, their timelines, and other factors. Therefore, the organizers reserve the right to make changes to the competition rules during its course. All changes will be published in a timely manner, and participants will be duly informed.

New challenges may be added to the list in the near future. Please keep up with the news.

Challenge 1   Parallel Eigensolver for Tridiagonal Symmetric Matrices
Challenge 2   Self-adaptive strategies for the large-scale Gray Box optimization
Challenge 3   Optimization for Data-Aware Prefix Caching
Challenge 4   Optimizing Determinism and Parallelism in Branch-and-Bound Trees for MIP Problems 
Challenge 5   Graph 3-coloring
Challenge 6   Sensing matrix optimization for Hybrid Beamforming
Challenge 7  Solving Large-Scale Security-Constrained Unit Commitment. Problems Using Machine Learning Approaches 

AI Website Creator