Dynamic Programming Treatment of the Travelling Salesman Problem

Cited in

(only showing first 100 items - show all)

Richard Bellman's contributions to computer science
Probabilistic analysis of solving the assignment problem for the traveling salesman problem
On the relationship between the biconnectivity augmentation and traveling salesman problems
Dynamic programming with convexity, concavity and sparsity
Reduced complexity dynamic programming based on policy iteration
A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
The dynamic programming method in the generalized traveling salesman problem
On residual approximation in solution extension problems
A simulation based restricted dynamic programming approach for the green time dependent vehicle routing problem
Expansion of gene clusters, circular orders, and the shortest Hamiltonian path problem
Solving large-scale TSP using a fast wedging insertion partitioning approach
On global integer extrema of real-valued box-constrained multivariate quadratic functions
Finding supported paths in heterogeneous networks
Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials
Temporal ordering of substitutions in RNA evolution: uncovering the structural evolution of the Human Accelerated Region 1
Restricted dynamic programming: a flexible framework for solving realistic VRPs
Vehicle routing under time-dependent travel times: the impact of congestion avoidance
Embedded local search approaches for routing optimization
Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree}
An extremal constrained routing problem with internal losses
An alternate formulation of the symmetric traveling salesman problem and its properties
Problem of optimal choice of a route under conditions of time discounting
Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization
The frequency of the optimal Hamiltonian cycle computed with frequency quadrilaterals for traveling salesman problem
Many-visits TSP revisited
Design of experiment for tuning parameters of an ant colony optimization method for the constrained shortest Hamiltonian path problem in the grid networks
Hybrid control for optimal visiting problems for a single player and for a crowd
On the problem of sequential traversal of megalopolises with precedence conditions and cost functions depending on a list of tasks
Computing in combinatorial optimization
Parameterized algorithms and complexity for the traveling purchaser problem and its variants
The distribution of edge-frequencies computed with frequency quadrilaterals for traveling salesman problem
Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version
An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization
Complete symmetry breaking constraints for the class of uniquely Hamiltonian graphs
Efficient PTAS for the maximum traveling salesman problem in a metric space of fixed doubling dimension
Deep policy dynamic programming for vehicle routing problems
A genetic algorithm for a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times
A new upper bound for the traveling salesman problem in cubic graphs
Dynamic programming in the routing problem with complex dependence of costs on the list of jobs
Domino sequencing: scheduling with state-based sequence-dependent setup times
Faster exponential-time algorithms in graphs of bounded average degree
A memetic algorithm for the multiperiod vehicle routing problem with profit
Particle swarm optimization-based algorithms for TSP and generalized TSP
An exact algorithm with linear complexity for a problem of visiting megalopolises
On the complexity landscape of connected $f$-factor problems
Sufficient and necessary conditions for an edge in the optimal Hamiltonian cycle based on frequency quadrilaterals
Fast monotone summation over disjoint sets
Solving SCS for bounded length strings in fewer than $2^n$ steps
On pedigree polytopes and Hamiltonian cycles
Algorithms in unnormalized arithmetic. III: Matrix inversion
The Königsberg bridges problem generalized
The traveling salesman problem with few inner points
Dynamic graph conv-LSTM model with dynamic positional encoding for the large-scale traveling salesman problem
Parameterised temporal exploration problems
On cutwidth parameterized by vertex cover
End-vertices of graph search algorithms
Strategies for generating well centered tetrahedral meshes on industrial geometries
A new graph model and algorithms for consistent superstring problems
Hybrid functions of Bernstein polynomials and block-pulse functions for solving optimal control of the nonlinear Volterra integral equations
Clustering with Local Restrictions
Invitation to Algorithmic Uses of Inclusion–Exclusion
Algebraic dynamic programming for multiple context-free grammars
Numerical treatment of nonlinear optimal control problems
The bi-objective mixed capacitated general routing problem with different route balance criteria
On solving manufacturing cell formation via bicluster editing
Special frequency quadrilaterals and an application
Solving the job-shop scheduling problem optimally by dynamic programming
Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times
Understanding chicken walks on n × n grid: Hamiltonian paths, discrete dynamics, and rectifiable paths
A geometrical method in combinatorial complexity
Two machine flow shop scheduling problems with sequence dependent setup times: A dynamic programming approach
Evaluation of permanents in rings and semirings
Some optimal path problems subject to improvements
About an optimal visiting problem
Problem of successive megalopolis traversal with the precedence conditions
Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems
Solving a routing problem with the aid of an independent computations scheme
On cutwidth parameterized by vertex cover
Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis
Randomized sampling for large zero-sum games
On one routing problem modeling movement in radiation fields
Optimization of the start point in the GTSP with the precedence conditions
On routing problem with starting point optimization
A quick method to compute sparse graphs for traveling salesman problem using random frequency quadrilaterals
On sequential traversal of sets
A 3/2-Approximation for the Metric Many-Visits Path TSP
One task of routing jobs in high radiation conditions
Reaching a joint decision with minimal elicitation of voter preferences
scientific article; zbMATH DE number 7559398 (Why is no real title available?)
The set cover conjecture and subgraph isomorphism with a tree pattern
Optimizing multi-inserts in routing problems with constraints
On the question of the optimization of permutations in the problem with dynamic constraints
Finding a Hamilton cycle fast on average using rotations and extensions
Optimizing the starting point in a precedence constrained routing problem with complicated travel cost functions
On one routing task with the optimization of the start-finish point
The routing problems with optimization of the starting point: dynamic programming
To the question of optimization of the starting point in the routing problem with restrictions
Heuristic approaches to minimize tour duration for the TSP with multiple time windows
Approximation algorithms for mixed, windy, and capacitated arc routing problems
Design tools for reporter strands and DNA origami scaffold strands

This page was built for publication: Dynamic Programming Treatment of the Travelling Salesman Problem

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