IIMOC
International Math Optimization ChallengeOne tough problem. Worldwide competition.
How It Works
IIMOC is a global Math/Computer Science competition. Each team gets an approachable but unsolvable optimization problem and four weeks to submit their best solution. The club with the lowest loss wins. Special awards for creativity and best approach are also given.
Once the contest opens, the organizers release the official problem statement and the accompanying test dataset. Your team's goal is to design a Python/C++/Java program that runs in a reasonable amount of time and drives the loss on that dataset as low as possible.
Once the contest opens, the organizers release the official problem statement and the accompanying test dataset. Your team's goal is to design a Python/C++/Java program that runs in a reasonable amount of time and drives the loss on that dataset as low as possible.
Teamwork
Solve together as a club. Collaboration is key.
Infinite Submissions
We believe in second chances ;O
Optimization
Minimize loss or maximize gain in a real-world scenario.
Global Rankings
See how you stack up against clubs worldwide.
Where Clubs Compete
Join students from:
USA
Japan
Korea
Taiwan
Morocco
Canada
Ethiopia
UK
China
India
Iran
Pakistan
Netherlands
Germany
Vietnam
Poland
Qatar
Finland
Hong Kong
Egypt
Bahrain
2025 Problems
Official 2025 Problem: Polypack
The official IIMOC 2025 optimization problem is now live.
Read the statement, download the data, and start optimizing.
View Official Problem
Permutation (Sample)
Author: Qiuyang Mang (Sua)Edited by: Edwin Chen
Editorial by: Alexander Du
Prepared by: Alexander Du & Edwin Chen
Additional Official Materials
Author: Shang Zhou (Berkeley Sky Computing Lab)Edited by: Shang Zhou
Editorial by: Shang Zhou
Prepared by: Edwin Chen
2025 Competition Timeline
Mark your calendar for every stage of IIMOC 2025.
Nov 22, 2025
Competition begins — official problem released
Dec 21, 2025
Submission deadline
Dec 30, 2025
Results released