A comparison of problem decomposition techniques for the FAP

DOI10.1007/s10732-009-9116-4zbMath1187.90181OpenAlexW1984671943MaRDI QIDQ972658

Stuart M. Allen, Gualtiero Colombo

Publication date: 21 May 2010

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10732-009-9116-4

zbMATH Keywords

simulated annealinggraph partitioningfrequency assignmentproblem decomposition

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Continuous location (90B85) Approximation methods and heuristics in mathematical programming (90C59)

Uses Software

• FASoft

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An enumerative algorithm for the frequency assignment problem
• A divide-and-conquer local search heuristic for data visualization
• A Decomposed Approach for the Minimum Interference Frequency Assignment
• Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
• Parallel iterative search methods for vehicle routing problems
• Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
• Solving partial constraint satisfaction problems with tree decomposition
• Parallel Branch-and-Branch Algorithms: Survey and Synthesis
• Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
• Decomposition method of solving a class of combinatorial optimization problems
• Recent Advances in Constraints

This page was built for publication: A comparison of problem decomposition techniques for the FAP