Home Research - MinLA Problem November 30, 2022   

MinLA Problem



Benchmark Instances

  • Small and Medium Instances. This is a test-suite originally proposed by Jordi Petit and used later by other authors. It includes 21 graphs from 6 different families: Uniform random, geometric random, graphs with known optima, finite element discretizations, VLSI design and graph drawing competitions. Their number of vertices is between 62 and 9800.

  • Big Instances. The second test-suite is composed of 9 very large graphs from finite element discretizations, obtained from the publicly available collections of George Karypis and Francois Pellegrini. These graphs were first used by Yehuda Koren and David Harel. Their number of vertices is between 78136 and 1017253.


Computational Results




® 2008 Eduardo Rodriguez-Tello