Figure 8 - uploaded by Thibault Lechien
Content may be subject to copyright.
The filled in landscape of the evolved instances

The filled in landscape of the evolved instances

Source publication
Article
Full-text available
Predicting and comparing algorithm performance on graph instances is challenging for multiple reasons. First, there is not always a standard set of instances to benchmark performance. Second, using existing graph generators results in a restricted spectrum of difficulty and the resulting graphs are not always diverse enough to draw sound conclusion...

Similar publications

Article
Full-text available
Avoiding conflicting elements is a natural constraint that appears in several graph problems making them more challenging and close to real applications. Minimum Conflict-Free Spanning Tree (MCFST) is a variant of the classic Minimum Spanning Tree (MST) problem, where we are asked to find (if any) the spanning tree avoiding pairs of conflicting edg...

Citations

... A good test instance can effectively detect problems existing in the current algorithm, which is convenient for improvement and correction. Constructing controllable instances has received extensive attention, especially for boolean satisfiability [11], quadratic assignment [12], knapsack [13,14], capacity assignment [6], Hamiltonian completion [15] and job shop scheduling [16] problem and other instance generation problems [17,18]. These studies show that instance generators are crucial and worth promoting and improving. ...
Preprint
Full-text available
Instances generation is crucial for linear programming algorithms, which is necessary either to find the optimal pivot rules by training learning method or to evaluate and verify corresponding algorithms. This study proposes a general framework for designing linear programming instances based on the preset optimal solution. First, we give a constraint matrix generation method with controllable condition number and rank from the perspective of matrix decomposition. Based on the preset optimal solution, the bounded feasible linear programming instance is generated with the right-hand side and objective coefficient satisfying the original and dual feasibility. In addition, we provide three kind of neighborhood exchange operators and prove that instances generated under this method can fill the whole feasible and bounded case space of linear programming. We experimentally validate that the proposed schedule can generate more controllable linear programming instances, while neighborhood exchange operator can construct more complex instances.
... Other domains besides the TSP that have also been subject to the evolution of instances; they include the knapsack problem [43], the quadratic knapsack problem [25], the graph colouring problem [9], and the Hamiltonian completion problem [29]. ...