Wondering how to use Subtour in a sentence? Below are 2 example sentences from authentic English texts. Including the meaning .
Subtour in a sentence
Subtour meaning
A tour that makes up part of a larger tour.
Using Subtour
- The main meaning on this page is: A tour that makes up part of a larger tour.
Context around Subtour
- Average sentence length in these examples: 33 words
- Position in the sentence: 0 start, 2 middle, 0 end
- Sentence types: 2 statements, 0 questions, 0 exclamations
Corpus analysis for Subtour
- In this selection, "subtour" usually appears in the middle of the sentence. The average example has 33 words, and this corpus slice is mostly made up of statements.
- Recognizable usage signals include for any subtour of k and that every subtour in a. That gives this page its own corpus information beyond isolated example sentences.
- By corpus frequency, "subtour" sits close to words such as aabc, aacr and aacsb, which helps place it inside the broader word index.
Example types with subtour
The same corpus examples are grouped by length and sentence type, making it easier to see the contexts in which the word appears:
For if we sum all the inequalities corresponding to for any subtour of k steps not passing through city 0, we obtain: : which is a contradiction. (26 words)
To prove that every feasible solution contains only one closed sequence of cities, it suffices to show that every subtour in a feasible solution passes through city 0 (noting that the equalities ensure there can only be one such tour). (40 words)
To prove that every feasible solution contains only one closed sequence of cities, it suffices to show that every subtour in a feasible solution passes through city 0 (noting that the equalities ensure there can only be one such tour). (40 words)
For if we sum all the inequalities corresponding to for any subtour of k steps not passing through city 0, we obtain: : which is a contradiction. (26 words)
Example sentences (2)
For if we sum all the inequalities corresponding to for any subtour of k steps not passing through city 0, we obtain: : which is a contradiction.
To prove that every feasible solution contains only one closed sequence of cities, it suffices to show that every subtour in a feasible solution passes through city 0 (noting that the equalities ensure there can only be one such tour).