Characterizing and analyzing the relation between bin-packing problem and tabu search algorithm
The relation between problem and solution algorithm presents a similar phenomenon in
different research problems (optimization, decision, classification, ordering); the algorithm …
different research problems (optimization, decision, classification, ordering); the algorithm …
[PDF][PDF] An hybrid simulated annealing threshold accepting algorithm for satisfiability problems using dynamically cooling schemes
F Martinez-Rios, J Frausto-Solis - Electrical and Computer …, 2007 - researchgate.net
For Satisfiability (SAT) Problem there is not a deterministic algorithm able to solve it in a
polynomial time. Simulated Annealing (SA) and similar algorithms like Threshold Accepting …
polynomial time. Simulated Annealing (SA) and similar algorithms like Threshold Accepting …
A composite function for understanding bin-packing problem and Tabu search: Towards self-adaptive algorithms
V Landero, D Ríos, OJ Pérez… - … Science and Its …, 2021 - Springer
Different research problems (optimization, classification, ordering) have shown that some
problem instances are better solved by a certain solution algorithm in comparison to any …
problem instances are better solved by a certain solution algorithm in comparison to any …
A causal approach for explaining why a heuristic algorithm outperforms another in solving an instance set of the bin packing problem
The problem of algorithm selection for solving NP problems arises with the appearance of a
variety of heuristic algorithms. The first works claimed the supremacy of some algorithm for a …
variety of heuristic algorithms. The first works claimed the supremacy of some algorithm for a …
Effects in the algorithm performance from problem structure, searching behavior and temperature: a causal study case for threshold accepting and bin-packing
V Landero, J Pérez, L Cruz, T Turrubiates… - … Science and Its …, 2019 - Springer
A review of state of art reveals that the characterization and analysis of the relation between
problem-algorithm has been focused only on problem features or on algorithm features; or in …
problem-algorithm has been focused only on problem features or on algorithm features; or in …
An application of causality for representing and providing formal explanations about the behavior of the threshold accepting algorithm
The problem of algorithm selection for solving NP problems arises with the appearance of a
variety of heuristic algorithms. The first works claimed the supremacy of some algorithm for a …
variety of heuristic algorithms. The first works claimed the supremacy of some algorithm for a …
[PDF][PDF] Application of causal models for the selection and redesign of heuristic algorithms for solving the bin-packing problem
This paper deals with the problem of selecting heuristic algorithms for solving NP-hard
problems using a causal approach. The first works pursued finding an algorithm which was …
problems using a causal approach. The first works pursued finding an algorithm which was …
[PDF][PDF] A hybrid simulated annealing and threshold accepting for satisfiability problems using dynamically cooling schemes
F Martinez-Rios, J Frausto-Solis - World Sci. Eng. Acad. Soc, 2007 - academia.edu
For Satisfiability (SAT) Problem there is not a deterministic algorithm able to solve it in a
polynomial time. Simulated Annealing (SA) and similar algorithms like Threshold Accepting …
polynomial time. Simulated Annealing (SA) and similar algorithms like Threshold Accepting …