A polynomial algorithm for the min-cut linear arrangement of trees
Journal of the ACM (JACM)
Heuristics for backplane ordering
Advances in VLSI and Computer Systems
On minimizing width in linear layouts
Discrete Applied Mathematics
Cluster analysis for hypertext systems
SIGIR '93 Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval
Parallel algorithms for the minimum cut and the minimum length tree layout problems
Theoretical Computer Science - Special issue on computing and combinatorics
Computers and Operations Research
SIAM Journal on Computing
A survey of graph layout problems
ACM Computing Surveys (CSUR)
On Bipartite Drawings and the Linear Arrangement Problem
SIAM Journal on Computing
Optimal Cutwidths and Bisection Widths of 2- and 3-Dimensional Meshes
WG '95 Proceedings of the 21st International Workshop on Graph-Theoretic Concepts in Computer Science
A Polyhedral Approach to Planar Augmentation and Related Problems
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Experiments on the minimum linear arrangement problem
Journal of Experimental Algorithmics (JEA)
Polynomial time algorithms for the MIN CUT problem on degree restricted trees
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Variable space search for graph coloring
Discrete Applied Mathematics
Fixed-parameter algorithms for protein similarity search under mRNA structure constraints
Journal of Discrete Algorithms
GRASP and path relinking for the max-min diversity problem
Computers and Operations Research
Ant colony optimization with hill climbing for the bandwidth minimization problem
Applied Soft Computing
Cutwidth II: Algorithms for partial w-trees of bounded degree
Journal of Algorithms
Formulation space search for circle packing problems
SLS'07 Proceedings of the 2007 international conference on Engineering stochastic local search algorithms: designing, implementing and analyzing effective heuristics
Support vector machine approach for longitudinal dispersion coefficients in natural streams
Applied Soft Computing
Handbook of Metaheuristics
Hybrid metaheuristics in combinatorial optimization: A survey
Applied Soft Computing
Short communication: ANFIS-based approach for predicting sediment transport in clean sewer
Applied Soft Computing
Branch and bound for the cutwidth minimization problem
Computers and Operations Research
Hi-index | 0.00 |
Many optimization problems are formulated as min-max problems where the objective function consist of minimizing a maximum value. In this case, it is usual that many solutions of the problem has associated the same value of the objective function. When this happens it is difficult to determine which solution is more promising to continue the search. In this paper we propose a new variant of the Variable Neighbourhood Search methodology to tackle this kind of problems. The new variant, named Variable Formulation Search, makes use of alternative formulations of the problem to determine which solution is more promising when they have the same value of the objective function in the original formulation. We do that in shaking, local search and neighbourhood change steps of the basic Variable Neighbourhood Search. We apply the new methodology to the Cutwidth Minimization Problem. Computational results show that our proposal outperforms previous algorithms in the state of the art in terms of quality and computing time.