Concorde - MaRDI portal

Cited in

(only showing first 100 items - show all)

Continuous line drawings via the traveling salesman problem
Data transfer planning with tree placement for collaborative environments
Dubins traveling salesman problem with neighborhoods: a graph-based approach
Algorithms and Data Structures
Approximating the metric TSP in linear time
Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times
On the performance of self-organizing maps for the non-Euclidean traveling salesman problem in the polygonal domain
The traveling salesman problem: the spectral radius and the length of an optimal tour
General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach
Information-theoretic approaches to branching in search
A branch-and-cut algorithm for capacitated network design problems
Genetic algorithm for combinatorial path planning: the subtour problem
Computing compatible tours for the symmetric traveling salesman problem
Physical portrayal of computational complexity
A rearrangement of adjacency matrix based approach for solving the crossing minimization problem
On one approach to TSP structural stability
The balanced traveling salesman problem
Traveling salesman problem with clustering
Bilevel programming and the separation problem
Lifting and separation procedures for the cut polytope
Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization
Local cuts revisited
Problems of discrete optimization: challenges and main approaches to solve them
Deterministic ``snakes and ladders heuristic for the Hamiltonian cycle problem
Mathematical programming in computational biology: an annotated bibliography
Transformations of generalized ATSP into ATSP.
Diversified local search strategy under scatter search framework for the probabilistic traveling salesman problem
The travelling salesman problem and adiabatic quantum computation: an algorithm
A linearithmic heuristic for the travelling salesman problem
Constructing arbitrarily large graphs with a specified number of Hamiltonian cycles
An experimental comparison of seriation methods for one-mode two-way data
A comparison of lower bounds for the symmetric circulant traveling salesman problem
Contributions to the minimum linear arrangement problem.
Constrained discriminant analysis via \(0/1\) mixed integer programming
Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem
Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
scientific article; zbMATH DE number 2084782 (Why is no real title available?)
Integrating operations research in constraint programming
A polyhedral study of the quadratic traveling salesman problem
Pattern discrete and mixed hit-and-run for global optimization
The random quadratic assignment problem
Using River Formation Dynamics to Design Heuristic Algorithms
Scaling laws for maximum coloring of random geometric graphs
A discrete gravitational search algorithm for solving combinatorial optimization problems
Strong Formulations for 2-Node-Connected Steiner Network Problems
Three enhancements for optimization-based bound tightening
Strong-branching inequalities for convex mixed integer nonlinear programs
Nonoblivious 2-opt heuristics for the traveling salesman problem
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
Multiple depot ring star problem: a polyhedral study and an exact algorithm
scientific article; zbMATH DE number 2084783 (Why is no real title available?)
A 2.75-approximation algorithm for the unconstrained traveling tournament problem
Instance-specific multi-objective parameter tuning based on fuzzy logic
Simpler analysis of LP extreme points for traveling salesman and survivable network design problems
Exact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup times
Computing equilibria: a computational complexity perspective
Heuristics for the mixed swapping problem
TTT plots: a perl program to create time-to-target plots
Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics
The 2-edge-connected subgraph polyhedron
Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order
Certifying algorithms
A Polyhedral Characterization of Border Bases
The neighbor-net algorithm
Generating subtour elimination constraints for the TSP from pure integer solutions
Matching preclusion for the (n, k)-bubble-sort graphs
Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm
Robustness of inventory replenishment and customer selection policies for the dynamic and stochastic inventory-routing problem
A note on the extension complexity of the knapsack polytope
Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
Efficient algorithms for the double traveling salesman problem with multiple stacks
Single liner shipping service design
The balanced minimum evolution problem
A branch-and-cut algorithm for the preemptive swapping problem
Improved exact method for the double TSP with multiple stacks
Experimental analysis of heuristics for the bottleneck traveling salesman problem
A hybrid simulation-optimization algorithm for the Hamiltonian cycle problem
Efficiently embedding QUBO problems on adiabatic quantum computers
An efficient heuristic algorithm for the bottleneck traveling salesman problem
A tutorial on branch and cut algorithms for the maximum stable set problem
Preemptive stacker crane problem: extending tree-based properties and construction heuristics
Validating vehicle routing zone construction using Monte Carlo simulation
A multi-phase heuristic for the production routing problem
Cut-and-solve: An iterative search strategy for combinatorial optimization problems
An exact rational mixed-integer programming solver
The travelling salesman problem with neighbourhoods: MINLP solution
Computational experience with general cutting planes for the set covering problem
The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach
Constant factor approximation algorithm for TSP satisfying a biased triangle inequality
Constraint Integer Programming: A New Approach to Integrate CP and MIP
Strong lift-and-project cutting planes for the stable set problem
Multi-depot multiple TSP: a polyhedral study and computational results
Estimation-based metaheuristics for the probabilistic traveling salesman problem
On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances
The tree representation for the pickup and delivery traveling salesman problem with LIFO loading
Traveling salesman problem heuristics: leading methods, implementations and latest advances
Decomposition-based algorithms for the crew scheduling and routing problem in road restoration

This page was built for software: Concorde