Solution of large weighted equicut problems

DOI10.1016/S0377-2217(97)00287-7zbMath0991.90137MaRDI QIDQ1609912

Mauro Dell'Amico, Marco Trubian

Publication date: 18 August 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

heuristics; tabu search; graph partitioning; metaheuristic

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90B40: Search theory

90C27: Combinatorial optimization

Related Items

Composing medical crews with equity and efficiency, Tabu search versus GRASP for the maximum diversity problem, New bounds for optimum traffic assignment in satellite communication., Solving the feedback vertex set problem on undirected graphs, Comparing metaheuristic algorithms for SONET network design problems

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• New heuristic solution procedures for the uniform graph partitioning problem: Extensions and evaluation
• A branch-and-cut algorithm for the equicut problem
• Tabu search for graph partitioning
• The equipartition polytope. I: Formulations, dimension and basic facets
• The equipartition polytope. II: Valid inequalities and facets
• A class of bounded approximation algorithms for graph partitioning
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
• An Efficient Heuristic Procedure for Partitioning Graphs
• A Greedy Randomized Adaptive Search Procedure for the Two-Partition Problem
• Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory