Professional Documents
Culture Documents
Nphard
Nphard
However, there are algorithms that can often solve them much faster than brute force.
Pulp can also solve integer programs, which Ill show you in a bit. But first, lets discuss the high level
approach to how integer programs will solve our original driver scheduling problem. Well solve our
problem by modeling it as a weighted set partitioning problem. This image gives an intuitive idea of the
problem: