Pages that link to "Item:Q5297404"
From MaRDI portal
The following pages link to A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem (Q5297404):
Displayed 7 items.
- New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints (Q421519) (← links)
- A comparative analysis of several asymmetric traveling salesman problem formulations (Q955595) (← links)
- An analog of the Cook theorem for polytopes (Q1759309) (← links)
- Computing the variance of tour costs over the solution space of the TSP in polynomial time (Q1935572) (← links)
- (Q2861531) (← links)
- Traveling Salesman Problem and Membership in Pedigree Polytope - A Numerical Illustration (Q3627687) (← links)
- The travelling salesman problem with neighbourhoods: MINLP solution (Q4924121) (← links)