Pages that link to "Item:Q911990"

The following pages link to Classification of travelling salesman problem formulations (Q911990):

Displaying 28 items.

• The traveling salesman problem with time-dependent service times (Q320683) (← links)
• Natural and extended formulations for the time-dependent traveling salesman problem (Q496646) (← links)
• Combined route capacity and route length models for unit demand vehicle routing problems (Q951110) (← links)
• A comparative analysis of several asymmetric traveling salesman problem formulations (Q955595) (← links)
• The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) (← links)
• On symmetric subtour problems (Q1202764) (← links)
• A branch and bound algorithm for symmetric 2-peripatetic salesman problems (Q1310005) (← links)
• A classification of formulations for the (time-dependent) traveling salesman problem (Q1388929) (← links)
• A bilevel programming approach to the travelling salesman problem. (Q1426728) (← links)
• Survey of facial results for the traveling salesman polytope (Q1596750) (← 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)
• Covering and connectivity constraints in loop-based formulation of material flow network design in facility layout (Q1681433) (← links)
• Short combinatorial proof that the DFJ polytope is contained in the MTZ polytope for the asymmetric traveling salesman problem (Q1728250) (← links)
• The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints (Q1806889) (← links)
• An efficient genetic algorithm for the traveling salesman problem with precedence constraints (Q1848588) (← links)
• Routing problems: A bibliography (Q1908308) (← links)
• Vehicle routing with endogenous learning: application to offshore plug and abandonment campaign planning (Q2028802) (← links)
• Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation (Q2103946) (← links)
• The arc-item-load and related formulations for the cumulative vehicle routing problem (Q2172084) (← links)
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints (Q2276891) (← links)
• Topological design of a two-level network with ring-star configuration (Q2367422) (← links)
• Formulations and valid inequalities for the heterogeneous vehicle routing problem (Q2490341) (← links)
• Requiem for the Miller-Tucker-Zemlin subtour elimination constraints? (Q2514734) (← links)
• Projection results for vehicle routing (Q2583125) (← links)
• (Q2861531) (← links)
• The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints (Q5946820) (← links)
• Integer programming formulations for the \(k\)-in-a-tree problem in graphs (Q6495390) (← links)