A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
Estimated time scheduling algorithm paralleling by using modifications of the branch and bound method is directly proportional to the number of vertices of a bipartite graph (which is equal to the sum ... For the matching problem with vanishing arcs, an optimal algorithm based on the branch and bound method was developed to find the maximum matching in a bipartite graph  . ... It should be noted that for the branch and bound method the branching procedure and the procedure for finding the upper and lower bounds have the greatest difficulty. ...doi:10.21303/2461-4262.2017.00305 fatcat:qq2avormwzgqrm6swpc2doxe4i
by a branch and bound-based strategy. ... Since a large number of problems created by branching at interme- diate nodes have no feasible solution or large lower bound, the procedure is reasonably efficient. ...
We present improvements to branch and bound techniques for globally optimizing functions with Lipschitz continuity properties by developing novel bounding procedures and parallelisation strategies. ... As the nonconvex lower bounds are only tractable if solved over Euclidean balls, we implement them in the context of a recent branch and bound algorithm (Fowkes et al., 2013) that uses overlapping balls ... Acknowledgements The work of the first and second authors was supported by EPSRC grants EP/I028854/1 and NAIS EP/G036136/1 and the work of the third author by EP/I013067/1. ...doi:10.1007/s10898-014-0199-6 fatcat:zlh3skhhffe6ldbg3yd2pajn6y
; (5) Parallel branch and bound algorithms; (6) parallel cutting plane algorithms; (7) Transforming matrices to a special form; (8) Short information on ALGOL-procedures. ... Paralleling approximate methods follows a sim- ilar scheme as in the branch and bound method. ...
We implement two different parallel branch-and-bound algorithms for JSS on a 16-processor MEIKO computing surface with Intel i860 proces- sors and perform extensive computational testing using classical ... The only successful approach has been branch-and-bound based al- gorithms, but such algorithms depend heavily on good bound functions. ...
Journal of the ACM
Universal randomized methods for parallelizing sequential backtrack search and branch-and-bound computation are presented. ... For branch-and-bound computation, it is shown that, uniformly on all instances, the execution time of this method is unlikely to exceed a certain inherent lower bound by more than a constant factor. ... The fundamental ingredients of a branch-and-bound method are a branching procedure and a bounding procedure. ...doi:10.1145/174130.174145 fatcat:4bdc4bgqlrfqvbokn6omkdrdae
., a genetic algorithm, a tabu search algorithm and a hybridization of these heuristics with a truncated branch-and-bound procedure. ... The branchand-bound procedure will check whether the solutions obtained by the meta-heuristics can be scheduled within a tight upper bound. ... An interesting field of future research could be to develop an exact branch-and-bound procedure, relying on the knowledge obtained by the truncated branch-and-bound procedure, and to benchmark this procedure ...doi:10.1016/j.cor.2014.08.002 fatcat:r72li4mhufeylpjxp2utdiozgm
In this paper, we analyze the parallel performance of several classes of state space search applications. ... Moreover, we tackle the problem of programmer productivity by incorporating these techniques into a general search engine framework designed to solve a broad class of state space search problems. ... Acknowledgments This work was supported in part by NSF grant OCI-0725070 for Blue Waters deployment and NSF grant ITR-HECURA-0833188, by the Institute for Advanced Computing Applications and Technologies ...doi:10.1142/s0129626411000242 fatcat:nqdtfz46qzal5mv3kxpzypirui
Scheduling surgeries for a single surgeon operating in two parallel operating rooms (ORs) motivates the work. ... We develop algorithms for a stochastic two-machine single-server sequencing problem with waiting time, idle time and overtime costs. ... Batun et al. (2010) consider a model where surgical procedures are also composed of random setup, surgery and cleanup times with known distributions. ...doi:10.1080/19488300.2013.787563 fatcat:u6jamqditjauvmpdk3i4zhg6n4
Lecture Notes in Computer Science
In this paper we present a probabilistic model for analysing trees generated during problem solving using best-rst search Branch and Bound algorithm. ... We consider the weight associated with the edges as well as the number of children in a node to be random. ... There are four fundamental ingredients for a BB method: branching rule, bounding procedure, selection rule and termination test. ...doi:10.1007/3-540-63138-0_5 fatcat:qekq3pcfmrcrjh74vwo3omiq6y
We solve this problem exactly using a parallel branch-and-bound procedure. The resulting rule-enhanced regression method is computation-intensive, but has promising prediction performance. ... We describe a procedure enhancing L 1 -penalized regression by adding dynamically generated rules describing multidimensional "box" sets. ... We solve the RMA problem by a similar branch-and-bound method procedure, implemented using parallel computing techniques. ...dblp:conf/icml/EcksteinGK17 fatcat:jhqknx5yqnbe7bkpzfdqe63heu
Eighth International Conference on High-Performance Computing in Asia-Pacific Region (HPCASIA'05)
In this paper, we present an efficient parallel branch and bound algorithm to construct a minimum ultrametric tree with less cost. ... It is shown that to construct a minimum cost ultrametric tree is NP-hard. ... The parallel branch-and-bound algorithm in the master-slave paradigm is presented as follows. Table 1 Parallel Branch-and-Bound with 3-3 Relationship Input: An n x n distance matrix M. ...doi:10.1109/hpcasia.2005.65 fatcat:adexj3gjx5ak5e4msrtvkawgl4
We are interested in the exact solution of the problem: an improved version of a branch-and-cut algorithm is proposed. ... Extensive computational experiments are carried out on a set of instances from three applications previously discussed in the literature as well as on a set of random instances. ... the branch-and-bound tree. ...arXiv:1312.4345v1 fatcat:zhhle6c5lzhb3jhxlhpvag6hqa
We research how to apply several typical algorithms to solve the resulted combinatorial optimization problem: enumeration including branch-and-bound method, gradient algorithm, random search technique. ... The transformation of the original problem into combinatorial setting is based on interpreting each operation as an atomic entity that has a defined duration and has to be resided on the continuous time ... algorithms, performed the experiments and analyzed the data. ...doi:10.3390/a11040050 fatcat:f7sbtpkmt5a3rpra5ms7oasmai
A performance analysis of both serial and parallel versions of the algorithm is given, and related results of solving test problems are discussed. ... A random search algorithm intended to solve discrete optimization problems is considered. We outline the main components of the algorithm, and then describe it in more detail. ... The BPB approach actually combines the usual branch and bound search scheme with statistical procedures of parameter estimation based on random sampling. ...arXiv:1212.6053v2 fatcat:j7s556nx7zc5np37cseqbgci4e
« Previous Showing results 1 — 15 out of 92,641 results