Two heuristics for the rainbow spanning forest problem

DOI10.1016/J.EJOR.2020.02.045MaRDI QIDQ2184043zbMATH OpenOpenAlexFDO

Authors 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

artificial bee colony algorithmcombinatorial optimizationneighborhood strategiesproblem-specific heuristicrainbow spanning forest problem

Mathematics Subject Classification ID

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

Recommendations

• The rainbow spanning forest problem
• On the complexity of rainbow spanning forest problem
• The rainbow Steiner tree problem
• A heuristic algorithm for the mini-max spanning forest problem
• A class of heuristics for the constrained forest problem

Cites work

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

Cited in

(6)

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

Describes a project that uses

Uses Software

• ABC

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

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