Results 161 to 170 of about 915,013 (232)
Some of the next articles are maybe not open access.
FAST DETERMINISTIC PARALLEL BRANCH-AND-BOUND
Parallel Processing Letters, 1999The branch-and-bound problem involves determining the minimum cost leaf in a cost-labelled tree, subject to the constraint that only the root is known initially and that children are revealed only by visiting thier parent. We present the first efficient deterministic algorithm to solve the branch-and-bound problem for a tree T of constant degree on a ...
HERLEY K. T. +2 more
openaire +2 more sources
A Branch and Bound Clustering Algorithm
IEEE Transactions on Computers, 1975The problem of clustering N objects into M classes may be viewed as a combinatorial optimization algorithm. In the literature on clustering, iterative hill-climbing techniques are used to find a locally optimum classification. In this paper, we develop a clustering algorithm based on the branch and bound method of combinatorial optimization.
Koontz, Warren L. G. +2 more
openaire +2 more sources
Juniper: An Open-Source Nonlinear Branch-and-Bound Solver in Julia
Integration of AI and OR Techniques in Constraint Programming, 2018Nonconvex mixed-integer nonlinear programs (MINLPs) represent a challenging class of optimization problems that often arise in engineering and scientific applications.
Ole Kröger +3 more
semanticscholar +1 more source
Sparse Branch and Bound for Exact Optimization of L0-Norm Penalized Least Squares
IEEE International Conference on Acoustics, Speech, and Signal Processing, 2020We propose a global optimization approach to solve ℓ0-norm penalized least-squares problems, using a dedicated branch-and-bound methodology. A specific tree search strategy is built, with branching rules inspired from greedy exploration techniques.
Ramzi Ben Mhenni +4 more
semanticscholar +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
Resolution Search and Dynamic Branch-and-Bound
Journal of Combinatorial Optimization, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hanafi, Saïd, Glover, Fred
openaire +1 more source
1984
A solution technique for discrete optimisation problems which is widely used outside Al and is closely related to the A* algorithm . The task is to find the optimally valued tip of a walkable search tree. A subtree of the search tree need not be searched if a computation at its root yields a bound for its set of tip values which implies that none of ...
Alan Bundy, Lincoln Wallen
openaire +1 more source
A solution technique for discrete optimisation problems which is widely used outside Al and is closely related to the A* algorithm . The task is to find the optimally valued tip of a walkable search tree. A subtree of the search tree need not be searched if a computation at its root yields a bound for its set of tip values which implies that none of ...
Alan Bundy, Lincoln Wallen
openaire +1 more source
MIXED μ PROBLEMS AND BRANCH AND BOUND TECHNIQUES
International Journal of Robust and Nonlinear Control, 1997The paper presents efficacy of branch-and-bound algorithms applied to solve the general structured singular value problem. The authors suggest the use of the branch-and-bound techniques for such problems in which the standard bounds are poor. On the other hand, the examples which they consider show that these methods are useful only when branch-and ...
Newlin, Matthew P., Young, Peter M.
openaire +2 more sources
Integer Programming, 2020
Production planning is one that must be owned by the company because with the production planning so that the optimal production amount and maximum revenue. Due to the increasing competition, the appropriate strategy is required externally or internally.
Linda Nur’aini, F. Badruzzaman
semanticscholar +1 more source
Production planning is one that must be owned by the company because with the production planning so that the optimal production amount and maximum revenue. Due to the increasing competition, the appropriate strategy is required externally or internally.
Linda Nur’aini, F. Badruzzaman
semanticscholar +1 more source
Optimization, 1985
The context describes a method for solving integer programming problems. Using branch and bound the solution of a problem is transformed into the solution of a series of problems, which belong to the same recursive class like the problem being solved. To determine series of bounds special types of the recursive strategy can be given.
openaire +1 more source
The context describes a method for solving integer programming problems. Using branch and bound the solution of a problem is transformed into the solution of a series of problems, which belong to the same recursive class like the problem being solved. To determine series of bounds special types of the recursive strategy can be given.
openaire +1 more source