Optimal selection of ingot sizes via set covering
Operations Research
Solving airline crew scheduling problems by branch-and-cut
Management Science
Algorithms for railway crew management
Mathematical Programming: Series A and B - Special issue: papers from ismp97, the 16th international symposium on mathematical programming, Lausanne EPFL
Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms
Proceedings of the 6th International Conference on Genetic Algorithms
A survey of very large-scale neighborhood search techniques
Discrete Applied Mathematics
Constraint-Based Local Search
Synthesis of constraint-based local search algorithms from high-level models
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Local search algorithm for unicost set covering problem
IEA/AIE'06 Proceedings of the 19th international conference on Advances in Applied Artificial Intelligence: industrial, Engineering and Other Applications of Applied Intelligent Systems
Bandit problems and the exploration/exploitation tradeoff
IEEE Transactions on Evolutionary Computation
ISAC --Instance-Specific Algorithm Configuration
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Experiments in parallel constraint-based local search
EvoCOP'11 Proceedings of the 11th European conference on Evolutionary computation in combinatorial optimization
Performance analysis of parallel constraint-based local search
Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming
Targeting the Cell Broadband Engine for constraint-based local search
Concurrency and Computation: Practice & Experience
Constraint-based local search for the costas array problem
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
| Hi-index | 0.00 |
We introduce Hegel and Fichte's dialectic as a search meta-heuristic for constraint satisfaction and optimization. Dialectic is an appealing mental concept for local search as it tightly integrates and yet clearly marks off of one another the two most important aspects of local search algorithms, search space exploration and exploitation. We believe that this makes dialectic search easy to use for general computer scientists and non-experts in optimization. We illustrate dialectic search, its simplicity and great efficiency on four problems from three different problem domains: constraint satisfaction, continuous optimization, and combinatorial optimization.