Pages that link to "Item:Q1179263"
From MaRDI portal
The following pages link to Efficiently solvable special cases of bottleneck travelling salesman problems (Q1179263):
Displayed 15 items.
- Hamiltonian properties of Toeplitz graphs (Q1126180) (← 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)
- Coloring planar Toeplitz graphs and the stable set polytope. (Q1422423) (← 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)
- Monge properties, discrete convexity and applications (Q2432877) (← links)
- Special cases of travelling salesman problems and heuristics (Q2639760) (← links)
- Well-solved cases of the 2-peripatetic salesman problem (Q4351794) (← links)
- An Oracle Strongly Polynomial Algorithm for Bottleneck Expansion Problems (Q4806342) (← 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)