Pages that link to "Item:Q1612766"
From MaRDI portal
The following pages link to The traveling salesman problem and its variations (Q1612766):
Displayed 50 items.
- Multi-depot multiple TSP: a polyhedral study and computational results (Q367624) (← links)
- A simple LP relaxation for the asymmetric traveling salesman problem (Q378136) (← links)
- The parameterized complexity of local search for TSP, more refined (Q378245) (← links)
- New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints (Q421519) (← links)
- The minimum spanning tree problem with conflict constraints and its variations (Q429679) (← links)
- Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem (Q439653) (← links)
- Genetic algorithm for combinatorial path planning: the subtour problem (Q541476) (← links)
- Computing compatible tours for the symmetric traveling salesman problem (Q542055) (← links)
- Routing problems with loading constraints (Q610992) (← links)
- The traveling purchaser problem with stochastic prices: exact and approximate algorithms (Q621973) (← links)
- Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions (Q635174) (← links)
- On the asymptotic optimality of an algorithm for solving the maximum \(m\)-PSP in a multidimensional Euclidean space (Q643801) (← links)
- Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem (Q660966) (← links)
- Approximation algorithms for multiple terminal, Hamiltonian path problems (Q691412) (← links)
- 3-approximation algorithm for a two depot, heterogeneous traveling salesman problem (Q691417) (← links)
- Match twice and stitch: a new TSP tour construction heuristic. (Q703270) (← links)
- Models for a traveling purchaser problem with additional side-constraints (Q709202) (← links)
- Average-case analysis of best-first search in two representative directed acyclic graphs (Q814592) (← links)
- Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP (Q841596) (← links)
- Scheduling periodic customer visits for a traveling salesperson (Q863999) (← links)
- Greedy-type resistance of combinatorial problems (Q865746) (← links)
- A new asymmetric pyramidally solvable class of the traveling salesman problem (Q867920) (← links)
- Discrete optimization by optimal control methods. III. The dynamic traveling salesman problem (Q885705) (← links)
- The on-line asymmetric traveling salesman problem (Q935844) (← links)
- An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits (Q953423) (← links)
- ACS-TS: Train scheduling using ant colony system (Q955488) (← links)
- A memetic algorithm for the generalized traveling salesman problem (Q968380) (← links)
- Branch and bound method for multiobjective pairing selection (Q980932) (← links)
- Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems (Q1009187) (← links)
- Approximation algorithms for multi-criteria traveling salesman problems (Q1017906) (← links)
- Heuristic algorithms for a complex parallel machine scheduling problem (Q1022398) (← links)
- A survey on metaheuristics for stochastic combinatorial optimization (Q1024034) (← links)
- An approximation algorithm for a bottleneck traveling salesman problem (Q1026245) (← links)
- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic (Q1043852) (← links)
- Reoptimization of minimum and maximum traveling salesman's tours (Q1044031) (← links)
- Transformations of generalized ATSP into ATSP. (Q1400345) (← links)
- An integer programming-based local search for the covering salesman problem (Q1761202) (← links)
- The effect of the asymmetry of road transportation networks on the traveling salesman problem (Q1762144) (← links)
- Traveling salesman games with the Monge property (Q1827808) (← links)
- The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach (Q1926737) (← links)
- Online graph exploration: New results on old and new algorithms (Q1929219) (← links)
- Computing the variance of tour costs over the solution space of the TSP in polynomial time (Q1935572) (← links)
- The symmetric travelling salesman problem. II: New low bounds (Q1956919) (← links)
- Lexicographically minimizing axial motions for the Euclidean TSP (Q2268758) (← links)
- \(\frac 32\)-approximation algorithm for two variants of a 2-depot Hamiltonian path problem (Q2270326) (← links)
- Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs (Q2384394) (← links)
- Good triangulations yield good tours (Q2384914) (← links)
- The traveling group problem (Q2385125) (← links)
- On the Euclidean TSP with a permuted van der Veen matrix (Q2390323) (← links)
- Discrete optimization by optimal control methods. II: The static traveling salesman problem (Q2457582) (← links)