Pages that link to "Item:Q5297404"

The following pages link to A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem (Q5297404):

Displaying 14 items.

• New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints (Q421519) (← links)
• Strong multi-commodity flow formulations for the asymmetric traveling salesman problem (Q724060) (← links)
• A comparative analysis of several asymmetric traveling salesman problem formulations (Q955595) (← links)
• Study of the pedigree polytope and a sufficiency condition for nonadjacency in the tour polytope (Q1662101) (← links)
• A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem (Q1681265) (← links)
• The demand weighted vehicle routing problem (Q1754023) (← 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)
• Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation (Q2103946) (← links)
• A cutting plane method for risk-constrained traveling salesman problem with random arc costs (Q2274859) (← links)
• The influence of problem specific neighborhood structures in metaheuristics performance (Q2337103) (← links)
• (Q2861531) (← links)
• Learn global and optimize local: a data-driven methodology for last-mile routing (Q6047849) (← links)
• On the generation of metric TSP instances with a large integrality gap by branch-and-cut (Q6175708) (← links)