Generalized Steiner problems and other variants
From MaRDI portal
Publication:1592840
DOI10.1023/A:1009881326671zbMath0980.90074OpenAlexW1596142555MaRDI QIDQ1592840
Publication date: 12 March 2002
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1009881326671
generalized Steiner problemsgeneralized combinatorial optimization problemsgeneralized traveling Salesman problem
Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)
Related Items (12)
Solving the \(k\)-cardinality assignment problem by transformation ⋮ A random-key genetic algorithm for the generalized traveling salesman problem ⋮ An approximation algorithm for the group prize-collecting Steiner tree problem with submodular penalties ⋮ Shortest Paths in Graphs of Convex Sets ⋮ Heuristics for automated knowledge source integration and service composition ⋮ A rapid learning automata-based approach for generalized minimum spanning tree problem ⋮ Recent results on Arc Routing Problems: An annotated bibliography ⋮ The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances ⋮ Approximation algorithms for group prize-collecting and location-routing problems ⋮ Generalized network design problems. ⋮ Combinatorial optimization in system configuration design ⋮ A new relaxation method for the generalized minimum spanning tree problem
This page was built for publication: Generalized Steiner problems and other variants