Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems
Journal of the ACM (JACM)
Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem n/2/F/ F
Journal of the ACM (JACM)
Algorithms for Scheduling Independent Tasks
Journal of the ACM (JACM)
Dynamic Programming
Exact and approximate algorithms for permutation problems
Exact and approximate algorithms for permutation problems
Problem-Solving Methods in Artificial Intelligence
Problem-Solving Methods in Artificial Intelligence
Generalized best-first search strategies and the optimality of A*
Journal of the ACM (JACM)
Learning Dominance Relations in Combined Search Problems
IEEE Transactions on Software Engineering
Efficient Branch-and-Bound Algorithms on a Two-Level Memory System
IEEE Transactions on Software Engineering
A common schema for dynamic programming and branch and bound algorithms
Journal of the ACM (JACM)
Parallel branch and bound algorithms on hypercube multiprocessors
C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
Computational Efficiency of Parallel Combinatorial OR-Tree Searches
IEEE Transactions on Software Engineering
An Efficient Channel Routing Algorithm to Yield an Optimal Solution
IEEE Transactions on Computers
Search Algorithms Under Different Kinds of Heuristics—A Comparative Study
Journal of the ACM (JACM)
Random Trees and the Analysis of Branch and Bound Procedures
Journal of the ACM (JACM)
Enhanced Iterative-Deepening Search
IEEE Transactions on Pattern Analysis and Machine Intelligence
MANIP-a parallel computer system for implementing branch and bound algorithms
ISCA '81 Proceedings of the 8th annual symposium on Computer Architecture
ISCA '84 Proceedings of the 11th annual international symposium on Computer architecture
Data-Dependency Graph Transformations for Instruction Scheduling
Journal of Scheduling
The architecture of MANIP: a parallel computer system for solving NP-complete problems
AFIPS '81 Proceedings of the May 4-7, 1981, national computer conference
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
DD* lite: efficient incremental search with state dominance
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Synthesis of fast programs for maximum segment sum problems
GPCE '09 Proceedings of the eighth international conference on Generative programming and component engineering
Branch & bound formulation for sequential and parallel game tree searching: preliminary results
IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 1
Combining multiple representations in a genetic algorithm for the multiple Knapsack problem
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
INFORMS Journal on Computing
A class of Greedy algorithms and its relation to greedoids
ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
Hi-index | 0.01 |
A dominance relation D is a binary relation defined on the set of partial problems generated in a branch-and-bound algorithm, such that PiDPj (where Pi and Pj are partial problems) implies that Pj can be excluded from consideration without loss of optimality of the given problem if Pi has already been generated when Pj is selected for the test. The branch-and-bound computation is usually enhanced by adding the test based on a dominance relation.A dominance relation D′ is said to be stronger than a dominance relation D if PiDPj always implies PiD′Pj. Although it seems obvious that a stronger dominance relation makes the resulting algorithm more efficient, counterexamples can easily be constructed. In this paper, however, four classes of branch-and-bound algorithms are found in which a stronger dominance relation always gives a more efficient algorithm. This indicates that the monotonicity property of dominance relations would be observed in a rather wide class of branch-and-bound algorithms, thus encouraging the designer of a branch-and-bound algorithm to find the strongest possible dominance relation.