A comparison of problem decomposition techniques for the FAP

DOI10.1007/S10732-009-9116-4MaRDI QIDQ972658zbMATH OpenOpenAlexFDO

Authors Gualtiero Colombo, Stuart M. Allen

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 partitioningproblem decompositionfrequency assignment

Mathematics Subject Classification ID

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

Recommendations

• A Decomposed Approach for the Minimum Interference Frequency Assignment
• Solving frequency assignment problems via tree-decomposition
• Decomposition Based Heuristic Approach to Frequency Reassignment Problem
• scientific article; zbMATH DE number 1727373
• A comparison of a global approach and a decomposition method for frequency assignment in multibeam satellite systems

Cites work

• scientific article; zbMATH DE number 2080097 (Why is no real title available?)
• scientific article; zbMATH DE number 1865936 (Why is no real title available?)
• scientific article; zbMATH DE number 1424217 (Why is no real title available?)
• A Decomposed Approach for the Minimum Interference Frequency Assignment
• A divide-and-conquer local search heuristic for data visualization
• An enumerative algorithm for the frequency assignment problem
• Decomposition method of solving a class of combinatorial optimization problems
• Engineering graph clustering: models and experimental evaluation
• Parallel Branch-and-Branch Algorithms: Survey and Synthesis
• Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
• Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
• Parallel iterative search methods for vehicle routing problems
• Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
• Recent Advances in Constraints
• Solving partial constraint satisfaction problems with tree decomposition

Cited in

(6)

• Decomposition Based Heuristic Approach to Frequency Reassignment Problem
• Solving frequency assignment problems via tree-decomposition
• On the relation between the AINV and the FAPINV algorithms
• A Decomposed Approach for the Minimum Interference Frequency Assignment
• A comparison of a global approach and a decomposition method for frequency assignment in multibeam satellite systems
• scientific article; zbMATH DE number 1727373 (Why is no real title available?)

Describes a project that uses

Uses Software

• FASoft

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

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