Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 236,506,717 papers from all fields of science
Search
Sign In
Create Free Account
Steiner travelling salesman problem
Known as:
Steiner TSP
The Steiner traveling salesman problem (Steiner TSP, or STSP) is an extension of the traveling salesman problem, one of the fundamental combinatorial…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
1 relation
Combinatorial optimization
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
Towards a metaheuristic for routing order pickers in a warehouse
C. Theys
,
Olli Bräysy
,
W. Dullaert
,
B. Raa
2008
Corpus ID: 17569174
In this paper we will deal with the sequencing and routing problem of order pickers in conventional multi-parallel-aisle…
Expand