Pages that link to "Item:Q1179263"
From MaRDI portal
The following pages link to Efficiently solvable special cases of bottleneck travelling salesman problems (Q1179263):
Displaying 34 items.
- On \(t\)-diagnosability of multicore systems with symmetric circulant structure (Q384501) (← links)
- The Pfaffian property of circulant graphs (Q479041) (← links)
- On the chromatic number of Toeplitz graphs (Q496679) (← links)
- On Hamiltonian paths in distance graphs (Q533446) (← links)
- Pyramidal tours and multiple objectives (Q604948) (← links)
- A comparison of lower bounds for the symmetric circulant traveling salesman problem (Q643021) (← links)
- Long cycles and paths in distance graphs (Q712275) (← links)
- Hamiltonian properties of Toeplitz graphs (Q1126180) (← links)
- A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time (Q1183480) (← links)
- An \(O(n)\) algorithm to solve the Bottleneck Traveling Salesman Problem restricted to ordered product matrices (Q1314323) (← links)
- Hamiltonian cycles in circulant digraphs with two stripes (Q1377694) (← links)
- On Gilmore-Gomory's open question for the bottleneck TSP. (Q1412716) (← links)
- Coloring planar Toeplitz graphs and the stable set polytope. (Q1422423) (← links)
- Extending single tolerances to set tolerances (Q1671336) (← links)
- The algebraic Monge property and path problems (Q1765525) (← links)
- On the recognition of permuted bottleneck Monge matrices (Q1902890) (← links)
- On the role of bottleneck Monge matrices in combinatorial optimization (Q1904608) (← links)
- Perspectives of Monge properties in optimization (Q1923588) (← links)
- Minimizing the number of workers in a paced mixed-model assembly line (Q1991120) (← links)
- The two-stripe symmetric circulant TSP is in P (Q2164712) (← links)
- The property of Hamiltonian connectedness in Toeplitz graphs (Q2173741) (← links)
- The Pfaffian property of Cayley graphs on dihedral groups (Q2197482) (← links)
- An efficient heuristic algorithm for the bottleneck traveling salesman problem (Q2269075) (← links)
- Monge properties, discrete convexity and applications (Q2432877) (← links)
- Special cases of travelling salesman problems and heuristics (Q2639760) (← links)
- On the reflexive edge strength of the circulant graphs (Q2671007) (← links)
- Coloring Toeplitz graphs (Q2883614) (← links)
- Well-solved cases of the 2-peripatetic salesman problem (Q4351794) (← links)
- An Oracle Strongly Polynomial Algorithm for Bottleneck Expansion Problems (Q4806342) (← links)
- Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem (Q5206234) (← links)
- (Q5374240) (← links)
- The Travelling Salesman Problem in symmetric circulant matrices with two stripes (Q5458063) (← links)
- A class of bottleneck expansion problems (Q5936134) (← links)
- Characterizing bipartite Toeplitz graphs (Q5941501) (← links)
