# Tag Info

### Are there competitions for integer programming?

There are no competitions targeting general integer programming or mixed integer programming, but there are (or were) benchmarks, such as the MIPLIB (linear) and the MINLPLIB (nonlinear). There are ...
• 485
Accepted

### Are there competitions for integer programming?

There are competitions for constraint satisfaction solvers. Some problems there can be readily translated to IP solvers as well. See e.g., MiniZinc challenge which has taken place yearly since 2008 or ...
• 22.5k

### Are there competitions for integer programming?

There was a Pseudo-Boolean solver competition from 2005-2012, but (as far as I can tell) nothing since then. Integer Linear Programming is a subset of Pseudo-Boolean programming. See the 2012 ...
• 8,071

### Dijikstra's algorithm with "hull" value catch

Use the product construction to build a graph on $NK$ vertices and $MK$ edges, where each vertex records both which island you are at and how much hull you have left. Then, use Dijkstra's algorithm ...
• 158k

### Are there competitions for integer programming?

It is not really a competition, but there is the well-known Mittelmann benchmark, which lists results for some of the best solvers (including commercial ones) for mixed-integer programming and related ...
• 71
1 vote
Accepted

### How to Prepare for Informatics Olympiad and ACM-ICPC?

I believe that a good starting point is the following list compiled by Codechef: https://www.codechef.com/certification/data-structures-and-algorithms/prepare It contains resources and problems for ...
• 26
1 vote

### Find the minimum subset of a set of numbers with product divisible by a given integer

I am the author of this problem and it was problem B in my contest. I have written an editorial here with the normal DP solution to get the 50 points and the coordinate compression DP which would get ...
1 vote
Accepted

### Find the minimum subset of a set of numbers with product divisible by a given integer

Compute all the prime factors of $k$. It would take $O(\sqrt{k})$ time $\approx$ $10^5$ time. Note that, there could be at most $10$ different prime factors of $k$ since considering the $10$ smallest ...
• 6,147

Only top scored, non community-wiki answers of a minimum length are eligible