Home Research - MinLA Problem | November 30, 2022 |

Benchmark Instances

. This is a test-suite originally proposed by__Small and Medium Instances__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.__Jordi Petit__. 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__Big Instances__. Their number of vertices is between 78136 and 1017253.__David Harel__

. As far as we know this file contains the best known solutions for this problem.__Best Known Solutions__. This file contains the best final permutations found using our Two-Stage Simulated Annealing Algorithm (TSSA).__Final Permutations__. This file contains the detailed execution data from our experiments with the TSSA algorithm described in the following paper:__Detailed Results__

__An Effective Two-Stage Simulated Annealing Algorithm for the Minimum Linear Arrangement Problem.__

Eduardo Rodriguez-Tello, Jin-Kao Hao and Jose Torres-Jimenez,

Computers & Operations Research, 35(10):3331-3346, Elsevier Octobre 2008.

® 2008 Eduardo Rodriguez-Tello