Results 231 to 240 of about 25,776 (266)

A Branch-and-Bound Algorithm

2000
In this chapter, we describe a branch-and-bound algorithm for the DSP in which to embed the constraint propagation techniques that we have derived in the last chapter. A general introduction to branch-and-bound has been given in section 2.3. As mentioned there, one of the most important components of a branch-and-bound solution method is a branching ...
openaire   +1 more source

Tolerance-based Branch and Bound algorithms for the ATSP

European Journal of Operational Research, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marcel Turkensteen, Diptesh Ghosh, Boris Goldengorin, Gerard Sierksma   +3 more
openaire   +4 more sources

Are Branch and Bound and A* Algorithms Identical?

Journal of Heuristics, 2003
Heuristic Search and Branch and Bound algorithms have many similarities. In this paper, we address the question of the extent to which they are similar. We firstly show that these algorithms apply the same principles, although generating graphs with different properties: Heuristic Search can explore any kind of graphs, whereas the Branch and Bound ...
Labat, Jean-Marc, Pomerol, Jean-Charles
openaire   +2 more sources

Dual bounding procedures lead to convergent Branch–and–Bound algorithms

Mathematical Programming, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +6 more sources

Branch-and-Bound 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 NP-hard in general.
de Bontridder, K.M.J., Lageweg, B.J., Lenstra, J.K., Orlin, J.B., Stougie, L.   +4 more
openaire   +2 more sources

An upper bound for the speedup of parallel best-bound branch-and-bound algorithms

BIT, 1986
This paper derives an upper bound for the speedup obtainable by any parallel branch-and-bound algorithm using the best-bound search strategy. We confirm that parallel branch-and-bound can achieve nearly linear, or even super-linear, speedup under the appropriate conditions.
Michael J. Quinn, Narsingh Deo
openaire   +1 more source

Isolation branching: a branch and bound algorithm for the k-terminal cut problem

Journal of Combinatorial Optimization, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mark Velednitsky, Dorit S. Hochbaum
openaire   +4 more sources

A branch-and-bound algorithm for the acyclic partitioning problem

Computers & Operations Research, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jenny Nossack, Erwin Pesch
openaire   +3 more sources

Computational Efficiency of Approximate Branch-and-Bound Algorithms

Mathematics of Operations Research, 1976
To improve the computational efficiency of a branch-and-bound algorithm at the sacrifice of obtaining an optimal solution, the lower bound test is sometimes strengthened beyond its limit, i.e., a partial problem Pi is terminated if g(Pi) ≥ z − ϵ(z) (instead of g(Pi) ≥ z), where g(Pi) is a lower bound of Pi, z is the current incumbent value and ϵ(z ...
openaire   +1 more source

The Power of Dominance Relations in Branch-and-Bound Algorithms

Journal of the ACM, 1977
A dominance relation D is a binary relation defined on the set of partial problems generated in a branch-and-bound algorithm, such that P i DP j (where P i ...
openaire   +3 more sources