Going through the cutting stock problem, we define the master and sub-problem and solve a linear relaxation with column generation, and then branch on the generated columns to find an integer solution.
All requirements are defined in the Project.toml, just activate and instantiate the project.
See the DOI badge above or CITING.bib
.
The ideas for this notebook rely on:
- The JuMP example
- Lecture on Integer Programming, G. Desaulniers, Polytechnique Montréal