Pages that link to "Item:Q3196904"
From MaRDI portal
The following pages link to A modification of the dynamic programming method for the travelling-salesman problem (Q3196904):
Displaying 10 items.
- Choosing the sequence of approach of a nonlinear object to a group of moving points (Q356986) (← links)
- Dynamic programming method in extremal constrained routing problems (Q357046) (← links)
- An approach to solution of the movements routing problem with several participants (Q357112) (← links)
- The dynamic programming method in the generalized traveling salesman problem (Q1362222) (← links)
- An extremal constrained routing problem with internal losses (Q1956632) (← links)
- Problem of optimal choice of a route under conditions of time discounting (Q1968514) (← links)
- On one construction of the decomposition of an extremal multicriteria problem (Q1968517) (← links)
- A modified version of Tuy's method for solving d.c. programing problem (Q3813618) (← links)
- Improving TSP Tours Using Dynamic Programming over Tree Decompositions (Q4973050) (← links)
- Dynamic programming method in the generalized traveling salesman problem: the influence of inexact calculations. (Q5936764) (← links)