Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
random instances
Description:
Problem instances generated or selected according to a probability distribution, used to analyze algorithms, complexity, and optimization performance.
Related topics:
Constraint Satisfaction and Optimization (19%),
Complexity and Algorithms in Graphs (18%),
Optimization and Packing Problems (7%),
Vehicle Routing Optimization Methods (7%)
OpenAlex ID:
keywords/random-instances
A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
2001
·
Edward Farhi
, Jeffrey Goldstone
, et al.
·
Science
·
2,519
PDF
The LASSO Risk for Gaussian Matrices
2011
·
Mohsen Bayati
, Andrea Montanari
·
IEEE Transactions on Information Theory
·
387
PDF
Anderson localization makes adiabatic quantum optimization fail
2010
·
Boris Altshuler
, Hari Krovi
, et al.
·
Proceedings of the National Academy of Sciences
·
320
The solution of some random NP-hard problems in polynomial expected time
1989
·
M.E Dyer
, A.M Frieze
·
Journal of Algorithms
·
240
On the Power Assignment Problem in Radio Networks
2004
·
Andrea E.F. Clementi
, Paolo Penna
, et al.
·
Mobile Networks and Applications
·
185
PDF
The Average Number of Stable Matchings
1989
·
Boris Pittel
·
SIAM Journal on Discrete Mathematics
·
173
The TSP phase transition
1996
·
Ian P. Gent
, Toby Walsh
·
Artificial Intelligence
·
158
PDF
Performance of the quantum adiabatic algorithm on random instances of two optimization problems on regular hypergraphs
2012
·
Edward Farhi
, David Gosset
, et al.
·
Physical Review A
·
126
PDF
Apple tasting
2000
·
David P. Helmbold
, Nicholas Littlestone
, et al.
·
Information and Computation
·
115
Problem difficulty for tabu search in job-shop scheduling
2003
·
Jean-Paul Watson
, J.Christopher Beck
, et al.
·
Artificial Intelligence
·
107
PDF
A study of complexity transitions on the asymmetric traveling salesman problem
1996
·
Weixiong Zhang
, Richard E. Korf
·
Artificial Intelligence
·
88
PDF
Random instances of a graph coloring problem are hard
1988
·
Ramarathnam Venkatesan
, Leonid Levin
·
ACM Symposium on Theory of Computing (STOC)
·
77
Computational experience with an interior point algorithm on the satisfiability problem
1990
·
A. P. Kamath
, N. K. Karmarkar
, et al.
·
Annals of Operations Research
·
70
Algorithms and certificates for Boolean CSP refutation: smoothed is no harder than random
2022
·
Venkatesan Guruswami
, Pravesh K. Kothari
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
69
PDF
Phase Transitions and Backbones of the Asymmetric Traveling Salesman Problem
2004
·
W. Zhang
·
Journal of Artificial Intelligence Research
·
64
PDF
Pliable Index Coding
2015
·
Siddhartha Brahma
, Christina Fragouli
·
IEEE Transactions on Information Theory
·
57
Theoretical analysis of two ACO approaches for the traveling salesman problem
2011
·
Timo Kötzing
, Frank Neumann
, et al.
·
Swarm Intelligence
·
57
Improvements to the Or-opt heuristic for the symmetric travelling salesman problem
2006
·
G Babin
, S Deneault
, et al.
·
Journal of the Operational Research Society
·
54
Heavy Tails in the Distribution of Time to Solution for Classical and Quantum Annealing
2015
·
Damian S. Steiger
, Troels F. Rønnow
, et al.
·
Physical Review Letters
·
53
PDF
On the relevance of avoided crossings away from quantum critical point to the complexity of quantum adiabatic algorithm
2010
·
Knysh, S.
, Smelyanskiy, V.
·
arXiv (Cornell University)
·
50
PDF
Adiabatic quantum optimization fails for random instances of NP-complete problems
2009
·
Altshuler, Boris
, Krovi, Hari
, et al.
·
arXiv (Cornell University)
·
50
PDF
Analysis of the Karmarkar-Karp differencing algorithm
2008
·
S. Boettcher
, S. Mertens
·
The European Physical Journal B
·
47
PDF
Probabilistic Analysis of the Multidimensional Knapsack Problem
1989
·
M. E. Dyer
, A. M. Frieze
·
Mathematics of Operations Research
·
46
An upper bound for the solvability probability of a random stable roommates instance
1994
·
Boris G. Pittel
, Robert W. Irving
·
Random Structures and Algorithms
·
45
A Membrane Algorithm for the Min Storage Problem
2006
·
Alberto Leporati
, Dario Pagani
·
Lecture notes in computer science
·
41
Show more works
View as search
Works count:
203
Citation count:
6,388
Year
Topic
Type