A local branching heuristic for MINLPs
, 2008 Local branching is an improvement heuristic, developed within the context of branch-and-bound algorithms for MILPs, which has proved to be very effective in practice.
Belotti, Pietro +2 more
core +1 more source
A branch-and-bound algorithm for the exact optimal experimental design problem
Statistics and computing, 2021 S. Ahipaşaoğlu
semanticscholar +1 more source
Exact algorithms for procurement problems under a total quantity discount structure. [PDF]
In this paper, we study the procurement problem faced by a buyer who needs to purchase a variety of goods from suppliers applying a so-called total quantity discount policy.
Goossens, Dries +3 more
core
Adapting Branching and Queuing for Multi-objective Branch and Bound
Branch and bound algorithms have to cope with several additional difficulties in the multi-objective case. Not only the bounding procedure is considerably weaker, but also the handling of upper and lower bound sets requires much more computational effort since both sets can be of exponential size. Thus, the order in which the subproblems are considered
Julius Bauß, Michael Stiglmayr
openaire +2 more sources
Iterative Deepening Branch and Bound
, 1999 39 html pages + 4 gif files (fig1,fig1(a),fig2,fig3)
Mohanty, S., Behera, R. N.
openaire +2 more sources
PhISCS-BnB: a fast branch and bound algorithm for the perfect tumor phylogeny reconstruction problem. [PDF]
Bioinformatics, 2020 Sadeqi Azer E +16 more
europepmc +1 more source
A Lower Bound for Minimizing Waiting Time in Coexisting Virtual and Physical Worlds
IEEE AccessTo balance customer satisfaction across virtual and real-world interactions, we focus on enhancing service for dine-in customers at restaurants that typically prioritize online orders, such as those on Uber Eats.
Yu-Chuan Chen, Jen-Ya Wang
doaj +1 more source
A Branch-and-Bound Framework for Unsupervised Common Event Discovery. [PDF]
Int J Comput Vis, 2017 Chu WS +3 more
europepmc +1 more source
Monitoring ratio of carbon to nitrogen (C/N) in wheat and barley leaves by using spectral slope features with branch-and-bound algorithm. [PDF]
Sci Rep, 2018 Xu X +6 more
europepmc +1 more source
BBK* (Branch and Bound Over K*): A Provable and Efficient Ensemble-Based Protein Design Algorithm to Optimize Stability and Binding Affinity Over Large Sequence Spaces. [PDF]
J Comput Biol, 2018 Ojewole AA +3 more
europepmc +1 more source