New answers tagged or-tools
5
votes
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
6
votes
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
3
votes
Accepted
Multiplicity-Constraint in Constraint Programming Solvers
What "special" constraints a CP solver provides tends to vary by solver. I think it is fairly common, though, for CP solvers to treat logical expressions as equivalent to binary variables. ...
- 35.6k
Top 50 recent answers are included
Related Tags
or-tools × 117constraint-programming × 39
python × 34
vehicle-routing × 20
scheduling × 18
cp-sat × 17
modeling × 16
mixed-integer-programming × 11
optimization × 9
c++ × 9
linear-programming × 7
c# × 6
integer-programming × 5
cplex × 4
solver × 4
constraint × 4
gurobi × 4
pyomo × 4
traveling-salesman × 4
assignment-problem × 4
java × 4
combinatorial-optimization × 3
network-flow × 3
knapsack × 2
sat × 2