Two heuristics for the rainbow spanning forest problem

DOI10.1016/J.EJOR.2020.02.045zbMath1443.90322OpenAlexW3010073706MaRDI QIDQ2184043

Sudishna Ghoshal, Shyam Sundar

Publication date: 27 May 2020

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2020.02.045

zbMATH Keywords

combinatorial optimizationartificial bee colony algorithmneighborhood strategiesproblem-specific heuristicrainbow spanning forest problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (4)

Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles ⋮ The rainbow Steiner tree problem ⋮ Algebraic Bayesian networks: checking backbone connectivity ⋮ Fractional-order artificial bee colony algorithm with application in robot path planning

Uses Software

• ABC

Cites Work

• Edge-disjoint rainbow spanning trees in complete graphs
• A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants
• Discrete particle swarm optimization for the minimum labelling Steiner tree problem
• The labeled maximum matching problem
• On the minimum label spanning tree problem
• Carousel greedy: a generalized greedy algorithm with applications in optimization
• On the complexity of rainbow spanning forest problem
• The rainbow spanning forest problem
• Optimal pathway reconstruction on 3D NMR maps
• Variable neighbourhood search for the minimum labelling Steiner tree problem
• A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
• On the minimum monochromatic or multicolored subgraph partition problems
• Heuristic approaches for the Minimum Labelling Hamiltonian Cycle Problem
• The Colorful Traveling Salesman Problem
• The Rainbow Cycle Cover Problem
• The Orderly Colored Longest Path Problem – a survey of applications and new algorithms

This page was built for publication: Two heuristics for the rainbow spanning forest problem