Best-so-far vs. where-you-are: implications for optimal finite-time annealing
Systems & Control Letters
A probability-based approach to VLSI circuit partitioning
DAC '96 Proceedings of the 33rd annual Design Automation Conference
Greedy, Prohibition, and Reactive Heuristics for Graph Partitioning
IEEE Transactions on Computers
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Improved Large-Step Markov Chain Variants for the Symmetric TSP
Journal of Heuristics
A Fast and Robust Network Bisection Algorithm
IEEE Transactions on Computers
Genetic Algorithm and Graph Partitioning
IEEE Transactions on Computers
Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms
Proceedings of the 6th International Conference on Genetic Algorithms
Memetic Algorithms and the Fitness Landscape of the Graph Bi-Partitioning Problem
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Local Optimization and the Traveling Salesman Problem
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
A linear-time heuristic for improving network partitions
DAC '82 Proceedings of the 19th Design Automation Conference
Lock-Gain Based Graph Partitioning
Journal of Heuristics
A bivariate probabilistic model-building genetic algorithm for graph bipartitioning
Proceedings of the 10th annual conference companion on Genetic and evolutionary computation
An Enzyme-Inspired Approach to Surmount Barriers in Graph Bisection
ICCSA '08 Proceeding sof the international conference on Computational Science and Its Applications, Part I
How the landscape of random job shop scheduling instances depends on the ratio of jobs to machines
Journal of Artificial Intelligence Research
Genetic approaches for graph partitioning: a survey
Proceedings of the 13th annual conference on Genetic and evolutionary computation
| Hi-index | 0.00 |
The ore selection problem involves choosing a processing option for a number of mining blocks that maximises the expected payoff for a given level of financial risk. An innovative neighbourhood search heuristic is proposed for the ore selection problem. ...