Results 261 to 270 of about 204,066 (330)
Some of the next articles are maybe not open access.
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
Multiple stack branch and bound
Information Processing Letters, 1991zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sarkar, U. K. +3 more
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
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
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
Multi-View Global 2D-3D Registration Based on Branch and Bound Algorithm
IEEE International Conference on Robotics and Biomimetics, 2019In image-guided minimally invasive surgery, the clinician relies on image guidance to observe, plan and navigate. In order to show invisible vessels or planning annotations in live X-ray images, or update the live information for planning, the ...
Jin Pan +4 more
semanticscholar +1 more source