Pages that link to "Item:Q810369"
From MaRDI portal
The following pages link to Solution of large-scale symmetric travelling salesman problems (Q810369):
Displaying 50 items.
- Ordered spatial sampling by means of the traveling salesman problem (Q333365) (← links)
- Improved filtering for weighted circuit constraints (Q487627) (← links)
- Computing compatible tours for the symmetric traveling salesman problem (Q542055) (← links)
- An efficient procedure for obtaining feasible solutions to the n-city traveling salesman problem (Q583125) (← links)
- Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times (Q631908) (← links)
- An improved column generation algorithm for minimum sum-of-squares clustering (Q662300) (← links)
- Solving the family traveling salesman problem (Q723922) (← links)
- The dragon war (Q876681) (← links)
- On the solution of the traveling salesman problem once again (Q885792) (← links)
- Optimal partitioning of a data set based on the \(p\)-median model (Q946677) (← links)
- Exploiting planarity in separation routines for the symmetric traveling salesman problem (Q951094) (← links)
- Certification of an optimal TSP tour through 85,900 cities (Q1002076) (← links)
- A cutting plane procedure for the travelling salesman problem on road networks (Q1072449) (← links)
- Optimization of a 532-city symmetric traveling salesman problem by branch and cut (Q1089267) (← links)
- A polynomial-time solution to Papadimitriou and Steiglitz's ``traps'' (Q1109689) (← links)
- On the solution of traveling salesman problems (Q1126862) (← links)
- Travelling salesman problem tools for microcomputers (Q1184464) (← links)
- The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) (← links)
- A cutting plane algorithm for the windy postman problem (Q1198736) (← links)
- The use of dynamic programming in genetic algorithms for permutation problems (Q1268271) (← links)
- Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems (Q1278590) (← links)
- Searching for backbones -- an efficient parallel algorithm for the traveling salesman problem (Q1282966) (← links)
- Genetic local search in combinatorial optimization (Q1317048) (← links)
- A branch-and-cut algorithm for vehicle routing problems (Q1339118) (← links)
- Tabu search performance on the symmetric travelling salesman problem (Q1342103) (← links)
- Some thoughts on combinatorial optimisation (Q1388818) (← links)
- Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems (Q1403285) (← links)
- Lexicographic local search and the \(p\)-center problem. (Q1410610) (← links)
- Solving a semidefinite relaxation of the traveling salesman problem. (Q1412116) (← links)
- A heuristic for the pickup and delivery traveling salesman problem (Q1571039) (← links)
- An effective implementation of the Lin-Kernighan traveling salesman heuristic (Q1584821) (← links)
- Survey of facial results for the traveling salesman polytope (Q1596750) (← links)
- Relaxed tours and path ejections for the traveling salesman problem (Q1609913) (← links)
- Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm (Q1622797) (← links)
- A hybrid approach for biobjective optimization (Q1662163) (← links)
- The graphical relaxation: A new framework for the symmetric traveling salesman polytope (Q1803616) (← links)
- An optimality cut for mixed integer linear programs (Q1809846) (← links)
- Solving the max-cut problem using eigenvalues (Q1900149) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- Solving real-world linear ordering problems using a primal-dual interior point cutting plane method (Q1915914) (← links)
- Packing Steiner trees: A cutting plane algorithm and computational results (Q1919090) (← links)
- Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies (Q1919186) (← links)
- Ideal polytopes and face structures of some combinatorial optimization problems (Q1924055) (← links)
- State partitioning based linear program for stochastic dynamic programs: an invariance property (Q1939695) (← links)
- Implementation of ensemble-based simulated annealing with dynamic load balancing under MPI (Q1967216) (← links)
- Record breaking optimization results using the ruin and recreate principle (Q1976826) (← links)
- Strong IP formulations need large coefficients (Q2019425) (← links)
- Computing in combinatorial optimization (Q2075761) (← links)
- On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms (Q2241575) (← links)
- Combinatorial structure and adjacency of vertices of polytope of \(b\)-factors (Q2262901) (← links)
