Multilevel refinement for combinatorial optimisation problems

DOI10.1023/B:ANOR.0000039525.80601.15MaRDI QIDQ702735zbMATH OpenOpenAlexFDO

Authors C. Walshaw

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

zbMATH Keywords

combinatorial optimisationgraph partitioningmetaheuristicgraph colouringtravelling salesmanMultilevel refinement

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15)

Recommendations

• A Multilevel Approach to the Travelling Salesman Problem
• A Multilevel Genetic Algorithm for the Traveling Salesman Problem
• scientific article; zbMATH DE number 1304274
• A partitioning requiring rapidity and quality: the multilevel method and partitions refinement algorithms
• scientific article; zbMATH DE number 1931027

Cited in

(20)

• An efficient approach for large scale graph partitioning
• Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm
• Iterated multilevel simulated annealing for large-scale graph conductance minimization
• An efficient memetic algorithm for the graph partitioning problem
• A multilevel optimization approach for large scale battery exchange station location planning
• Multilevel (Hierarchical) Optimization: Complexity Issues, Optimality Conditions, Algorithms
• A new method, the fusion fission, for the relaxed \(k\)-way graph partitioning problem, and comparisons with some multilevel algorithms
• Visualizing large graphs
• An effective multilevel tabu search approach for balanced graph partitioning
• An ant colony optimization algorithm for DNA sequencing by hybridization
• A Multilevel Approach to the Travelling Salesman Problem
• Self-organized topology of recurrence-based complex networks
• Multilevel algorithms for acyclic partitioning of directed acyclic graphs
• Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering
• 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
• Aggregative coarsening for multilevel hypergraph partitioning
• A method of improving initial partition of Fiduccia-Mattheyses algorithm
• Advanced coarsening schemes for graph partitioning
• Metaheuristics for the minimum gap graph partitioning problem

Describes a project that uses

Uses Software

• Scotch
• Blossom IV
• MESHPART
• TSPLIB

This page was built for publication: Multilevel refinement for combinatorial optimisation problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q702735)