C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Several versions of the devour digest tidy-up heuristic for unconstrained binary quadratic problems.
Saïd Hanafi
Ahmed Riadh Rebai
Michel Vasquez
Published in:
J. Heuristics (2013)
Keyphrases
</>
simulated annealing
np complete
problems involving
optimization problems
benchmark problems
mathematical programming
integer linear programming
data sets
optimal solution
constraint satisfaction problems
decision problems
combinatorial optimization
solution quality
exact algorithms
sequencing problems