Results 321 to 330 of about 244,573 (375)
Some of the next articles are maybe not open access.
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
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
Computational Efficiency of Approximate Branch-and-Bound Algorithms
Mathematics of Operations Research, 1976To 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
An asynchronous parallel branch‐and‐bound algorithm
Systems and Computers in Japan, 1992AbstractThis paper presents a parallel branch‐and‐bound algorithm which is applicable to a loosely coupled multiprocessor with nonhierarchical interconnection network such as torus or hypercube. This algorithm is asynchronous and processing elements (PEs) start evaluation of nodes without being synchronized.
Tsuyoshi Kawaguchi +2 more
openaire +1 more source
Electric power components and systems, 2019
This study presents an algorithmic approach for optimal placement of phasor measurements units (PMUs) to ensure complete observability in the presence of conventional measurements and zero injection buses. The financial or technical restrictions prohibit
Nikolaos P. Theodorakatos
semanticscholar +1 more source
This study presents an algorithmic approach for optimal placement of phasor measurements units (PMUs) to ensure complete observability in the presence of conventional measurements and zero injection buses. The financial or technical restrictions prohibit
Nikolaos P. Theodorakatos
semanticscholar +1 more source
Results for the close-enough traveling salesman problem with a branch-and-bound algorithm
Computational optimization and applications, 2023Wenda Zhang +2 more
semanticscholar +1 more source
A Branch and Bound Algorithm for a Fractional 0-1 Programming Problem
International Conference on Discrete Optimization and Operations Research, 2016We consider a fractional 0-1 programming problem arising in manufacturing. The problem consists in clustering of machines together with parts processed on these machines into manufacturing cells so that intra-cell processing of parts is maximized and ...
I. Utkina, Mikhail V. Batsyn, E. Batsyna
semanticscholar +1 more source
Fault-Tolerant Mechanism for Hierarchical Branch and Bound Algorithm
2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum, 2011Solving exactly large instances of Combinatorial Optimization Problems emph{(COPs)} using Branch and Bound emph{(B&B) }algorithms requires a huge amount of computing resources. These resources can be offered by computational grids and the scalability can be achieved using Hierarchical Master/Worker-based B&B pushing the limits of the traditional Master/
Bendjoudi, Ahcène +2 more
openaire +2 more sources
The geometric branch-and-bound algorithm
2011The aim of this chapter is the presentation of the fundamental geometric branch-and-bound algorithm including a general convergence theory. To this end, we start with a literature review of these approaches and their applications to facility location problems in Section 2.1.
openaire +1 more source
An Outcome-Space-Based Branch-and-Bound Algorithm for a Class of Sum-of-Fractions Problems
Journal of Optimization Theory and Applications, 2022Bo Zhang +3 more
semanticscholar +1 more source
A Branch and Bound Algorithm for Numerical MAX-CSP
Constraints, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Normand, Jean-Marie +3 more
openaire +4 more sources