The following pages link to (Q3707785):
Displayed 37 items.
- The traveling salesman problem with flexible coloring (Q444446) (← links)
- Random shortest paths: non-Euclidean instances for metric optimization problems (Q494931) (← links)
- Average-case analysis of best-first search in two representative directed acyclic graphs (Q814592) (← links)
- Towards auction algorithms for large dense assignment problems (Q839685) (← links)
- A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem (Q857330) (← links)
- On the relationship between ATSP and the cycle cover problem (Q868952) (← links)
- Random assignment problems (Q953417) (← links)
- Production setup-sequencing and lot-sizing at an animal nutrition plant through ATSP subtour elimination and patching (Q964867) (← links)
- Experimentation in optimization (Q1084342) (← links)
- On Frieze's \(\zeta\) (3) limit for lengths of minimal spanning trees (Q1090335) (← links)
- Two probabilistic results on rectilinear Steiner trees (Q1105495) (← links)
- An inexact algorithm for the sequential ordering problem (Q1108187) (← links)
- Quantizers ad the worst case Euclidean traveling salesman problem (Q1111946) (← links)
- Reduction techniques providing initial groupings for Euclidean traveling salesman patching algorithms (Q1116908) (← links)
- On the optimal assembly of series-parallel systems (Q1197895) (← links)
- Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial (Q1203065) (← links)
- Constructing sparse spanners for most graphs in higher dimensions (Q1336765) (← links)
- A note on the complexity of the asymmetric traveling salesman problem (Q1374382) (← links)
- Combinatorial aspects of geometric graphs (Q1384214) (← links)
- The expected length of a random line segment in a rectangle. (Q1417584) (← links)
- Solving large-scale TSP using a fast wedging insertion partitioning approach (Q1666767) (← links)
- Continuous approximation models in freight distribution management (Q1688432) (← links)
- Lower tolerance-based branch and bound algorithms for the ATSP (Q1761975) (← links)
- On the depth of combinatorial optimization problems (Q1801676) (← links)
- On properties of geometric random problems in the plane (Q1908291) (← links)
- Divide and conquer strategies for parallel TSP heuristics (Q1919776) (← links)
- Further results on the probabilistic traveling salesman problem (Q2368298) (← links)
- \(k\)-nearest-neighbor clustering and percolation theory (Q2461550) (← links)
- Tolerance-based branch and bound algorithms for the ATSP (Q2482753) (← links)
- Iterative patching and the asymmetric traveling salesman problem (Q2494813) (← links)
- Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics (Q2636833) (← links)
- Probabilistic analysis of optimization problems on generalized random shortest path metrics (Q2662688) (← links)
- A study of complexity transitions on the asymmetric traveling salesman problem (Q2674187) (← links)
- Probabilistische analyse von heuristiken der kombinatorischen optimierung – ein überbllck (Q3200892) (← links)
- A Randomly Weighted Minimum Arborescence with a Random Cost Constraint (Q5085156) (← links)
- Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order (Q5505660) (← links)
- Construction heuristics for the asymmetric TSP. (Q5928379) (← links)