Brilliant Challenges - Optimization Problems Definition Contest


The following problems have been awarded prizes. They will become available together with the rest of submitted problems soon, after minor tuning.

We will publish a report summarizing all submissions soon.

About the challenge

Evaluation as a Service (EaaS), in brief, is defined as a paradigm of keeping the evaluation data in the cloud and allowing to access them via dedicated interfaces1. Optil.io2 is an online judge platform following EaaS concept that allows the users from all over the world to continuously and reliably evaluate the algorithmic solutions of complex optimization problems and to organize specific science- and industry-inspired challenges. By hiding the test cases from the participants and providing the homogeneous, cloud-based runtime environment, we provide an objective method for assessment of various algorithms, submitted by the users, solving optimization problems. The aim of the Brilliant Challenges contest is to collect interesting, applicable problems that could be published on the platform and addressed by its users. If you are interested in participating you can read detailed rules and terms and conditions of the contest.

Participate to win the main prize of 1000 EUR or one of the smaller prizes! Submit your problem before 3 October 2017.

How to participate

To participate in the Brilliant Challenges contest follow these simple steps:

  1. Sign up at the web site if you have not done it yet.
  2. Sign in using your username and password.
  3. Accept the contest rules.
  4. Add the problem following the creating problems guide.

If you have any questions do not hesitate to contact us.


1Hanbury, Allan, et al. "Evaluation-as-a-Service: Overview and outlook", arXiv:1512.07454, 2015.

2Wasik, Szymon, et al. "Optil. io: Cloud Based Platform For Solving Optimization Problems Using Crowdsourcing Approach", Proceedings of the 19th ACM Conference on Computer Supported Cooperative Work and Social Computing Companion, doi:10.1145/2818052.2869098, 433-436, ACM, 2016.