Results 1  10
of
4,977
Visualizing BranchandBound Algorithms
"... We present a suite of tools for visualizing the status and progress of branchandbound algorithms for mixed integer programming. By integrating these tools with the opensource codes CBC, SYMPHONY, and GLPK, we demonstrate the potential usefulness of visual representations in helping a user predict ..."
Abstract
 Add to MetaCart
We present a suite of tools for visualizing the status and progress of branchandbound algorithms for mixed integer programming. By integrating these tools with the opensource codes CBC, SYMPHONY, and GLPK, we demonstrate the potential usefulness of visual representations in helping a user
Anomalies in Parallel BranchandBound Algorithms
, 1984
"... We consider the effects of parallelizing branchandbound algorithms by expanding several live nodes simultaneously. It is shown that it is quite possible for a parallel branchandbound algorithm using n 2 processors to take more time than one using n 1 processors even though n 1 < n 2 . Further ..."
Abstract

Cited by 67 (3 self)
 Add to MetaCart
We consider the effects of parallelizing branchandbound algorithms by expanding several live nodes simultaneously. It is shown that it is quite possible for a parallel branchandbound algorithm using n 2 processors to take more time than one using n 1 processors even though n 1 < n 2
Simple and Fast: Improving a BranchandBound Algorithm for Maximum Clique
 In 10th Annual European Symposium on Algorithms (ESA 2002), volume 2461 of LNCS
, 2002
"... We consider a branchandbound algorithm for maximum clique problems. ..."
Abstract

Cited by 23 (0 self)
 Add to MetaCart
We consider a branchandbound algorithm for maximum clique problems.
Constrained branchandbound algorithm for image registration *
, 2005
"... Abstract: In this paper, the authors propose a refined BranchandBound algorithm for affinetransformation based image registration. Given two feature pointsets in two images respectively, the authors first extract a sequence of highprobability matched pointpairs by considering welldefined feat ..."
Abstract
 Add to MetaCart
Abstract: In this paper, the authors propose a refined BranchandBound algorithm for affinetransformation based image registration. Given two feature pointsets in two images respectively, the authors first extract a sequence of highprobability matched pointpairs by considering well
Initialization of Parallel Branchandbound Algorithms
, 1994
"... Four different initialization methods for parallel Branchandbound algorithms are described and compared with reference to several criteria. A formal analysis of their idle times and efficiency follows. It indicates that the efficiency of three methods depends on the branching factor of the search ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
Four different initialization methods for parallel Branchandbound algorithms are described and compared with reference to several criteria. A formal analysis of their idle times and efficiency follows. It indicates that the efficiency of three methods depends on the branching factor of the search
BranchandBound Algorithms for the Test Cover Problem
, 2002
"... In the test cover problem a set of items is given together with a collection of subsets of the items, called tests. A smallest subcollection of tests is to be selected such that for every pair of items there is a test in the selection that contains exactly one of the two items. This problem is NPh ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
hard in general. It has important applications in biology, pharmacy, and the medical sciences, as well as in coding theory. We develop a variety of branchandbound algorithms to solve the problem to optimality. The variety is in the definition of the branching rules and the lower bounds to prune the search tree
Control Schemes in a Generalized Utility for Parallel BranchandBound Algorithms
 Proceedings of the 1997 Eleventh International Parallel Processing Symposium, IEEE Computer Society Press, Los Alamitos, CA
, 1997
"... Branchandbound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these algorithms. Parallel branchandbound algorithm implementations can be divided in two types based on whether a central or ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
Branchandbound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these algorithms. Parallel branchandbound algorithm implementations can be divided in two types based on whether a central
An Interface Design for General Parallel BranchandBound Algorithms
"... . BranchandBound algorithms are general methods applicable to various combinatorial optimization problems. There are two hopeful methods to improve the algorithms. One is development of the algorithms which exploit the structure of each problem. The other is parallelization of the algorithms. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
. BranchandBound algorithms are general methods applicable to various combinatorial optimization problems. There are two hopeful methods to improve the algorithms. One is development of the algorithms which exploit the structure of each problem. The other is parallelization of the algorithms
Learning to Search in BranchandBound Algorithms∗
"... Branchandbound is a widely used method in combinatorial optimization, including mixed integer programming, structured prediction and MAP inference. While most work has been focused on developing problemspecific techniques, little is known about how to systematically design the node searching str ..."
Abstract
 Add to MetaCart
strategy on a branchandbound tree. We address the key challenge of learning an adaptive node searching order for any class of problem solvable by branchandbound. Our strategies are learned by imitation learning. We apply our algorithm to linear programming based branchandbound for solving mixed
Results 1  10
of
4,977