The following pages link to (Q4845366):
Displaying 50 items.
- The hierarchical traveling salesman problem (Q375993) (← links)
- Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices (Q408370) (← links)
- On cutwidth parameterized by vertex cover (Q476444) (← links)
- The balanced traveling salesman problem (Q614063) (← links)
- Heuristic and exact algorithms for a min-max selective vehicle routing problem (Q622161) (← links)
- Solving the asymmetric traveling purchaser problem (Q867540) (← links)
- On the graphical relaxation of the symmetric traveling salesman polytope (Q877195) (← links)
- The on-line asymmetric traveling salesman problem (Q935844) (← links)
- Golden ratio versus pi as random sequence sources for Monte Carlo integration (Q949528) (← links)
- Exploiting planarity in separation routines for the symmetric traveling salesman problem (Q951094) (← links)
- On the power of lookahead in on-line server routing problems (Q959800) (← links)
- Production setup-sequencing and lot-sizing at an animal nutrition plant through ATSP subtour elimination and patching (Q964867) (← links)
- On the domino-parity inequalities for the STSP (Q985309) (← links)
- The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches (Q1027598) (← links)
- Pyramidal traveling salesman problem (Q1302600) (← links)
- Frequency assignment in mobile radio systems using branch-and-cut techniques (Q1569929) (← links)
- A computational study of smoothing heuristics for the traveling salesman problem (Q1576330) (← links)
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (Q1580967) (← links)
- Application of the noising method to the travelling salesman problem (Q1580974) (← links)
- A polyhedral approach to sequence alignment problems (Q1585327) (← links)
- The traveling salesmanpProblem for lines in the plane (Q1603540) (← links)
- The multi-stripe travelling salesman problem (Q1698268) (← links)
- Local search inequalities (Q1751111) (← links)
- Distances between traveling salesman tours (Q1805446) (← links)
- Combinatorial optimization and small polytopes (Q1814809) (← links)
- Stronger \(K\)-tree relaxations for the vehicle routing problem (Q1827647) (← links)
- The biobjective travelling purchaser problem (Q1885751) (← links)
- The traveling salesman problem with backhauls (Q1915968) (← links)
- An alternate formulation of the symmetric traveling salesman problem and its properties (Q1962065) (← links)
- Angular bisector insertion algorithm for solving small-scale symmetric and asymmetric traveling salesman problem (Q2075470) (← links)
- Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation (Q2103946) (← links)
- Novel concave hull-based heuristic algorithm for TSP (Q2139346) (← links)
- A cutoff time strategy based on the coupon collector's problem (Q2184095) (← links)
- The stable marriage problem: an interdisciplinary review from the physicist's perspective (Q2231919) (← links)
- The common face of some 0/1-polytopes with NP-complete nonadjacency relation (Q2259297) (← links)
- On the facial structure of symmetric and graphical traveling salesman polyhedra (Q2339807) (← links)
- A heuristic framework on a common generalization of the vehicle routing problem and the linear ordering problem (Q2358180) (← links)
- The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches (Q2427392) (← links)
- Traveling salesman path problems (Q2476987) (← links)
- New facets of the STS polytope generated from known facets of the ATS polytope (Q2494809) (← links)
- Traveling salesman problem (Q2831331) (← links)
- On Cutwidth Parameterized by Vertex Cover (Q2891354) (← links)
- Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time (Q3057614) (← links)
- (Q3118580) (← links)
- Travelling Salesman with a Self-Similar Itinerary (Q3415955) (← links)
- A concise guide to the Traveling Salesman Problem (Q3582631) (← links)
- Directed travelling salesman problem (Q3748853) (← links)
- The n-line traveling salesman problem (Q3989545) (← links)
- Separating over classes of TSP inequalities defined by 0 node-lifting in polynomial time (Q4645942) (← links)
- Computing and Combinatorics (Q4681186) (← links)
