# Results for Table 6

* **Result**: Table (a) reports the closed (reduced) root gap of the bound-free formulation after multiple rounds of the cutting-plane process, while Table (b) reports the computational performance after a single round of cuts. The key conclusion of Table 6 (a) remains consistent: a single round of cuts is sufficient to close the majority (approximately 80%) of the optimality gap.

* **Possible differences**:
    * The specific closed root gap values may vary across machines. This is because the LP relaxation can admit multiple optimal solutions, and the presence of exponential terms makes the formulation numerically sensitive. As a result, different sets of cuts may be generated during the cutting-plane process.

    * In addition, results for `M = 1` and `M = 2` are not directly comparable. These two settings correspond to optimization problems of different sizes, and the reported root gaps are evaluated relative to different baselines. Consequently, the closed root gaps should be interpreted within, rather than across, memory-length settings.

