2 citations · 2 across the 4 of their papers we have counts for
1 paper · 1 filter
Dušan Knop, Martin Koutecký, Matthias Mnich
Many fundamental NP-hard problems can be formulated as integer linear programs (ILPs). A famous algorithm by Lenstra solves ILPs in time that is exponential only in the dimension o…