Can ML predict the solution value for a difficult combinatorial problem?

6 Mar 2020  ·  Constantine Goulimis, Gastón Simone ·

We look at whether machine learning can predict the final objective function value of a difficult combinatorial optimisation problem from the input. Our context is the pattern reduction problem, one industrially important but difficult aspect of the cutting stock problem. Machine learning appears to have higher prediction accuracy than a na\"ive model, reducing mean absolute percentage error (MAPE) from 12.0% to 8.7%.

PDF Abstract
No code implementations yet. Submit your code now


  Add Datasets introduced or used in this paper

Results from the Paper

  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.


No methods listed for this paper. Add relevant methods here