A test problem generator for the Steiner problem in graphs
From MaRDI portal
Recommendations
- An edge elimination test for the Steiner problem in graphs
- Reduction tests for the steiner problem in grapsh
- scientific article; zbMATH DE number 4128830
- Some generalizations of the steiner problem in graphs
- An algorithm for the steiner problem in graphs
- scientific article; zbMATH DE number 1163709
- An approach for the Steiner problem in directed graphs
- A heuristic for the Steiner problem in graphs
- An SST-based algorithm for the steiner problem in graphs
- The class Steiner minimal tree problem: A lower bound and test problem generation
Cited in
(11)- Designing reliable tree networks with two cable technologies
- The class Steiner minimal tree problem: A lower bound and test problem generation
- Generating hard and diverse test sets for NP-hard graph problems
- A heuristic for the Steiner problem in graphs
- A survey of combinatorial optimization problems in multicast routing
- Steiner systems for two-stage disjunctive testing
- Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
- On the chromatic number of graphs
- An exact branch and bound algorithm for the Steiner Problem in Graphs
- Study of multiscale global optimization based on parameter space partition
- New strategy for anti-loop formulations
This page was built for publication: A test problem generator for the Steiner problem in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4371555)