Solution of a Large-Scale Traveling-Salesman Problem

Recommendations

Solution of a large-scale traveling-salesman problem
Solution of large-scale symmetric travelling salesman problems
On the solution of traveling salesman problems
scientific article; zbMATH DE number 4053382
On an algorithm for solving traveling salesman problems of large dimension
An algorithm for solving large-scale travelling-salesman problems and its numerical implementation
scientific article; zbMATH DE number 1947373
A method for solving traveling-salesman problems
Solving the k-best traveling salesman problem
scientific article; zbMATH DE number 3882227

Cited in

(only showing first 100 items - show all)

Certification of an optimal TSP tour through 85,900 cities
A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs
A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem
Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration
The complexity of facets (and some facets of complexity)
A cutting plane procedure for the travelling salesman problem on road networks
The hierarchical network design problem
Optimization of a 532-city symmetric traveling salesman problem by branch and cut
The complexity of facets resolved
A polynomial-time solution to Papadimitriou and Steiglitz's ``traps
Models and exact solutions for a class of stochastic location-routing problems
On cutting-plane proofs in combinatorial optimization
On the choice of step size in subgradient optimization
Hamiltonian location problems
A note on exploiting the Hamiltonian cycle problem substructure of the asymmetric traveling salesman problem
A note on the effect of neighborhood structure in simulated annealing
The traveling salesman problem: An overview of exact and approximate algorithms
Neighborhood search algorithms for guaranteeing optimal traveling salesman tours must be inefficient
An approach for solving a class of transportation scheduling problems
The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem
A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
An empirical study of a new metaheuristic for the traveling salesman problem
A cutting-plane approach to the edge-weighted maximal clique problem
Transformation of the generalized traveling-salesman problem into the standard traveling-salesman problem
A two-dimensional mapping for the traveling salesman problem
Vehicle routing with split deliveries
The median tour and maximal covering tour problems: Formulations and heuristics
Tabu search performance on the symmetric travelling salesman problem
The pickup and delivery problem: Faces and branch-and-cut algorithm
A classification of formulations for the (time-dependent) traveling salesman problem
A bilevel programming approach to the travelling salesman problem.
A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron \& Steel Complex
Survey of facial results for the traveling salesman polytope
Layered graph approaches for combinatorial optimization problems
Computational approaches for zero forcing and related problems
A branch-and-cut algorithm for the minimum branch vertices spanning tree problem
Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations
A variable MIP neighborhood descent algorithm for managing inventory and distribution of cash in automated Teller machines
Integer programming models and linearizations for the traveling car renter 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
The traveling salesman problem on grids with forbidden neighborhoods
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
Covering and connectivity constraints in loop-based formulation of material flow network design in facility layout
A note on the polytope of bipartite TSP
Formulations for the orienteering problem with additional constraints
Rejoinder on: continuous approximation models in freight distribution management
Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem
Crane scheduling in railway yards: an analysis of computational complexity
A branch-and-Benders-cut algorithm for the crew scheduling and routing problem in road restoration
The green location-routing problem
Revisiting the Hamiltonian p-median problem: a new formulation on directed graphs and a branch-and-cut algorithm
A comparison of algorithms for finding an efficient theme park tour
Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks
Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs
Traveling worker assembly line (re)balancing problem: model, reduction techniques, and real case studies
Inventory rebalancing and vehicle routing in bike sharing systems
A penalized method for multivariate concave least squares with application to productivity analysis
Exact algorithms for the equitable traveling salesman problem
The traveling salesman problem with draft limits
Exact algorithms for the order picking problem
On the integrality ratio of the subtour LP for Euclidean TSP
Algorithm for directing cooperative vehicles of a vehicle routing problem for improving fault-tolerance
A novel list-constrained randomized VND approach in GPU for the traveling thief problem
The rainbow spanning forest problem
Improved approximations for cubic bipartite and cubic TSP
The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints
An optimality cut for mixed integer linear programs
Constrained spanning trees and the traveling salesman problem
Stronger K-tree relaxations for the vehicle routing problem
Strong lower bounds for the prize collecting Steiner problem in graphs
Approximate algorithms for the travelling purchaser problem
Determination of optimal path under approach and exit constraints
New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints
Solving the max-cut problem using eigenvalues
Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies
An alternate formulation of the symmetric traveling salesman problem and its properties
Travelling salesman problem in tissue P systems with costs
A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for routing problems with time windows
Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network
A way to optimally solve a green time-dependent vehicle routing problem with time windows
Models and linearizations for the Traveling Car Renter with passengers
Geometric and LP-based heuristics for angular travelling salesman problems in the plane
A heuristic algorithm for the routing and scheduling problem with time windows: a case study of the automotive industry in Mexico
Multiperiod multi traveling salesmen problem considering time window constraints with an application to a real world case
Polyhedral approximations of the semidefinite cone and their application
Vehicle routing with endogenous learning: application to offshore plug and abandonment campaign planning
A metaheuristic algorithm and structured analysis for the Line-haul Feeder vehicle routing problem with time windows
The power of linear programming: some surprising and unexpected LPs
A solution framework for linear PDE-constrained mixed-integer problems
Galois connections for phylogenetic networks and their polytopes
Branch-and-price for a class of nonconvex mixed-integer nonlinear programs
Computing in combinatorial optimization
Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation
Branch-and-refine for solving time-expanded MILP formulations
A branch-and-price algorithm for solving the single-hub feeder network design problem
Learning to sparsify travelling salesman problem instances
Collection of different types of milk with multi-tank tankers under uncertainty: a real case study

This page was built for publication: Solution of a Large-Scale Traveling-Salesman Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5378639)