Pages that link to "Item:Q5894461"
From MaRDI portal
The following pages link to In Pursuit of the Traveling Salesman (Q5894461):
Displaying 40 items.
- Adapting the traveling salesman problem to an adiabatic quantum computer (Q352991) (← links)
- Shorter tours by nicer ears: \(7/5\)-approximation for the graph-TSP, \(3/2\) for the path version, and \(4/3\) for two-edge-connected subgraphs (Q484552) (← links)
- Routing under constraints: problem of visit to megalopolises (Q510285) (← links)
- A discrete-continuous routing problem with precedence constraints (Q721512) (← links)
- A class of exponential neighbourhoods for the quadratic travelling salesman problem (Q782742) (← links)
- A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem (Q1681265) (← links)
- Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs (Q1751242) (← links)
- A linear time algorithm for the \(3\)-neighbour travelling salesman problem on a Halin graph and extensions (Q1751254) (← links)
- The windy rural postman problem with a time-dependent zigzag option (Q1751757) (← links)
- Hybrid optimization methods for time-dependent sequencing problems (Q1751901) (← links)
- Travelling salesman problem in tissue P systems with costs (Q1983010) (← links)
- POPMUSIC for the travelling salesman problem (Q1991147) (← links)
- On the problem of sequential traversal of megalopolises with precedence conditions and cost functions depending on a list of tasks (Q2071605) (← links)
- Solving the traveling delivery person problem with limited computational time (Q2103948) (← links)
- Evolutionary operators for the Hamiltonian completion problem (Q2156924) (← links)
- A linearithmic heuristic for the travelling salesman problem (Q2242243) (← links)
- A Davidson college multi-objective assignment problem: a case study (Q2257101) (← links)
- Priority functions for the approximation of the metric TSP (Q2444775) (← links)
- Mathematical formulations for a 1-full-truckload pickup-and-delivery problem (Q2630253) (← 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)
- Dynamic programming in the routing problem: decomposition variant (Q5097703) (← links)
- Optimizing multi-inserts in routing problems with constraints (Q5114290) (← links)
- On the question of the optimization of permutations in the problem with dynamic constraints (Q5114333) (← links)
- Network Reconstruction – A New Approach to the Traveling Salesman Problem and Complexity (Q5117306) (← 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)
- The routing problems with optimization of the starting point: dynamic programming (Q5134261) (← 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)
- New Bounds for the Traveling Salesman Constant (Q5246169) (← links)
- A $(1+\varepsilon)$-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs (Q5376438) (← links)
- A note on computational aspects of the Steiner traveling salesman problem (Q6066594) (← links)
- Two-stage dynamic programming in the routing problem with decomposition (Q6078066) (← links)
- On the Application of the Minimax Traveling Salesman Problem in Aviation Logistics (Q6153045) (← links)
