scientific article; zbMATH DE number 3932819
From MaRDI portal
Publication:3707785
approximationassignmentasymptotic behaviorCellular dissection algorithmslocations of citiesnear optimal solutionsoptimal tourprobabilistic analysistravelling salesman
Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Programming involving graphs or networks (90C35)
Recommendations
- Analyzing randomized search heuristics: tools from probability theory
- The Probabilistic Analysis of a Heuristic for the Assignment Problem
- Heuristic Reasoning and the Theory of Probability
- scientific article; zbMATH DE number 4137536
- scientific article; zbMATH DE number 4049028
- scientific article; zbMATH DE number 4047070
- scientific article; zbMATH DE number 1246226
- Probabilistic performance of a heurisic for the satisfiability problem
- scientific article; zbMATH DE number 15993
- scientific article; zbMATH DE number 3936510
Cited in
(54)- Experimentation in optimization
- On Frieze's (3) limit for lengths of minimal spanning trees
- Two probabilistic results on rectilinear Steiner trees
- An inexact algorithm for the sequential ordering problem
- Quantizers ad the worst case Euclidean traveling salesman problem
- Probabilistic performance of a heurisic for the satisfiability problem
- Reduction techniques providing initial groupings for Euclidean traveling salesman patching algorithms
- A probabilistic analysis of the switching algorithm for the Euclidean TSP
- 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
- Constructing sparse spanners for most graphs in higher dimensions
- A note on the complexity of the asymmetric traveling salesman problem
- Combinatorial aspects of geometric graphs
- The expected length of a random line segment in a rectangle.
- Solving large-scale TSP using a fast wedging insertion partitioning approach
- Continuous approximation models in freight distribution management
- Lower tolerance-based branch and bound algorithms for the ATSP
- On the depth of combinatorial optimization problems
- Asymptotic expected performance of some TSP heuristics: An empirical evaluation
- On properties of geometric random problems in the plane
- Divide and conquer strategies for parallel TSP heuristics
- The simultaneous semi-random model for TSP
- Heuristics as Markov chains
- Further results on the probabilistic traveling salesman problem
- \(k\)-nearest-neighbor clustering and percolation theory
- On estimating the distribution of optimal traveling salesman tour lengths using heuristics
- Tolerance-based branch and bound algorithms for the ATSP
- Iterative patching and the asymmetric traveling salesman problem
- Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics
- A study of complexity transitions on the asymmetric traveling salesman problem
- Probabilistic analysis of bipartite traveling salesman problems
- Probabilistic analysis of an approximation algorithm for the traveling salesman problem on unbounded from above instances
- Probabilistische analyse von heuristiken der kombinatorischen optimierung – ein überbllck
- scientific article; zbMATH DE number 3869068 (Why is no real title available?)
- Probabilistic Analysis of Assignment Ranking: The Traveling Salesman Problems
- scientific article; zbMATH DE number 3936510 (Why is no real title available?)
- scientific article; zbMATH DE number 3950233 (Why is no real title available?)
- Probabilistic Algorithm for the Directed Traveling Salesman Problem
- scientific article; zbMATH DE number 4099047 (Why is no real title available?)
- scientific article; zbMATH DE number 706869 (Why is no real title available?)
- The traveling salesman problem with flexible coloring
- Analysis of Probabilistic Combinatorial Optimization Problems in Euclidean Spaces
- A randomly weighted minimum arborescence with a random cost constraint
- Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order
- Construction heuristics for the asymmetric TSP.
- The mean field traveling salesman and related problems
- Probabilistic bounds on the k-traveling salesman problem and the traveling repairman problem
- Average-case analysis of best-first search in two representative directed acyclic graphs
- Towards auction algorithms for large dense assignment problems
- A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem
- On the relationship between ATSP and the cycle cover problem
- On the probabilistic behaviour of a heuristic algorithm for maximal Hamiltonian tours
- Random assignment problems
- Production setup-sequencing and lot-sizing at an animal nutrition plant through ATSP subtour elimination and patching
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3707785)
