Tabu search for graph partitioning
From MaRDI portal
Publication:1919841
DOI10.1007/BF02125455zbMath0851.90131OpenAlexW2046238609MaRDI QIDQ1919841
Hasan Pirkul, Fred Glover, Erik Rolland
Publication date: 25 November 1996
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02125455
quadratic assignmentmaximum satisfiabilityflow shop schedulingtabu search procedureuniform graph partitioningvehicle rounting
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)
Related Items
A tabu search procedure for the resource constrained project scheduling problem with discounted cash flows, Graph bisection revisited, Moving clusters within a memetic algorithm for graph partitioning, Metaheuristics: A bibliography, Local search for constrained graph clustering in biological networks, An effective multilevel tabu search approach for balanced graph partitioning, Unnamed Item, Solution of large weighted equicut problems, Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems
Uses Software
Cites Work
- Optimization by Simulated Annealing
- Using tabu search techniques for graph coloring
- Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
- New approaches for heuristic search: A bilateral linkage with artificial intelligence
- Tabu search techniques. A tutorial and an application to neural networks
- Some simplified NP-complete graph problems
- STABULUS: A technique for finding stable sets in large graphs with tabu search
- On tabu search for the location of interacting hub facilities
- A user's guide to tabu search
- Massively parallel tabu search for the quadratic assignment problem
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- A class of bounded approximation algorithms for graph partitioning
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Tabu Search Applied to the Quadratic Assignment Problem
- An Efficient Heuristic Procedure for Partitioning Graphs
- Bandwidth Packing: A Tabu Search Approach
- A Fast Taboo Search Algorithm for the Job Shop Problem
- A Tabu Search Heuristic for the Vehicle Routing Problem
