Combinational optimization problems for which almost every algorithm is asymptotically optimal
From MaRDI portal
Publication:4836774
DOI10.1080/02331939508844086zbMath0821.90093OpenAlexW2071257964MaRDI QIDQ4836774
Publication date: 21 June 1995
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939508844086
quadratic assignmentpattern matchingasymptotically optimal solutionlocation problem on graphsvalue of the optimal solutionvalue of the worst solution
Related Items (10)
Asymptotic behavior of the quadratic knapsack problem ⋮ On optimality of a polynomial algorithm for random linear multidimensional assignment problem ⋮ Bounds for Random Binary Quadratic Programs ⋮ Quadratic bottleneck problems ⋮ Random assignment problems ⋮ Selected topics on assignment problems ⋮ A note on the asymptotic behaviour of bottleneck problems ⋮ Posterior agreement for large parameter-rich optimization problems ⋮ Uncertain programming model for uncertain optimal assignment problem ⋮ An asymptotical study of combinatorial optimization problems by means of statistical mechanics
Cites Work
- Unnamed Item
- Unnamed Item
- The Erdős-Rényi law in distribution, for coin tossing and sequence matching
- Probabilistic asymptotic properties of some combinatorial optimization problems
- A note on asymptotic properties of the quadratic assignment problem
- Asymptotic Properties of the Quadratic Assignment Problem
- On linear programs with random costs
- Random Graphs and Graph Optimization Problems
- Optimization Problems on Graphs with Independent Random Edge Weights
- Worst-Case and Probabilistic Analysis of a Geometric Location Problem
- Maximum Size of a Dynamic Data Structure: Hashing with Lazy Deletion Revisited
- A probabilistic analysis of a pattern matching problem
This page was built for publication: Combinational optimization problems for which almost every algorithm is asymptotically optimal
