How optimization algorithms work & improving their performance

Model contains large quadratic objective coefficient range.
2 votes 9 comments
Gurobi stopping criteria
0 votes 7 comments
Distributed MIP logging & ramp-up question
3 votes 7 comments
Early Branching in Branch-and-Cut
0 votes 6 comments
Lazy constraints not working?
0 votes 5 comments
Number of Solutions
0 votes 4 comments
Setting stop criterion to maximum one solution changes the behaviour of branch and bound
0 votes 4 comments
how to obtain the solution information of sub-problem when using callback
0 votes 3 comments
The objective bounds improve slowly!
0 votes 3 comments
Different results solving the same problem twice with a for loop
0 votes 3 comments
How to test the performance of an optimal solution on different scenarios?
0 votes 3 comments
Cores vs. Threads
0 votes 3 comments
Positive GAP interpretation when an optimal solution is found
0 votes 2 comments
Cutting planes
0 votes 2 comments
Bound update rule
0 votes 2 comments
how to spped up gurobi with SOCP?
0 votes 2 comments
same LP solution multiple times in root node, user cuts ignored
1 vote 1 comment
Cut callback
0 votes 1 comment
Questions on Gurobi's algorithm
0 votes 1 comment
Cannot find feasible solution
0 votes 1 comment
Very slow MIP solving for small problem, how to speed up?
0 votes 1 comment
Time limit on a parallel solve
0 votes 1 comment
Does the order affect LP performance
0 votes 1 comment
Default values NumericFocus and ScaleFlag
0 votes 1 comment
Question about MILP parallelization
0 votes 1 comment