Pages that link to "Item:Q803048"
From MaRDI portal
The following pages link to Optimizing over the subtour polytope of the travelling salesman problem (Q803048):
Displayed 12 items.
- Computing assortative mixing by degree with the \(s\)-metric in networks using linear programming (Q305479) (← links)
- Computing compatible tours for the symmetric traveling salesman problem (Q542055) (← links)
- The indefinite period traveling salesman problem (Q724039) (← links)
- Simpler analysis of LP extreme points for traveling salesman and survivable network design problems (Q974982) (← links)
- On approximately fair cost allocation in Euclidean TSP games (Q1384221) (← links)
- Survey of facial results for the traveling salesman polytope (Q1596750) (← links)
- Improved integrality gap upper bounds for traveling salesperson problems with distances one and two (Q1754106) (← links)
- TRAVEL - An interactive travelling salesman problem package for the IBM- personal computer (Q1821039) (← links)
- Ordered colourings (Q1896351) (← links)
- Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies (Q1919186) (← links)
- Fractional decomposition tree algorithm: a tool for studying the integrality gap of integer programs (Q2688462) (← links)
- Facet Generating Techniques (Q2971603) (← links)