Pages that link to "Item:Q3360022"
From MaRDI portal
The following pages link to Universal conditions for algebraic travelling salesman problems to be efficiently solvable (Q3360022):
Displayed 11 items.
- On the traveling salesman problem with a relaxed Monge matrix (Q293365) (← links)
- An \(O(n)\) algorithm to solve the Bottleneck Traveling Salesman Problem restricted to ordered product matrices (Q1314323) (← links)
- Special cases of the traveling salesman problem (Q1316125) (← links)
- A general approach to avoiding two by two submatrices (Q1332690) (← links)
- Efficiently solvable special cases of hard combinatorial optimization problems (Q1365047) (← links)
- Hamiltonian cycles in circulant digraphs with two stripes (Q1377694) (← links)
- On the recognition of permuted bottleneck Monge matrices (Q1902890) (← links)
- Perspectives of Monge properties in optimization (Q1923588) (← links)
- GENERALISATIONS OF THE GILMORE-GOMORY TRAVELING SALESMAN PROBLEM AND THE GILMORE-GOMORY SCHEME: A SURVEY (Q2772854) (← links)
- The travelling salesman and the PQ-tree (Q4645944) (← links)
- Pyramidal tours for the traveling salesman (Q4764887) (← links)