The following pages link to (Q3677509):
Displaying 50 items.
- Triangle inequality and symmetry in connection with the assignment and the traveling salesman problem (Q1119486) (← links)
- A probabilistic analysis of the switching algorithm for the Euclidean TSP (Q1122505) (← links)
- A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem (Q1130068) (← links)
- Local optimization of neuron arbors (Q1192042) (← links)
- A multiperiod traveling salesman problem: Heuristic algorithms (Q1195106) (← links)
- Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs (Q1199461) (← links)
- On symmetric subtour problems (Q1202764) (← links)
- Operational estimators for the length of a traveling salesman tour (Q1206381) (← links)
- Genetic algorithms and traveling salesman problems (Q1268132) (← links)
- Genetic algorithms for the two-stage bicriteria flowshop problem (Q1278393) (← links)
- An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs (Q1280545) (← links)
- The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases (Q1290637) (← links)
- New edges not used in shortest tours of TSP (Q1291639) (← links)
- A model for warehouse order picking (Q1291697) (← links)
- On the expected optimal value of random assignment problems: Experimental results and open questions (Q1315447) (← links)
- Genetic local search in combinatorial optimization (Q1317048) (← links)
- Not all insertion methods yield constant approximate tours in the Euclidean plane (Q1318697) (← links)
- The median tour and maximal covering tour problems: Formulations and heuristics (Q1328602) (← links)
- Two-edge connected spanning subgraphs and polyhedra (Q1330901) (← links)
- Tabu search performance on the symmetric travelling salesman problem (Q1342103) (← links)
- On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616) (← links)
- Neural methods for the traveling salesman problem: Insights from operations research (Q1345270) (← links)
- Operations research games: A survey. (With comments and rejoinder) (Q1348703) (← links)
- The Convex-hull-and-k-line Travelling Salesman Problem (Q1350909) (← links)
- On perfectly two-edge connected graphs (Q1363658) (← links)
- TSP ejection chains (Q1363749) (← links)
- Measure concentration in optimization (Q1365046) (← links)
- The two-convex-polygons TSP: A solvable case (Q1367695) (← links)
- A note on the complexity of the asymmetric traveling salesman problem (Q1374382) (← links)
- On the existence of schedules that are near-optimal for both makespan and total weighted completion time (Q1375117) (← links)
- Complexity of searching an immobile hider in a graph (Q1377669) (← links)
- Landscapes and their correlation functions (Q1381249) (← links)
- Some thoughts on combinatorial optimisation (Q1388818) (← links)
- Probabilistic combinatorial optimization problems on graphs: A new domain in operational research (Q1390342) (← links)
- The TSP phase transition (Q1391912) (← links)
- The doubly graded matrix cone and Ferrers matrices (Q1399239) (← links)
- Variable neighborhood tabu search and its application to the median cycle problem. (Q1410620) (← links)
- On the equivalence between some local and global Chinese postman and traveling salesman graphs (Q1421461) (← links)
- A bilevel programming approach to the travelling salesman problem. (Q1426728) (← links)
- Application of the noising method to the travelling salesman problem (Q1580974) (← links)
- Survey of facial results for the traveling salesman polytope (Q1596750) (← links)
- Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems (Q1600930) (← links)
- Domination analysis of some heuristics for the traveling salesman problem (Q1602706) (← links)
- The traveling salesmanpProblem for lines in the plane (Q1603540) (← links)
- Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. (Q1608333) (← links)
- Local search inequalities (Q1751111) (← links)
- Data-independent neighborhood functions and strict local optima (Q1763477) (← links)
- The graphical relaxation: A new framework for the symmetric traveling salesman polytope (Q1803616) (← links)
- Greedy randomized adaptive search procedures (Q1804580) (← links)
- Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood (Q1805008) (← links)
