Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The most widely used progress measure for branch-and-bound (B&B) algorithms when solving mixed-integer programs (MIPs) is the MIP gap.  introduce a new progress measure that is often much smoother than the MIP gap.  propose a double exponential smoothing technique to predict the solution time of B&B algorithms and evaluate the prediction method using three MIP solvers. Our computational experiments show that accurate predictions of the solution time are possible, even in the early stages of B&B algorithms.
['Osman Y. Özaltın', 'Brady Hunsaker', 'Andrew J. Schaefer']
I am writing a research paper on a idea Predicting the Solution Time of Branch-and-Bound Algorithms for Mixed-Integer Programs
[{"from": "human", "value": "I am writing a research paper on a idea Predicting the Solution Time of Branch-and-Bound Algorithms for Mixed-Integer Programs"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The most widely used progress measure for branch-and-bound (B&B) algorithms when solving mixed-integer programs (MIPs) is the MIP gap.  introduce a new progress measure that is often much smoother than the MIP gap.  propose a double exponential smoothing technique to predict the solution time of B&B algorithms and evaluate the prediction method using three MIP solvers. Our computational experiments show that accurate predictions of the solution time are possible, even in the early stages of B&B algorithms."}]