Dong Han

Yes, I provide a full feasible solution and its corresponding objective value to the model. And I verified in the way you suggested, the solution is absolutely feasible and the worse feasible solut...

Hello Marika, Thank you for your response. The thing is, for example, the first solution I provided didn't be accepted when I used GRBcbsolution. And after a few iteration, the fifth solution I pro...

Sure, here is the log information for solving the problem successfully.    Set parameter Username Academic license - for non-commercial use only - expires 2023-09-23 Gurobi Optimizer version 9.5.2 ...

Thank you very much! Problem solved!

The Gurobi version I use is 952. When you run this code, you are able to get the log file.

Hi, Here is my code. The main function of this project is to find several routes that start from 0 and visited several nodes and finally go back to 0. For example, if I have 0 1 2 3 4 5 6 7 8, and ...

Thank you very much for your reply! Since I revised tsp_c++ to fit my model, vars and vars_bar are both decision variables. For example, as for 0 14, vars[0][14] + vars_bar[0][14] = 1, which means ...

Since I need to revised tsp_c++ for my own project, I just show you the part of code and infeasible result I got. For example, I have 22 node, but I got a tour with only 5 nodes.   int SolCount = m...

Yes. I could also get the results you shown here. But if I want to print these two solutions with GRB_IntParam_SolutionNumber, sometimes the sub-optimal solution is infeasible, which means it has s...

Hi Marika, Thank you very much for you reply. I just found I could get optimal solution which is definitely feasible when I set PoolSearchMode by default and only get one solution. But, when I want...