Pages that link to "Item:Q3875701"
From MaRDI portal
The following pages link to On the symmetric travelling salesman problem: A computational study (Q3875701):
Displayed 31 items.
- Hooked on IP (Q537605) (← links)
- Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times (Q631908) (← links)
- Polyhedral study of the capacitated vehicle routing problem (Q688914) (← links)
- Non-standard approaches to integer programming (Q697562) (← links)
- Optimizing over the subtour polytope of the travelling salesman problem (Q803048) (← links)
- Facet identification for the symmetric traveling salesman polytope (Q918865) (← links)
- George Dantzig's contributions to integer programming (Q951090) (← links)
- A cutting plane procedure for the travelling salesman problem on road networks (Q1072449) (← links)
- The hierarchical network design problem (Q1083378) (← links)
- Optimization of a 532-city symmetric traveling salesman problem by branch and cut (Q1089267) (← links)
- A new class of cutting planes for the symmetric travelling salesman problem (Q1107441) (← links)
- A polynomial-time solution to Papadimitriou and Steiglitz's ``traps'' (Q1109689) (← links)
- The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities (Q1181903) (← links)
- The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) (← links)
- Valid inequalities and facets of the capacitated plant location problem (Q1262820) (← links)
- A technique for speeding up the solution of the Lagrangean dual (Q1315429) (← links)
- On approximately fair cost allocation in Euclidean TSP games (Q1384221) (← links)
- Survey of facial results for the traveling salesman polytope (Q1596750) (← links)
- The graphical relaxation: A new framework for the symmetric traveling salesman polytope (Q1803616) (← links)
- Hamiltonian path and symmetric travelling salesman polytopes (Q1803617) (← links)
- The general routing polyhedron: A unifying framework (Q1806888) (← links)
- Facets and algorithms for capacitated lot sizing (Q1823857) (← links)
- Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies (Q1919186) (← links)
- Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure (Q2802246) (← links)
- On the Relative Complexity of 15 Problems Related to 0/1-Integer Programming (Q2971619) (← links)
- An exact algorithm for the asymmetrical capacitated vehicle routing problem (Q3786261) (← links)
- The prize collecting traveling salesman problem (Q3832349) (← links)
- Some facets of the simple plant location polytope (Q3945954) (← links)
- Coordinating Particle Swarm Optimization, Ant Colony Optimization and K-Opt Algorithm for Traveling Salesman Problem (Q5114991) (← links)
- Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem (Q5206234) (← links)
- A revisited branch-and-cut algorithm for large-scale orienteering problems (Q6087525) (← links)