Hi. I’ve written many mixed-integer programming problems and sent them to solvers (HiGHS and Gurobi). The solvers seem to follow this pattern. Adding cuts at the root node (Gomory cut among other cuts) Doing a branch and bound search. However, it looks like most effort was spent on (1). Not so mu…

The big difference is that search is problem specific and MILP solvers don’t know nearly as much about the domain. Minimax search is a fun case where the problem is recursive so at every level, the solution to the problem is trivial if you’ve solved the problem 1 layer down. This means that in Chess…

Why are Mixed integer programming solvers focused on finding cuts and not so much on search?

Specific Domains Optimization (Mathematical)

odow October 7, 2024, 1:58am 6

I’ll also link to Timo’s great (recent) series of videos:

5 Likes

Topic		Replies	Views
Guroubi decides not to apply usercuts during the search? Optimization (Mathematical)	0	476	August 4, 2018
Accessing the root node solution Optimization (Mathematical)	6	1756	April 17, 2018
Adding cuts to a MILP prior to the solving Optimization (Mathematical) jump	3	1191	June 4, 2018
[JuMP] Pure integer solutions (Combinatorial optimization?) Optimization (Mathematical)	6	2860	September 30, 2017
Cutting plane algorithm performance varies with Gurobi and CPLEX Optimization (Mathematical)	6	2389	March 13, 2018

Why are Mixed integer programming solvers focused on finding cuts and not so much on search?

Related topics