Ant local search and its efficient adaptation to graph colouring
From MaRDI portal
(Redirected from Publication:3582660)
Recommendations
Cited in
(19)- Optimization by ant algorithms: possible roles for an individual ant
- Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach
- A new ant colony optimization algorithm for the lower bound of sum coloring problem
- Probabilistic pursuits on graphs
- Multi-coloring and job-scheduling with assignment and incompatibility costs
- An ant-based algorithm for coloring graphs
- An improved ant colony optimisation heuristic for graph colouring
- A systematic study on meta-heuristic approaches for solving the graph coloring problem
- scientific article; zbMATH DE number 1706198 (Why is no real title available?)
- Informed reactive tabu search for graph coloring
- Heuristics for a project management problem with incompatibility and assignment costs
- An exact approach for the vertex coloring problem
- Ants can colour graphs
- Graph coloring models and metaheuristics for packing applications
- Online Optimization of a Color Sorting Assembly Buffer Using Ant Colony Optimization
- Experience-based ant coloring (EAC). A new ant-like graph-coloring algorithm
- Solution Methods for Fuel Supply of Trains
- Improving the extraction and expansion method for large graph coloring
- A cooperative search method for the \(k\)-coloring problem
This page was built for publication: Ant local search and its efficient adaptation to graph colouring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3582660)
