Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems
Journal of the ACM (JACM)
Computing Partitions with Applications to the Knapsack Problem
Journal of the ACM (JACM)
The Power of Dominance Relations in Branch-and-Bound Algorithms
Journal of the ACM (JACM)
Optimizing decision trees through heuristically guided search
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Algorithms for the solution of the optimal cost and bottle-neck travelingsalesman problems.
Algorithms for the solution of the optimal cost and bottle-neck travelingsalesman problems.
Coping with anomalies in parallel branch-and-bound algorithms
IEEE Transactions on Computers - The MIT Press scientific computation series
The average complexity of depth-first search with backtracking and cutoff
IBM Journal of Research and Development
Efficient Branch-and-Bound Algorithms on a Two-Level Memory System
IEEE Transactions on Software Engineering
A Randomized Parallel Backtracking Algorithm
IEEE Transactions on Computers
Computational Efficiency of Parallel Combinatorial OR-Tree Searches
IEEE Transactions on Software Engineering
Scalable Global and Local Hashing Strategies for Duplicate Pruning in Parallel A* Graph Search
IEEE Transactions on Parallel and Distributed Systems
Evaluation of a Parallel Branch-and-Bound Algorithm on a Class of Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
On multiprocessor task scheduling using efficient state space search approaches
Journal of Parallel and Distributed Computing
Information Sciences: an International Journal
MANIP A Multicomputer Architecture for Solving Combinatonal Extremum-Search Problems
IEEE Transactions on Computers
Preprocessing strategy for effective modulo scheduling on multi-issue digital signal processors
CC'07 Proceedings of the 16th international conference on Compiler construction
An average-case analysis of branch-and-bound with applications: summary of results
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Instruction re-selection for iterative modulo scheduling on high performance multi-issue DSPs
EUC'06 Proceedings of the 2006 international conference on Emerging Directions in Embedded and Ubiquitous Computing
Modeling of uplink power control for cognitive radio networks: Cooperative and noncooperative
Mathematical and Computer Modelling: An International Journal
A note on the complexity of the asymmetric traveling salesman problem
Operations Research Letters
| Hi-index | 0.01 |