Discrete Applied Mathematics · 2000 · 50 citations · 17 references
ComputingComputer ScienceMathematicsAlgorithmsDiscrete MathematicsTheory Of ComputationCombinatorial OptimizationComplexity TheoryComputational ComplexityComputational Complexity ClassesCompletenessNp-complete ProblemsNp-completenessNp-hardnessPearson Correlation Coefficient
17
Jack Edmonds · Canadian Journal of Mathematics · 1965 · 2.4K citations · Full text
Cooling Schedules for Optimal Annealing
Bruce Hajek · Mathematics of Operations Research · 1988 · 1.2K citations