Results 1 to 10 of about 915,013 (232)
Quantum speedup of branch-and-bound algorithms [PDF]
Physical Review Research, 2020 Branch-and-bound is a widely used technique for solving combinatorial optimization problems where one has access to two procedures: a branching procedure that splits a set of potential solutions into subsets, and a cost procedure that determines a lower ...
Ashley Montanaro
doaj +2 more sources
A General Scheme of a Branch-and-Bound Approach for the Sensor Selection Problem in Near-Field Broadband Beamforming [PDF]
SensorsThis paper is devoted to the sensor selection problem. A broadband receiver beamforming working in a near-field is considered. The system response should be as close as possible to the desired one, which is optimized in the sense of L2 norm.
Agnieszka Wielgus, Bogusław Szlachetko
doaj +2 more sources
Complete Verification via Multi-Neuron Relaxation Guided Branch-and-Bound [PDF]
International Conference on Learning Representations, 2022 State-of-the-art neural network verifiers are fundamentally based on one of two paradigms: either encoding the whole verification problem via tight multi-neuron convex relaxations or applying a Branch-and-Bound (BaB) procedure leveraging imprecise but ...
Claudio Ferrari +3 more
semanticscholar +1 more source
A Branch-and-Bound approach for tautomer enumeration [PDF]
Journal of Cheminformatics, 2010 Thalheim Torsten +3 more
doaj +2 more sources
Parameterizing Branch-and-Bound Search Trees to Learn Branching Policies [PDF]
AAAI Conference on Artificial Intelligence, 2020 Branch and Bound (B&B) is the exact tree search method typically used to solve Mixed-Integer Linear Programming problems (MILPs). Learning branching policies for MILP has become an active research area, with most works proposing to imitate the strong ...
Giulia Zarpellon +3 more
semanticscholar +1 more source
A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts
European Journal of Operational Research, 2021 We study the Knapsack Problem with Conflicts, a generalization of the Knapsack Problem in which a set of conflicts specifies pairs of items which cannot be simultaneously selected. In this work, we propose a novel combinatorial branch-and-bound algorithm
Stefano Coniglio +2 more
semanticscholar +1 more source
An Efficient Branch-and-Bound Solver for Hitting Set [PDF]
Workshop on Algorithm Engineering and Experimentation, 2021 The hitting set problem asks for a collection of sets over a universe $U$ to find a minimum subset of $U$ that intersects each of the given sets. It is NP-hard and equivalent to the problem set cover. We give a branch-and-bound algorithm to solve hitting
Thomas Bläsius +3 more
semanticscholar +1 more source
Combining Clause Learning and Branch and Bound for MaxSAT
International Conference on Principles and Practice of Constraint Programming, 2022 Branch and Bound (BnB) has been successfully used to solve many combinatorial optimization problems. However, BnB MaxSAT solvers perform poorly when solving real-world and academic optimization problems.
Chu Min Li +5 more
semanticscholar +1 more source
Compressing branch-and-bound trees
Mathematical Programming, 2023 A short version of this article was accepted for publication at IPCO 2023. This extended version contains more detailed discussions and proofs, and new computational contributions and ...
Gonzalo Muñoz +2 more
openaire +3 more sources
Algorithms based on Branch and Bound for the Flying Sidekick Traveling Salesman Problem
, 2021 The use of drones in urban logistics is gaining more and more interest. In this paper we consider the flying sidekick traveling salesman problem, where some customers require a delivery and they can be served either by a truck or by a drone.
M. dell’Amico +2 more
semanticscholar +1 more source