branch and bound search
Recently Published Documents


TOTAL DOCUMENTS

51
(FIVE YEARS 1)

H-INDEX

11
(FIVE YEARS 0)

Author(s):  
Jie Su ◽  
Jun Li

The location social network generates a large amount of data; these dada reflect the user's preferences and the popularity of the route, and a new model is provided for travel route search. Based on this demand, a problem of local distributed travel route search is proposed for group users. In this problem, the personal preferences of group users are combined, and an access route is found with partial POI (point of interest) and the largest group profit. The check-in data are used to generate a POI transfer relationship diagram based on the user's transfer between POIs, and route search is performed on the relationship diagram. In order to improve the search efficiency, a two-layer transfer relationship diagram is designed according to the popularity and transfer relationship of POI, the POI is generalized, and a hierarchical query is realized. A branch and bound search strategy optimization algorithm is designed, and the control relationship between nodes is used for pruning; the search efficiency of the algorithm is further improved.


2020 ◽  
Vol 34 (04) ◽  
pp. 3146-3153
Author(s):  
Gaël Aglin ◽  
Siegfried Nijssen ◽  
Pierre Schaus

Several recent publications have studied the use of Mixed Integer Programming (MIP) for finding an optimal decision tree, that is, the best decision tree under formal requirements on accuracy, fairness or interpretability of the predictive model. These publications used MIP to deal with the hard computational challenge of finding such trees. In this paper, we introduce a new efficient algorithm, DL8.5, for finding optimal decision trees, based on the use of itemset mining techniques. We show that this new approach outperforms earlier approaches with several orders of magnitude, for both numerical and discrete data, and is generic as well. The key idea underlying this new approach is the use of a cache of itemsets in combination with branch-and-bound search; this new type of cache also stores results for parts of the search space that have been traversed partially.


Author(s):  
Emmanuel Hebrard ◽  
George Katsirelos

Graph coloring is a major component of numerous allocation and scheduling problems. We introduce a hybrid CP/SAT approach to graph coloring based on exploring Zykov’s tree: for two non-neighbors, either they take a different color and there might as well be an edge between them, or they take the same color and we might as well merge them. Branching on whether two neighbors get the same color yields a symmetry-free tree with complete graphs as leaves, which correspond to colorings of the original graph. We introduce a new lower bound for this problem based on Mycielskian graphs; a method to produce a clausal explanation of this bound for use in a CDCL algorithm; and a branching heuristic emulating Brelaz on the Zykov tree. The combination of these techniques in a branch- and-bound search outperforms Dsatur and other SAT-based approaches on standard benchmarks both for finding upper bounds and for proving lower bounds.


Author(s):  
Daniel Anderson ◽  
Gregor Hendel ◽  
Pierre Le Bodic ◽  
Merlin Viernickel

We propose a simple and general online method to measure the search progress within the Branch-and-Bound algorithm, from which we estimate the size of the remaining search tree. We then show how this information can help solvers algorithmically at runtime by designing a restart strategy for MixedInteger Programming (MIP) solvers that decides whether to restart the search based on the current estimate of the number of remaining nodes in the tree. We refer to this type of algorithm as clairvoyant. Our clairvoyant restart strategy outperforms a state-of-the-art solver on a large set of publicly available MIP benchmark instances. It is implemented in the MIP solver SCIP and will be available in future releases.


Author(s):  
YooJung Choi ◽  
Guy Van den Broeck

This paper considers the problem of removing costly features from a Bayesian network classifier. We want the classifier to be robust to these changes, and maintain its classification behavior. To this end, we propose a closeness metric between Bayesian classifiers, called the expected classification agreement (ECA). Our corresponding trimming algorithm finds an optimal subset of features and a new classification threshold that maximize the expected agreement, subject to a budgetary constraint. It utilizes new theoretical insights to perform branch-and-bound search in the space of feature sets, while computing bounds on the ECA. Our experiments investigate both the runtime cost of trimming and its effect on the robustness and accuracy of the final classifier.


2018 ◽  
Vol 113 ◽  
pp. 92-114 ◽  
Author(s):  
Blair Archibald ◽  
Patrick Maier ◽  
Ciaran McCreesh ◽  
Robert Stewart ◽  
Phil Trinder

Sign in / Sign up

Export Citation Format

Share Document