The following pages link to (Q5187226):
Displaying 50 items.
- Linearizable special cases of the QAP (Q266060) (← links)
- MP or not MP: that is the question (Q283264) (← links)
- Robust optimization for routing problems on trees (Q301384) (← links)
- Solving the traveling repairman problem on a line with general processing times and deadlines (Q319440) (← links)
- On the recoverable robust traveling salesman problem (Q331985) (← links)
- Computing the maximum violation of a Bell inequality is an NP-problem (Q332067) (← links)
- Ordered spatial sampling by means of the traveling salesman problem (Q333365) (← links)
- Solving the dynamic traveling salesman problem using a genetic algorithm with trajectory prediction: an application to fish aggregating devices (Q337442) (← links)
- Load-dependent and precedence-based models for pickup and delivery problems (Q342036) (← links)
- Controlled mobility in stochastic and dynamic wireless networks (Q373450) (← 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)
- An experimental study of a hybrid genetic algorithm for the maximum traveling salesman problem (Q387104) (← links)
- A note on the traveling salesman reoptimization problem under vertex insertion (Q483055) (← links)
- Sequencing situations with just-in-time arrival, and related games (Q486940) (← links)
- Probabilistic analysis of an approximation algorithm for the \(m\)-peripatetic salesman problem on random instances unbounded from above (Q492278) (← links)
- Natural and extended formulations for the time-dependent traveling salesman problem (Q496646) (← links)
- Approximate algorithms for the traveling salesman problem. II (Q499569) (← links)
- A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs (Q505141) (← links)
- Exact methods for solving the elementary shortest and longest path problems (Q512936) (← links)
- Experimental analysis of heuristics for the bottleneck traveling salesman problem (Q519098) (← links)
- An efficient procedure for the N-city traveling salesman problem (Q583107) (← links)
- Traveling salesman problem with clustering (Q616229) (← links)
- Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs (Q621695) (← links)
- Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times (Q631908) (← links)
- On the asymptotic optimality of an algorithm for solving the maximum \(m\)-PSP in a multidimensional Euclidean space (Q643801) (← links)
- The travelling salesman problem and adiabatic quantum computation: an algorithm (Q670009) (← links)
- Polyhedral study of the capacitated vehicle routing problem (Q688914) (← links)
- Survivable networks, linear programming relaxations and the parsimonious property (Q689117) (← links)
- A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery (Q705506) (← links)
- Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s) (Q706963) (← links)
- Optimal search path for service in the presence of disruptions (Q716349) (← links)
- The indefinite period traveling salesman problem (Q724039) (← links)
- Global versus local search: the impact of population sizes on evolutionary algorithm performance (Q727394) (← links)
- Deterministic ``snakes and ladders'' heuristic for the Hamiltonian cycle problem (Q744218) (← links)
- An improved annealing scheme for the QAP (Q752002) (← links)
- A class of exponential neighbourhoods for the quadratic travelling salesman problem (Q782742) (← links)
- The multiple traveling salesman problem on spiders (Q831830) (← links)
- Online \(k\)-server routing problems (Q839628) (← links)
- Network design with edge-connectivity and degree constraints (Q839639) (← links)
- A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem (Q857330) (← links)
- A (0-1) goal programming model for scheduling the tour of a marketing executive (Q858472) (← links)
- A new asymmetric pyramidally solvable class of the traveling salesman problem (Q867920) (← links)
- Bound sets for biobjective combinatorial optimization problems (Q875413) (← links)
- The dragon war (Q876681) (← links)
- Sequencing and scheduling in robotic cells: recent developments (Q880509) (← links)
- Discrete optimization by optimal control methods. III. The dynamic traveling salesman problem (Q885705) (← links)
- Maximum travelling salesman problem. I (Q891481) (← links)
- The multiple traveling salesmen problem with moving targets (Q895767) (← links)
- Analyzing the Held-Karp TSP bound: A monotonicity property with application (Q912624) (← links)
