Skip to content

Commit

Permalink
v1.0.2
Browse files Browse the repository at this point in the history
  • Loading branch information
N-Wouda committed Jul 25, 2019
1 parent 32e6b56 commit ab293e0
Showing 1 changed file with 2 additions and 1 deletion.
3 changes: 2 additions & 1 deletion README.md
Original file line number Diff line number Diff line change
Expand Up @@ -44,7 +44,8 @@ how the ALNS library may be used. Of particular interest are,
destroy and repair heuristics with a post-processing step.
- The cutting-stock problem (CSP), [here][4]. We solve an instance with
180 orders, over 165 distinct beam sizes. The total stock available
amounts to 165 beams of length 1000. TODO optimality
amounts to 165 beams of length 1000. We solve the instance to within
1.35% of optimality in only a very limited number of iterations.

## References
- Pisinger, D., and Ropke, S. (2010). Large Neighborhood Search. In M.
Expand Down

0 comments on commit ab293e0

Please sign in to comment.