|
520
|
Optimization, approximation, and complexity classes
– Papadimitriou, Yannakakis
- 1991
|
|
425
|
Neural computation of decisions in optimization problems
– Hopfield, Tank
- 1985
|
|
360
|
Tabu Search - Part I
– Glover
- 1989
|
|
177
|
The reactive tabu search
– Battiti, Tecchiolli
- 1994
|
|
160
|
How easy is local search
– Johnson, Papadimitriou, et al.
- 1988
|
|
139
|
Approximating the value of two prover proof systems, with applications to MAX
– Feige, Goemans
- 1995
|
|
99
|
On syntactic versus computational views of approximability
– Khanna, Motwani, et al.
- 1994
|
|
91
|
Algorithms for the Satisfiability (SAT) Problem: A Survey
– GU, PURDOM, et al.
- 1997
|
|
89
|
Algorithms for the Maximum Satisfiability Problem
– Hansen, Jaumard
- 1990
|
|
55
|
Reactive local search for the maximum clique problem
– Battiti, Protasi
- 2001
|
|
35
|
878-approximation algorithms for MAX
– Goemans, Williamson
- 1994
|
|
30
|
Optimization by Simulated Annealing", Science 220
– Kirkpatrick, Gelatt, et al.
- 1983
|
|
22
|
Reactive search, a history-based heuristic for MAX-SAT
– Battiti, Protasi
- 1997
|
|
19
|
New 3/4-approximation algorithms for MAX SAT
– Goemans, Williamson
- 1994
|
|
18
|
Bounding the probability of success of stochastic methods for global optimization
– Ferreira, Zerovnik
- 1993
|
|
14
|
New local search approximation techniques for maximum generalized satisfiability problems
– Alimonti
- 1994
|
|
9
|
Non-oblivious Local Search for Graph and Hypergraph Coloring Problems
– Alimonti
- 1995
|
|
9
|
Cubic graphs
– Greenlaw, Petreschi
- 1995
|
|
6
|
Solving MAX--SAT with non-oblivious functions and history-based heuristics
– Battiti, Protasi
- 1996
|
|
3
|
M.Protasi, "Approximate solution of NP optimization problems," Theoretical Computer Science 150
– Ausiello
- 1995
|
|
2
|
M.Protasi, "Local search, reducibility and approximability of NP optimization problems
– Ausiello
- 1995
|
|
1
|
Algorithms for the Maximum Generalized Satisfiability Problem," Tech. Rept. RAP 01.93, Dipartimento di Informatica e Sistemistica, Universit`a degli Studi di Roma "la Sapienza
– Alimonti, Ferroni
- 1993
|
|
1
|
Hardness of Approximating Problems on Cubic Graphs," Workshop ASHCOMP'96
– Alimonti, Kann
|
|
1
|
Tabu Random Walk: Transient ans Asymptotic Behavior". INFORMS
– Battiti, Tecchiolli
- 1995
|
|
1
|
Fairly accurate and cheap testing of the long code", Unpublished manuscript
– Hastad
- 1995
|
|
