Generalized Steiner problems and other variants

DOI10.1023/A:1009881326671MaRDI QIDQ1592840zbMATH OpenOpenAlexFDO

Authors Moshe Dror, Mohamed Haouari

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

zbMATH Keywords

generalized Steiner problemsgeneralized combinatorial optimization problemsgeneralized traveling Salesman problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Some Applications of the Generalized Travelling Salesman Problem
• On the generalized minimum spanning tree problem
• Generalized network design problems. Modeling and optimization.
• New models of the generalized minimum spanning tree problem
• scientific article; zbMATH DE number 1788251

Cited in

(19)

• A comprehensive survey on the generalized traveling salesman problem
• A rapid learning automata-based approach for generalized minimum spanning tree problem
• The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
• Generalized network design problems. Modeling and optimization.
• Approximation algorithms for group prize-collecting and location-routing problems
• On the complexity of master problems
• Heuristics for automated knowledge source integration and service composition
• On the solution of the generalized steiner problem by the subgradient method
• Shortest Paths in Graphs of Convex Sets
• Combinatorial optimization in system configuration design
• An approximation algorithm for the group prize-collecting Steiner tree problem with submodular penalties
• Recent results on arc routing problems: an annotated bibliography
• A random-key genetic algorithm for the generalized traveling salesman problem
• Generalized network design problems.
• A variational approach to the Steiner network problem
• Exact Algorithms for Generalized Combinatorial Optimization Problems
• The general Steiner problem in Boolean space and application
• Solving the k-cardinality assignment problem by transformation
• A new relaxation method for the generalized minimum spanning tree problem

This page was built for publication: Generalized Steiner problems and other variants

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