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.
- 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)
- 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)
- Traveling salesman games with the Monge property (Q1827808) (← 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)
- Cut-and-solve: An iterative search strategy for combinatorial optimization problems (Q2457618) (← links)
- A criterion for the adjacency of vertices of polytopes generated by subsets of symmetric groups (Q2460490) (← links)
- On estimating the distribution of optimal traveling salesman tour lengths using heuristics (Q2462111) (← links)
- An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem (Q2467447) (← links)
- Computing finest mincut partitions of a graph and application to routing problems (Q2473036) (← links)
- Traveling salesman path problems (Q2476987) (← links)
- The linear ordering problem with cumulative costs (Q2482806) (← links)
- An improved upper bound for the TSP in cubic 3-edge-connected graphs (Q2488197) (← links)
- Expanding neighborhood GRASP for the traveling salesman problem (Q2490365) (← links)
- On pedigree polytopes and Hamiltonian cycles (Q2497514) (← links)
- A review of TSP based approaches for flowshop scheduling (Q2572854) (← links)
- A note on single alternating cycle neighborhoods for the TSP (Q2573008) (← links)
- Fast local search algorithms for the handicapped persons transportation problem (Q2573013) (← links)
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem (Q2583134) (← links)
- Vehicle routing problems with alternative paths: an application to on-demand transportation (Q2654320) (← links)