Pages that link to "Item:Q810369"
From MaRDI portal
The following pages link to Solution of large-scale symmetric travelling salesman problems (Q810369):
Displayed 33 items.
- The dragon war (Q876681) (← links)
- Optimal partitioning of a data set based on the \(p\)-median model (Q946677) (← 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)
- Some thoughts on combinatorial optimisation (Q1388818) (← links)
- Lexicographic local search and the \(p\)-center problem. (Q1410610) (← 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)
- 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)
- 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)
- Problems of discrete optimization: challenges and main approaches to solve them (Q2371716) (← links)
- Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday) (Q2373937) (← links)
- A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning (Q2517895) (← links)
- Point-to-point and multi-goal path planning for industrial robots (Q2745507) (← links)
- Vehicle routing with stochastic demands and restricted failures (Q4201811) (← links)
- Provably good solutions for the traveling salesman problem (Q4698114) (← links)
- Polyhedral techniques in combinatorial optimization I: Theory (Q4715790) (← links)
- Branch and cut methods for network optimization (Q5936762) (← links)