swMATH4770MaRDI QIDQ16936FDOQ16936
Author name not available (Why is that?)
Official website: http://www.math.uwaterloo.ca/tsp/concorde.html
Source code repository: https://github.com/jvkersch/pyconcorde
Cited In (only showing first 100 items - show all)
- A comparison of lower bounds for the symmetric circulant traveling salesman problem
- Simpler analysis of LP extreme points for traveling salesman and survivable network design problems
- Physical portrayal of computational complexity
- A rearrangement of adjacency matrix based approach for solving the crossing minimization problem
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Genetic algorithm for combinatorial path planning: the subtour problem
- Computing compatible tours for the symmetric traveling salesman problem
- An experimental comparison of seriation methods for one-mode two-way data
- A polyhedral study of the quadratic traveling salesman problem
- Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization
- Using River Formation Dynamics to Design Heuristic Algorithms
- Information-theoretic approaches to branching in search
- Strong Formulations for 2-Node-Connected Steiner Network Problems
- On the performance of self-organizing maps for the non-Euclidean traveling salesman problem in the polygonal domain
- Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem
- Could we use a million cores to solve an integer program?
- Pattern discrete and mixed hit-and-run for global optimization
- Instance-specific multi-objective parameter tuning based on fuzzy logic
- Algorithms and Data Structures
- Exact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup times
- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
- The balanced traveling salesman problem
- Traveling salesman problem with clustering
- A branch-and-cut algorithm for capacitated network design problems
- Transformations of generalized ATSP into ATSP.
- A 2.75-approximation algorithm for the unconstrained traveling tournament problem
- Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times
- The traveling salesman problem: the spectral radius and the length of an optimal tour
- Diversified local search strategy under scatter search framework for the probabilistic traveling salesman problem
- Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
- Strong-branching inequalities for convex mixed integer nonlinear programs
- Constructing arbitrarily large graphs with a specified number of Hamiltonian cycles
- Title not available (Why is that?)
- Integrating operations research in constraint programming
- Data transfer planning with tree placement for collaborative environments
- Approximating the metric TSP in linear time
- Contributions to the minimum linear arrangement problem.
- A discrete gravitational search algorithm for solving combinatorial optimization problems
- Reducing the generalised Sudoku problem to the Hamiltonian cycle problem
- A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs
- Seeking global edges for traveling salesman problem in multi-start search
- Nonoblivious 2-opt heuristics for the traveling salesman problem
- Deterministic ``snakes and ladders heuristic for the Hamiltonian cycle problem
- The random quadratic assignment problem
- Multiple depot ring star problem: a polyhedral study and an exact algorithm
- Computing equilibria: a computational complexity perspective
- The travelling salesman problem and adiabatic quantum computation: an algorithm
- A linearithmic heuristic for the travelling salesman problem
- Constrained discriminant analysis via \(0/1\) mixed integer programming
- Scaling laws for maximum coloring of random geometric graphs
- Mathematical programming in computational biology: an annotated bibliography
- Continuous line drawings via the traveling salesman problem
- On one approach to TSP structural stability
- Problems of discrete optimization: challenges and main approaches to solve them
- Three enhancements for optimization-based bound tightening
- Preemptive stacker crane problem: extending tree-based properties and construction heuristics
- Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics
- Generating subtour elimination constraints for the TSP from pure integer solutions
- Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
- Bilevel programming and the separation problem
- Lifting and separation procedures for the cut polytope
- A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem
- What you should know about the vehicle routing problem
- A note on the extension complexity of the knapsack polytope
- Generalized traveling salesman problem reduction algorithms
- The 2-edge-connected subgraph polyhedron
- Local cuts revisited
- Improved exact method for the double TSP with multiple stacks
- A tutorial on branch and cut algorithms for the maximum stable set problem
- Single liner shipping service design
- On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances
- Dubins traveling salesman problem with neighborhoods: a graph-based approach
- A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
- Heuristics for the mixed swapping problem
- Experimental analysis of heuristics for the bottleneck traveling salesman problem
- The travelling salesman problem with neighbourhoods: MINLP solution
- A distribution-free TSP tour length estimation model for random graphs
- TSP race: minimizing completion time in time-sensitive applications
- The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach
- A branch-and-cut framework for the consistent traveling salesman problem
- Integer programming formulations for the elementary shortest path problem
- The hybrid electric vehicle-traveling salesman problem
- An optimal path planning problem for heterogeneous multi-vehicle systems
- Network interdiction via a critical disruption path: branch-and-price algorithms
- Minimum cost VRP with time-dependent speed data and congestion charge
- Constraint Integer Programming: A New Approach to Integrate CP and MIP
- Traveling salesman problem heuristics: leading methods, implementations and latest advances
- Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order
- An implementation of exact knapsack separation
- A memetic algorithm for the travelling salesperson problem with hotel selection
- GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem
- Dynamic design of sales territories
- The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis
- Hybrid metaheuristics for the clustered vehicle routing problem
- Solving the dynamic traveling salesman problem using a genetic algorithm with trajectory prediction: an application to fish aggregating devices
- Randomized heuristics for the family traveling salesperson problem
- A Polyhedral Characterization of Border Bases
- The tree representation for the pickup and delivery traveling salesman problem with LIFO loading
- Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs
This page was built for software: Concorde
