Pages that link to "Item:Q4168391"

The following pages link to Minimizing Wallpaper Waste, Part 1: A Class of Traveling Salesman Problems (Q4168391):

Displayed 15 items.

• On Hamiltonian paths in distance graphs (Q533446) ‎ (← links)
• A comparison of lower bounds for the symmetric circulant traveling salesman problem (Q643021) ‎ (← links)
• Long cycles and paths in distance graphs (Q712275) ‎ (← links)
• The optimum execution order of queries in linear storage (Q917278) ‎ (← links)
• Hamiltonian properties of Toeplitz graphs (Q1126180) ‎ (← links)
• Efficiently solvable special cases of bottleneck travelling salesman problems (Q1179263) ‎ (← links)
• The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) ‎ (← links)
• Hamiltonian cycles in circulant digraphs with two stripes (Q1377694) ‎ (← links)
• New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization (Q1602710) ‎ (← links)
• On the powers of matrices in bottleneck/fuzzy algebra (Q1816932) ‎ (← links)
• GENERALISATIONS OF THE GILMORE-GOMORY TRAVELING SALESMAN PROBLEM AND THE GILMORE-GOMORY SCHEME: A SURVEY (Q2772854) ‎ (← links)
• Hamiltonian Cycles in Striped Graphs: The Two-Stripe Problem (Q3344231) ‎ (← links)
• Well-solved cases of the 2-peripatetic salesman problem (Q4351794) ‎ (← links)
• On Eigenproblem for Circulant Matrices in Max-Algebra (Q4531546) ‎ (← links)
• Characterizing bipartite Toeplitz graphs (Q5941501) ‎ (← links)