Concorde
From MaRDI portal
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
- Solution of real-world postman problems
- The power of recourse for online MST and TSP
- Computational experience with a software framework for parallel integer programming
- Integer linear programming models for topology optimization in sheet metal design
- A new separation algorithm for the Boolean quadric and cut polytopes
- On learning and branching: a survey
- New Bounds for the Traveling Salesman Constant
- Hölder curves and parameterizations in the Analyst's traveling salesman theorem
- A network flow model for biclustering via optimal re-ordering of data matrices
- Method of scaling in approximate solution of the traveling salesman problem
- Binary Steiner trees: structural results and an exact solution approach
- Continuous approximation models in freight distribution management
- Cvrplib
- A minimum spanning tree based heuristic for the travelling salesman tour
- The dynamic dispatch waves problem for same-day delivery
- On generalizations of the Petersen graph and the Coxeter graph
- A branch-and-bound algorithm for the close-enough traveling salesman problem
- Generalized domino-parity inequalities for the symmetric traveling salesman problem
- Separation, dimension, and facet algorithms for node flow polyhedra
- Global versus local search: the impact of population sizes on evolutionary algorithm performance
- New semidefinite programming relaxations for the linear ordering and the traveling salesman problem
- Genetic operators for combinatorial optimization in TSP and microarray gene ordering
- A semidefinite optimization approach to the target visitation problem
- An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem
- The ring spur assignment problem: new formulation, valid inequalities and a branch-and-cut approach
- The driver and vehicle routing problem
- An exact algorithm for a vehicle-and-driver scheduling problem
- A fast two-level variable neighborhood search for the clustered vehicle routing problem
- A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment
- Bi-objective data gathering path planning for vehicles with bounded curvature
- Benders decomposition applied to a robust multiple allocation incomplete hub location problem
- An efficient evolutionary algorithm for the orienteering problem
- Hard to solve instances of the Euclidean traveling salesman problem
- Solving large batches of traveling salesman problems with parallel and distributed computing
- The traveling salesman problem on grids with forbidden neighborhoods
- On the facial structure of symmetric and graphical traveling salesman polyhedra
- A hybrid branch-and-bound approach for exact rational mixed-integer programming
- A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem
- A computational status update for exact rational mixed integer programming
- Model Checking the Ant Colony Optimisation
- Mathematical modeling of multiple tour multiple traveling salesman problem using evolutionary programming
- An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem
- The minimum flow cost Hamiltonian cycle problem: a comparison of formulations
- A fast metaheuristic for the travelling salesperson problem with hotel selection
This page was built for software: Concorde