Pages that link to "Item:Q1181739"

The following pages link to An analytical comparison of different formulations of the travelling salesman problem (Q1181739):

Displaying 38 items.

• Compact formulations of the Steiner traveling salesman problem and related problems (Q257227) (← links)
• Integer programming formulations for the elementary shortest path problem (Q322844) (← links)
• A new mathematical programming formulation for the single-picker routing problem (Q323113) (← links)
• Lower bounding procedure for the asymmetric quadratic traveling salesman problem (Q323214) (← links)
• An investigation into two bin packing problems with ordering and orientation implications (Q421577) (← links)
• New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints (Q709141) (← links)
• MIP models for connected facility location: a theoretical and computational study (Q709181) (← links)
• Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints (Q733522) (← links)
• Projection, lifting and extended formulation integer and combinatorial optimization (Q817203) (← links)
• A comparative analysis of several asymmetric traveling salesman problem formulations (Q955595) (← links)
• A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program (Q1129976) (← links)
• A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs (Q1266607) (← links)
• An analytic symmetrization of max flow-min cut (Q1356775) (← links)
• A classification of formulations for the (time-dependent) traveling salesman problem (Q1388929) (← links)
• The asymmetric traveling salesman problem with replenishment arcs (Q1569947) (← 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)
• 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)
• New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints (Q1886799) (← links)
• Routing problems: A bibliography (Q1908308) (← links)
• An alternate formulation of the symmetric traveling salesman problem and its properties (Q1962065) (← links)
• An extensible multi-block layout warehouse routing optimization model (Q2083945) (← links)
• Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation (Q2103946) (← links)
• A polyhedral study of the diameter constrained minimum spanning tree problem (Q2197445) (← links)
• On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms (Q2241575) (← links)
• Formulations and valid inequalities for the heterogeneous vehicle routing problem (Q2490341) (← links)
• On pedigree polytopes and Hamiltonian cycles (Q2497514) (← links)
• Requiem for the Miller-Tucker-Zemlin subtour elimination constraints? (Q2514734) (← links)
• Projection results for vehicle routing (Q2583125) (← links)
• Approximate extended formulations (Q2583138) (← links)
• Traveling Salesman Problem and Membership in Pedigree Polytope - A Numerical Illustration (Q3627687) (← links)
• Discrete relaxations of combinatorial programs (Q5946814) (← links)
• On the equivalence of the multistage-insertion and cycle-shrink formulations of the symmetric traveling salesman problem (Q5952070) (← links)
• Tight lower bounds for the traveling salesman problem with draft limits (Q6109566) (← links)
• Valid inequalities and extended formulations for lot-sizing and scheduling problem with sequence-dependent setups (Q6113320) (← links)
• Integer programming formulations for the \(k\)-in-a-tree problem in graphs (Q6495390) (← links)