Multilevel refinement for combinatorial optimisation problems
From MaRDI portal
Publication:702735
DOI10.1023/B:ANOR.0000039525.80601.15zbMath1067.90145OpenAlexW2015925158MaRDI QIDQ702735
Publication date: 17 January 2005
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:anor.0000039525.80601.15
graph colouringgraph partitioningtravelling salesmanmetaheuristiccombinatorial optimisationMultilevel refinement
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Metaheuristics for the minimum gap graph partitioning problem, Iterated multilevel simulated annealing for large-scale graph conductance minimization, An effective multilevel tabu search approach for balanced graph partitioning, A multilevel optimization approach for large scale battery exchange station location planning, Co-clustering documents and words by minimizing the normalized cut objective function, A multilevel tabu search algorithm for the feature selection problem in biomedical data, A method of improving initial partition of Fiduccia-Mattheyses algorithm, A new method, the fusion fission, for the relaxed \(k\)-way graph partitioning problem, and comparisons with some multilevel algorithms, An efficient approach for large scale graph partitioning, Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering, An ant colony optimization algorithm for DNA sequencing by hybridization, Self-organized topology of recurrence-based complex networks, Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm, Advanced Coarsening Schemes for Graph Partitioning, Multilevel Algorithms for Acyclic Partitioning of Directed Acyclic Graphs, An efficient memetic algorithm for the graph partitioning problem, Unnamed Item
Uses Software
