Probabilistic asymptotic properties of some combinatorial optimization problems
From MaRDI portal
Recommendations
- Combinational optimization problems for which almost every algorithm is asymptotically optimal
- An asymptotical study of combinatorial optimization problems by means of statistical mechanics
- Probabilistische analyse von heuristiken der kombinatorischen optimierung – ein überbllck
- A note on the asymptotic behaviour of bottleneck problems
- scientific article; zbMATH DE number 3974320
Cites work
- scientific article; zbMATH DE number 3327849 (Why is no real title available?)
- A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
- Assignment Problems and the Location of Economic Activities
- Asymptotic Properties of the Quadratic Assignment Problem
- On random quadratic bottleneck assignment problems
- On the Expected Value of a Random Assignment Problem
- Optimal control of plotting and drilling machines: A case study
- P-Complete Approximation Problems
- Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
- The asymptotic probabilistic behaviour of quadratic sum assignment problems
Cited in
(29)- Efficient estimation of the modified Gromov-Hausdorff distance between unweighted graphs
- OR Utopia
- Bounds for random binary quadratic programs
- Asymptotic differential approximation ratio: Definitions, motivations and application to some combinatorial problems
- scientific article; zbMATH DE number 3892936 (Why is no real title available?)
- On the complexity of nonoverlapping multivariate marginal bounds for probabilistic combinatorial optimization problems
- Selected topics on assignment problems
- Probabilistic Combinatorial Optimization: Moments, Semidefinite Programming, and Asymptotic Bounds
- Probabilistische analyse von heuristiken der kombinatorischen optimierung – ein überbllck
- An asymptotical study of combinatorial optimization problems by means of statistical mechanics
- A linear ordering problem of sets
- Uncertain programming model for uncertain optimal assignment problem
- Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points
- Random assignment problems
- Estimates for the Syracuse problem via a probabilistic model
- The random quadratic assignment problem
- Heuristically determining cliques of given cardinality and with minimal cost within weighted complete graphs
- Local search with memory: Benchmarking RTS
- On optimality of a polynomial algorithm for random linear multidimensional assignment problem
- Asymptotic behavior of the quadratic knapsack problem
- Probabilistic and Worst Case Analyses of Classical Problems of Combinatorial Optimization in Euclidean Space
- Combinational optimization problems for which almost every algorithm is asymptotically optimal
- Asymptotics of two integrals from optimization theory and geometric probability
- Probabilistic estimates for the generalized maximum satisfiability problem
- A note on the asymptotic behaviour of bottleneck problems
- The random QUBO
- Discrete optimization: an Austrian view
- On a class of optimization problems with no ``efficiently computable solution
- scientific article; zbMATH DE number 1839489 (Why is no real title available?)
This page was built for publication: Probabilistic asymptotic properties of some combinatorial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1067976)
