Pages that link to "Item:Q1612766"
From MaRDI portal
The following pages link to The traveling salesman problem and its variations (Q1612766):
Displayed 50 items.
- The traveling salesman problem on grids with forbidden neighborhoods (Q1680496) (← links)
- A note on the polytope of bipartite TSP (Q1682883) (← links)
- Heuristics for routing heterogeneous unmanned vehicles with fuel constraints (Q1717710) (← links)
- Application of imperialist competitive algorithm on solving the traveling salesman problem (Q1736616) (← links)
- Online covering salesman problem (Q1743496) (← 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)
- The traveling purchaser problem and its variants (Q1751767) (← links)
- An experimental comparison of seriation methods for one-mode two-way data (Q1752777) (← links)
- An integer programming-based local search for the covering salesman problem (Q1761202) (← links)
- The effect of the asymmetry of road transportation networks on the traveling salesman problem (Q1762144) (← links)
- Traveling salesman games with the Monge property (Q1827808) (← links)
- The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach (Q1926737) (← links)
- Online graph exploration: New results on old and new algorithms (Q1929219) (← links)
- Computing the variance of tour costs over the solution space of the TSP in polynomial time (Q1935572) (← links)
- The symmetric travelling salesman problem. II: New low bounds (Q1956919) (← links)
- Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization (Q1991103) (← links)
- Bee-inspired algorithms applied to vehicle routing problems: a survey and a proposal (Q1992577) (← links)
- The multiagent planning problem (Q2012788) (← links)
- Approximation algorithms for general cluster routing problem (Q2019492) (← links)
- An asymptotically tight online algorithm for \(m\)-steiner traveling salesman problem (Q2059872) (← links)
- On the problem of sequential traversal of megalopolises with precedence conditions and cost functions depending on a list of tasks (Q2071605) (← links)
- Approximation algorithms with constant ratio for general cluster routing problems (Q2084625) (← links)
- Using the method of conditional expectations to supply an improved starting point for CCLS (Q2091119) (← links)
- Seriation using tree-penalized path length (Q2098032) (← links)
- Unconstrained binary models of the travelling salesman problem variants for quantum optimization (Q2102287) (← links)
- A LP-based approximation algorithm for generalized traveling salesperson path problem (Q2150585) (← links)
- Network construction/restoration problems: cycles and complexity (Q2168711) (← links)
- Gossip algorithms for heterogeneous multi-vehicle routing problems (Q2252974) (← links)
- Lexicographically minimizing axial motions for the Euclidean TSP (Q2268758) (← links)
- \(\frac 32\)-approximation algorithm for two variants of a 2-depot Hamiltonian path problem (Q2270326) (← links)
- Traveling salesman problem across well-connected cities and with location-dependent edge lengths (Q2274794) (← links)
- Optimizing insertions in a constraint routing problem with complicated cost functions (Q2290475) (← links)
- Introduction to reconfiguration (Q2331456) (← links)
- Four-point conditions for the TSP: the complete complexity classification (Q2339841) (← links)
- Scheduling multi-colour print jobs with sequence-dependent setup times (Q2341398) (← links)
- A note on the separation of subtour elimination constraints in elementary shortest path problems (Q2355890) (← links)
- A heuristic framework on a common generalization of the vehicle routing problem and the linear ordering problem (Q2358180) (← links)
- Elements of dynamic programming in local improvement constructions for heuristic solutions of routing problems with constraints (Q2362374) (← links)
- Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs (Q2384394) (← links)
- Good triangulations yield good tours (Q2384914) (← links)
- The traveling group problem (Q2385125) (← links)
- On the Euclidean TSP with a permuted van der Veen matrix (Q2390323) (← links)
- Hölder curves and parameterizations in the Analyst's traveling salesman theorem (Q2419274) (← links)
- On Eulerian extensions and their application to no-wait flowshop scheduling (Q2434285) (← links)
- The symmetric quadratic traveling salesman problem (Q2434982) (← links)
- The covering Canadian traveller problem (Q2440168) (← links)
- Optimal toll design: a lower bound framework for the asymmetric traveling salesman problem (Q2452379) (← links)
- Solving elementary shortest-path problems as mixed-integer programs (Q2454365) (← links)
- Discrete optimization by optimal control methods. II: The static traveling salesman problem (Q2457582) (← links)