Skip to search formSkip to main contentSkip to account menu

Set TSP problem

Known as: Set TSP, Group TSP, One-of-a-Set TSP 
In combinatorial optimization, the set TSP, also known as the, generalized TSP, group TSP, One-of-a-Set TSP, Multiple Choice TSP or Covering Salesman… 
Wikipedia (opens in a new tab)

Related topics

Related topics

3 relations

Broader (3)

Combinatorial optimizationOperations researchTravelling salesman problem

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
A Guided Local Search Approach for the Travelling Thief Problem
Real-world problems complexity is often a consequence of the interdependence of the sub-problems that compose them. The… 
2017
2017
Parameterised complexity analysis of evolutionary algorithms for combinatorial optimization problems
Engineering, Computer and Mathematical Sciences School of Computer Science Doctor of Philosophy Parameterised Complexity Analysis… 
2014
2014
Approximating the Bipartite TSP and Its Biased Generalization
We examine a generalization of the symmetric bipartite traveling salesman problem (TSP) with quadrangle inequality, by extending… 
2014
2014
Modular Realization of Capacitive Converters Based on General Transposed Series–Parallel and Derived Topologies
The realization of capacitive converters based on a modular approach is presented and analyzed in this paper. The converters are… 
2011
2011
Capacitive Transposed Series-Parallel Topology With Fine Tuning Capabilities
A general transposed series-parallel topology of a switched-capacitor converter is presented and analyzed in this paper. This… 
2005
2005
The 2-Edge-Connected Subgraph Polyhedron
We study the polyhedron P(G) defined by the convex hull of 2-edge-connected subgraphs of G where multiple copies of edges may be… 
2004
2004
Design of the Precise Time Facility for Galileo
Abstract : Under contract to the European Space Agency (ESA), an expert team lead by Kayser-Threde GmbH has elaborated a design… 
2003
2003
Assignment problem based algorithms are impractical for the generalized TSP
In the Generalized Traveling Salesman Problem (GTSP), given a weighted complete digraph D and a partition V1,...,Vk of the… 
2001
2001
Ant Colony Optimization for Bottleneck TSP
This paper proposes an ant colony optimization algorithm for bottleneck travelling salesman problem, which combines a local… 
1998
1998
The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)