# Tag Info

### CP-SAT's NumBooleans() parameter

This does not count Boolean variables in the model. It counts Boolean variables in the SAT solver. This is vastly different. Presolve is happening, some constraints are expanded, search and conflicts ...
• 2,089
1 vote
Accepted

### Alternative Approaches to Assignment Problem

If you are open to heuristic (approximate) solutions, one possibility is to generate a set of routes and then rewrite the problem to assign trucks and customers/orders to routes. In problems of this ...
• 35.6k
1 vote

### Alternative Approaches to Assignment Problem

It seems that you are trying to solve a pickup and delivery problem. MIP solvers are often not the best tool for that, and getting good results with them requires special models and tricks. There are ...
• 1,722
Accepted

### Relevance of order of model construction in CP-SAT

This is a well know behavior of all MIP/CP solvers. Presolve and search are heavily heuristics based (to limit the complexity of the underlying algorithms), and thus are dependent on variables and ...
• 2,089