Merge branch 'main' of https://github.com/ktnr/TwoStepBranchingProcedure

Author: ktnr

README.md

@@ -32,7 +32,7 @@ Hard instances generally exhibit low area waste (\epsilon) between 2% and 7%, se
 
 This repository cannot repliicate the performance (number of explored nodes for infeasible instances) of the original paper, not even the performance of the simplest version without block equivalence and pseudo symmetry reductions. So, there might still be a bug in the code, inefficiencies, or invalid assumptions. If you happen to have knowledge about implementation details of the original paper, please do get in touch.
 
-The constraint programming appraoch of Clautiaux et al. (2008) is often cited to achieve the best performance to date. However, we couldn't reproduce their performance, even with a comparabele model using modern soft- and hardware. For details please refer to https://github.com/google/or-tools/discussions/3177.
+The constraint programming appraoch of Clautiaux et al. (2008) is often cited to achieve the best performance to date. However, we couldn't reproduce their performance, even with a comparable model using modern soft- and hardware. For details please refer to https://github.com/google/or-tools/discussions/3177.
 
 # Future research and pointers
 
@@ -48,4 +48,4 @@ An interactive, educational version of the basic nested branch-and-bound algorit
 - Herz, J. C. (1972). Recursive computational procedure for two-dimensional stock cutting. IBM Journal of Research and Development, 16(5), 462-469.
 - Beasley, J. E. (1985). Algorithms for unconstrained two-dimensional guillotine cutting. Journal of the Operational Research Society, 36(4), 297-306.
 - Côté, J. F., & Iori, M. (2018). The meet-in-the-middle principle for cutting and packing problems. INFORMS Journal on Computing, 30(4), 646-661.
-- Clautiaux, F., Jouglet, A., Carlier, J., & Moukrim, A. (2008). A new constraint programming approach for the orthogonal packing problem. Computers & Operations Research, 35(3), 944-959.
+- Clautiaux, F., Jouglet, A., Carlier, J., & Moukrim, A. (2008). A new constraint programming approach for the orthogonal packing problem. Computers & Operations Research, 35(3), 944-959.