Pages that link to "Item:Q918427"
From MaRDI portal
The following pages link to The traveling salesman problem. II: Exact methods (Q918427):
Displaying 34 items.
- Dynamic programming method in extremal constrained routing problems (Q357046) (← links)
- Dynamic programming in the routing problem with constraints and costs depending on a list of tasks (Q403862) (← links)
- Elements of dynamic programming in extremal routing problems (Q463354) (← links)
- Problem of successive megalopolis traversal with the precedence conditions (Q463382) (← links)
- On an iterative procedure for solving a routing problem with constraints (Q483197) (← links)
- Routing under constraints: problem of visit to megalopolises (Q510285) (← links)
- A discrete-continuous routing problem with precedence constraints (Q721512) (← links)
- Dynamic programming method in the generalized courier problem (Q733995) (← links)
- On the solution of the traveling salesman problem once again (Q885792) (← links)
- Special cases of the traveling salesman problem (Q1316125) (← links)
- An extremal constrained routing problem with internal losses (Q1956632) (← links)
- A procedure for solution of the problem of optimal covering of a finite set (Q1968506) (← links)
- Pseudo-Boolean conditional optimization models for a class of multiple traveling salesmen problems (Q2069675) (← links)
- On the problem of sequential traversal of megalopolises with precedence conditions and cost functions depending on a list of tasks (Q2071605) (← links)
- Dynamic programming in the routing problem with complex dependence of costs on the list of jobs (Q2263886) (← links)
- Optimizing insertions in a constraint routing problem with complicated cost functions (Q2290475) (← links)
- Elements of dynamic programming in local improvement constructions for heuristic solutions of routing problems with constraints (Q2362374) (← links)
- Method of scaling in approximate solution of the traveling salesman problem (Q2392635) (← links)
- An exact algorithm with linear complexity for a problem of visiting megalopolises (Q2396369) (← links)
- A model variant of the problem about radiation sources utilization (iterations based on optimization insertions) (Q4565259) (← links)
- Solving a Routing Problem with the Aid of an Independent Computations Scheme (Q4692135) (← links)
- On one routing problem modeling movement in radiation fields (Q4961696) (← links)
- Оptimization of the Start Point in the Gtsp with the Precedence Conditions (Q4963242) (← links)
- ON ROUTING PROBLEM WITH STARTING POINT OPTIMIZATION (Q4986290) (← links)
- On sequential traversal of sets (Q5037478) (← links)
- One task of routing jobs in high radiation conditions (Q5067414) (← links)
- Optimizing multi-inserts in routing problems with constraints (Q5114290) (← links)
- OPTIMIZING THE STARTING POINT IN A PRECEDENCE CONSTRAINED ROUTING PROBLEM WITH COMPLICATED TRAVEL COST FUNCTIONS (Q5125218) (← links)
- On one routing task with the optimization of the start-finish point (Q5134238) (← links)
- (Q5150579) (← links)
- THE TRAVELING SALESMAN PROBLEM: APPROXIMATE ALGORITHM BY BRANCH-AND-BOUND METHOD WITH GUARANTEED PRECISION (Q5151281) (← links)
- To the question of optimization of the starting point in the routing problem with restrictions (Q5151947) (← links)
- Dynamic programming in the generalized bottleneck problem and the start point optimization (Q5224167) (← links)
- On the Application of the Minimax Traveling Salesman Problem in Aviation Logistics (Q6153045) (← links)
