The rainbow Steiner tree problem (Q2669791)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	The rainbow Steiner tree problem	scientific article

Statements

scholarly article

0 references

The rainbow Steiner tree problem (English)

0 references

0 references

0 references

Francesca Guerriero

0 references

Computers \& Operations Research

0 references

publication date

9 March 2022

0 references

zbMATH Keywords

Steiner tree

0 references

edge-colored graphs

0 references

spanning tree

0 references

describes a project that uses

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.cor.2021.105621

0 references

Design and dimensioning of hydrogen transmission pipeline networks

0 references

Solving Steiner tree problems in graphs with Lagrangian relaxation

0 references

An algorithm for the resource constrained shortest path problem

0 references

A note on the prize collecting traveling salesman problem

0 references

Accelerated label setting algorithms for the elementary resource constrained shortest path problem

0 references

Multicolored forests in complete bipartite graphs

0 references

On the complexity of rainbow spanning forest problem

0 references

The rainbow spanning forest problem

0 references

The labeled maximum matching problem

0 references

Edge-disjoint rainbow spanning trees in complete graphs

0 references

Carousel greedy: a generalized greedy algorithm with applications in optimization

0 references

Hardness and algorithms for rainbow connection

0 references

The minimum labeling spanning trees

0 references

The Steiner tree problem on graphs: inapproximability results

0 references

Variable neighbourhood search for the minimum labelling Steiner tree problem

0 references

Discrete particle swarm optimization for the minimum labelling Steiner tree problem

0 references

A hybrid metaheuristic for the minimum labeling spanning tree problem

0 references

Paths, trees and matchings under disjunctive constraints

0 references

Shortest path tour problem with time windows

0 references

A Lagrangean-based decomposition approach for the link constrained Steiner tree problem

0 references

A survey of resource constrained shortest path problems: Exact solution approaches

0 references

On the complexity of rainbow coloring problems

0 references

An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems

0 references

Thinning out Steiner trees: a node-based model for uniform edge costs

0 references

Breakout local search for the Steiner tree problem with revenue, budget and hop constraints

0 references

SCIP-Jack -- a solver for STP and variants with parallelization extensions

0 references

Two heuristics for the rainbow spanning forest problem

0 references

Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints

0 references

Hop constrained Steiner trees with multiple root nodes

0 references

Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees

0 references

Spanning Trees With Edge Conflicts and Wireless Connectivity

0 references

Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm

0 references

Solving Steiner tree problems in graphs to optimality

0 references

On finding rainbow and colorful paths

0 references

On the minimum monochromatic or multicolored subgraph partition problems

0 references

A parallel grasp for the Steiner tree problem in graphs using a hybrid local search strategy

0 references

Paths and trails in edge-colored weighted graphs

0 references

A robust and scalable algorithm for the Steiner problem in graphs

0 references

0 references

A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs

0 references

Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints

0 references

New dynamic programming algorithms for the resource constrained elementary shortest path problem

0 references

A branch and cut algorithm for minimum spanning trees under conflict constraints

0 references

The Rainbow Cycle Cover Problem

0 references

A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph

0 references

0 references

Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster

0 references

On the rainbow connectivity of graphs: complexity and FPT algorithms

0 references

The Steiner tree problem with hop constraints

0 references

Faster algorithm for optimum Steiner trees

0 references

Identifiers

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

10.1016/J.COR.2021.105621

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2669791

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2669791&oldid=39185445"