|
Descrição
|
We used the same instance classes of [8] related to model 1. These classes, called rudy and ising, are part of the Biq Mac library (Wiegele 2007), which is a collection of instances widely used in the literature. See also [17] and [15]. For the rudy instances (Tables 1 and 2), the values for the number of variables are given by n = 60, n = 80, and n = 100. For the ising instances (Tables 3 and 4), the values for n are given by n = 100, n = 150. More details are given in [21]. [8] F. Furini and E. Traversi. Theoretical and computational study of several linearisation techniques for binary quadratic problems. Annals of Operations Research, 279, 387-411, 2019 [15] N. Krislock, J. Malick, and F. Roupin. Improved semidefinite bounding procedure for solving max-cut problems to optimality. Mathematical Programming, 143, 61-86, 2014. [17] F. Rendl, G. Rinaldi, and A. Wiegele. Solving max-cut to optimality by intersecting semidefinite and polyhedral relaxations. Mathematical Programming, 121, 307-317, 2010. (2023-08-23)
|