An improved hybrid ant-local search algorithm for the partition graph coloring problem
From MaRDI portal
Publication:747914
DOI10.1016/j.cam.2015.04.030zbMath1334.90187OpenAlexW1988985448MaRDI QIDQ747914
Stefka Fidanova, Petrică C. Pop
Publication date: 19 October 2015
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2015.04.030
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Coloring of graphs and hypergraphs (05C15)
Related Items (4)
A self-learning approach for optimal detailed scheduling of multi-product pipeline ⋮ A systematic study on meta-heuristic approaches for solving the graph coloring problem ⋮ The generalized minimum branch vertices problem: properties and polyhedral analysis ⋮ Graph coloring: a novel heuristic based on trailing path-properties, perspective and applications in structured networks
Cites Work
- Generalized network design problems. Modeling and optimization.
- Routing and wavelength assignment by partition colouring
- The generalized fixed-charge network design problem
- Generalized network design problems.
- An efficient transformation of the generalized vehicle routing problem
- A branch-and-price approach for the partition coloring problem
- On the complexity of the selective graph coloring problem in some special classes of graphs
- A new relaxation method for the generalized minimum spanning tree problem
- A branch-and-cut algorithm for partition coloring
- Selective Graph Coloring in Some Special Classes of Graphs
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- Graph Colorings
- On the generalized minimum spanning tree problem
- Handbook of metaheuristics
This page was built for publication: An improved hybrid ant-local search algorithm for the partition graph coloring problem
