Concorde

swMATH4770MaRDI QIDQ16936FDOQ16936

Author name not available (Why is that?)

Described by source

• The traveling salesman problem. A computational study.

Cited In (only showing first 100 items - show all)

• Preemptive stacker crane problem: extending tree-based properties and construction heuristics
• Bilevel programming and the separation problem
• Lifting and separation procedures for the cut polytope
• 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
• A note on the extension complexity of the knapsack polytope
• Genetic algorithm for combinatorial path planning: the subtour problem
• Computing compatible tours for the symmetric traveling salesman problem
• A polyhedral study of the quadratic traveling salesman problem
• The 2-edge-connected subgraph polyhedron
• Local cuts revisited
• 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
• Improved exact method for the double TSP with multiple stacks
• 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
• Pattern discrete and mixed hit-and-run for global optimization
• Instance-specific multi-objective parameter tuning based on fuzzy logic
• Dubins traveling salesman problem with neighborhoods: a graph-based approach
• Algorithms and Data Structures
• Exact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup times
• The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach
• General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
• A branch-and-cut algorithm for capacitated network design problems
• Transformations of generalized ATSP into ATSP.
• Randomized heuristics for the family traveling salesperson problem
• A 2.75-approximation algorithm for the unconstrained traveling tournament problem
• 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
• Strong lift-and-project cutting planes for the stable set problem
• A heuristic approach for the travelling purchaser problem
• Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
• Strong-branching inequalities for convex mixed integer nonlinear programs
• Certifying algorithms
• Constant factor approximation algorithm for TSP satisfying a biased triangle inequality
• Constructing arbitrarily large graphs with a specified number of Hamiltonian cycles
• Estimation-based metaheuristics for the probabilistic traveling salesman problem
• Integrating operations research in constraint programming
• Contributions to the minimum linear arrangement problem.
• Validating vehicle routing zone construction using Monte Carlo simulation
• 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
• Multi-depot multiple TSP: a polyhedral study and computational results
• Deterministic ``snakes and ladders heuristic for the Hamiltonian cycle problem
• Multiple depot ring star problem: a polyhedral study and an exact algorithm
• New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints
• Constrained discriminant analysis via \(0/1\) mixed integer programming
• Scaling laws for maximum coloring of random geometric graphs
• Complexity reduction preserving dynamical behavior of biochemical networks
• Continuous line drawings via the traveling salesman problem
• Problems of discrete optimization: challenges and main approaches to solve them
• Three enhancements for optimization-based bound tightening
• Title not available (Why is that?)
• Compact formulations of the Steiner traveling salesman problem and related problems
• 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
• A new novel local search integer-programming-based heuristic for PCB assembly on collect-and-place machines
• IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem
• Analyses of advanced iterated tour partitioning heuristics for generalized vehicle routing problems
• A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem
• What you should know about the vehicle routing problem
• The salesman and the tree: the importance of search in CP
• Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems
• Generalized traveling salesman problem reduction algorithms
• Improved filtering for weighted circuit constraints
• Algorithm runtime prediction: methods \& evaluation
• George Dantzig's contributions to integer programming
• Finding paths of length \(k\) in \(O^{*}(2^k)\) time
• The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
• Multi-objective meta-heuristics for the traveling salesman problem with profits
• Design and analysis of stochastic local search for the multiobjective traveling salesman problem
• A tutorial on branch and cut algorithms for the maximum stable set problem
• Integrated task assignment and path optimization for cooperating uninhabited aerial vehicles using genetic algorithms
• On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem
• The clustered orienteering problem
• Single liner shipping service design
• The neighbor-net algorithm
• On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances
• On interior-point warmstarts for linear and combinatorial optimization
• Generating partitions of a graph into a fixed number of minimum weight cuts
• A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
• Heuristics for the mixed swapping problem
• Exact algorithms for routing problems under vehicle capacity constraints
• 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
• Certification of an optimal TSP tour through 85,900 cities
• 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

This page was built for software: Concorde