scientific article
From MaRDI portal
Publication:3707785
zbMath0582.90100MaRDI QIDQ3707785
J. Michael Steele, Richard M. Karp
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
asymptotic behaviorapproximationprobabilistic analysistravelling salesmanassignmentoptimal tournear optimal solutionsCellular dissection algorithmslocations of cities
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Experimentation in optimization, Constructing sparse spanners for most graphs in higher dimensions, Further results on the probabilistic traveling salesman problem, On Frieze's \(\zeta\) (3) limit for lengths of minimal spanning trees, Towards auction algorithms for large dense assignment problems, Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics, Two probabilistic results on rectilinear Steiner trees, A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem, An inexact algorithm for the sequential ordering problem, On properties of geometric random problems in the plane, Quantizers ad the worst case Euclidean traveling salesman problem, Probabilistische analyse von heuristiken der kombinatorischen optimierung – ein überbllck, On the relationship between ATSP and the cycle cover problem, Reduction techniques providing initial groupings for Euclidean traveling salesman patching algorithms, A note on the complexity of the asymmetric traveling salesman problem, Solving large-scale TSP using a fast wedging insertion partitioning approach, A Randomly Weighted Minimum Arborescence with a Random Cost Constraint, Divide and conquer strategies for parallel TSP heuristics, Probabilistic analysis of optimization problems on generalized random shortest path metrics, Combinatorial aspects of geometric graphs, A study of complexity transitions on the asymmetric traveling salesman problem, Continuous approximation models in freight distribution management, The traveling salesman problem with flexible coloring, The expected length of a random line segment in a rectangle., \(k\)-nearest-neighbor clustering and percolation theory, Random shortest paths: non-Euclidean instances for metric optimization problems, Random assignment problems, On the optimal assembly of series-parallel systems, Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial, Construction heuristics for the asymmetric TSP., Production setup-sequencing and lot-sizing at an animal nutrition plant through ATSP subtour elimination and patching, Tolerance-based branch and bound algorithms for the ATSP, Lower tolerance-based branch and bound algorithms for the ATSP, Iterative patching and the asymmetric traveling salesman problem, On the depth of combinatorial optimization problems, Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order, Average-case analysis of best-first search in two representative directed acyclic graphs
