The traveling salesman problem. A computational study.
From MaRDI portal
Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)
Recommendations
Cited in
(only showing first 100 items - show all)- Certification of an optimal TSP tour through 85,900 cities
- Design and analysis of stochastic local search for the multiobjective traveling salesman problem
- Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem
- A cutting plane procedure for the travelling salesman problem on road networks
- A two-dimensional mapping for the traveling salesman problem
- The traveling salesman problem and its variations
- On residual approximation in solution extension problems
- An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem
- Study of the pedigree polytope and a sufficiency condition for nonadjacency in the tour polytope
- A hybrid approach for biobjective optimization
- Reducing the size of combinatorial optimization problems using the operator vaccine by fuzzy selector with adaptive heuristics
- On global integer extrema of real-valued box-constrained multivariate quadratic functions
- A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem
- A note on the polytope of bipartite TSP
- Complexity of graphs generated by wheel graph and their asymptotic limits
- Concorde
- The late acceptance hill-climbing heuristic
- Efficient filtering for the resource-cost alldifferent constraint
- A note on using the resistance-distance matrix to solve Hamiltonian cycle problem
- Number of spanning trees of different products of complete and complete bipartite graphs
- Event-driven optimal control for a robotic exploration, pick-up and delivery problem
- Application of imperialist competitive algorithm on solving the traveling salesman problem
- BPPLIB: a library for bin packing and cutting stock problems
- Multi-criteria optimization for last mile distribution of disaster relief aid: test cases and applications
- Binary Steiner trees: structural results and an exact solution approach
- The windy rural postman problem with a time-dependent zigzag option
- Hybrid optimization methods for time-dependent sequencing problems
- Exact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup times
- The effect of the asymmetry of road transportation networks on the traveling salesman problem
- Complexity reduction preserving dynamical behavior of biochemical networks
- Cover-encodings of fitness landscapes
- Algorithm for directing cooperative vehicles of a vehicle routing problem for improving fault-tolerance
- A credibilistic goal programming model for inventory routing problem with hazardous materials
- The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach
- Computing the variance of tour costs over the solution space of the TSP in polynomial time
- Generating partitions of a graph into a fixed number of minimum weight cuts
- Travelling salesman problem in tissue P systems with costs
- Geometric and LP-based heuristics for angular travelling salesman problems in the plane
- Mathematical modeling of multiple tour multiple traveling salesman problem using evolutionary programming
- A personalized walking bus service requiring optimized route decisions: a real case
- Efficient formulations for the traveling car renter problem and its quota variant
- Synchronized pickup and delivery problems with connecting FIFO stack
- Finding a Hamiltonian cycle by finding the global minimizer of a linearly constrained problem
- Computing in combinatorial optimization
- Scheduling heterogeneous delivery tasks on a mixed logistics platform
- Analyzing the performance of TSP solver methods
- Unconstrained binary models of the travelling salesman problem variants for quantum optimization
- Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation
- Evolving test instances of the Hamiltonian completion problem
- 2DPackLib: a two-dimensional cutting and packing library
- Optimal patchings for consecutive ones matrices
- Multilevel asymptotic-preserving Monte Carlo for kinetic-diffusive particle simulations of the Boltzmann-BGK equation
- A new class of hard problem instances for the 0-1 knapsack problem
- Complexity of linear relaxations in integer programming
- Learning the travelling salesperson problem requires rethinking generalization
- Block coordinate descent for smooth nonconvex constrained minimization
- Efficient optimization of the Held-Karp lower bound
- A transformation technique for the clustered generalized traveling salesman problem with applications to logistics
- Multiple k-opt evaluation multiple k-opt moves with GPU high performance local search to large-scale traveling salesman problems
- Data-driven polynomial chaos expansion for machine learning regression
- Generalization of machine learning for problem reduction: a case study on travelling salesman problems
- Benders decomposition for the distributionally robust optimization of pricing and reverse logistics network design in remanufacturing systems
- A customized genetic algorithm for bi-objective routing in a dynamic network
- Crowdshipping by employees of distribution centers: optimization approaches for matching supply and demand
- Exact and heuristic algorithms for the fleet composition and periodic routing problem of offshore supply vessels with berth allocation decisions
- Hard to solve instances of the Euclidean traveling salesman problem
- Lexicographically minimizing axial motions for the Euclidean TSP
- Assignment problem with conflicts
- A cutting plane method for risk-constrained traveling salesman problem with random arc costs
- Solving linear programs with complementarity constraints using branch-and-cut
- Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange
- A branch-and-cut algorithm for the target visitation problem
- An approximation algorithm for vehicle routing with compatibility constraints
- Number of spanning trees in the sequence of some graphs
- The multicommodity traveling salesman problem with priority prizes: a mathematical model and metaheuristics
- Pickup and delivery problem with incompatibility constraints
- A scheduling problem in the baking industry
- The complexity of some classes of pyramid graphs created from a gear graph
- On the facial structure of symmetric and graphical traveling salesman polyhedra
- A combinatorial branch-and-bound algorithm for box search
- A new separation algorithm for the Boolean quadric and cut polytopes
- A fast metaheuristic for the travelling salesperson problem with hotel selection
- The minimum flow cost Hamiltonian cycle problem: a comparison of formulations
- Generating subtour elimination constraints for the TSP from pure integer solutions
- Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday)
- Local cuts for mixed-integer programming
- Fast separation for the three-index assignment problem
- On learning and branching: a survey
- Hölder curves and parameterizations in the Analyst's traveling salesman theorem
- The symmetric quadratic traveling salesman problem
- The covering Canadian traveller problem
- Priority functions for the approximation of the metric TSP
- A note on the extension complexity of the knapsack polytope
- Compact formulations of the Steiner traveling salesman problem and related problems
- Flexible pair-copula estimation in D-vines using bivariate penalized splines
- Mathematical formulations for a 1-full-truckload pickup-and-delivery problem
- Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics
- Separation, dimension, and facet algorithms for node flow polyhedra
- A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem
- Human solution strategies for the vehicle routing problem: experimental findings and a choice-based theory
This page was built for publication: The traveling salesman problem. A computational study.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3425132)
