Improving the filtering of Branch-And-Bound MDD solver (extended)

04/24/2021
by   Xavier Gillard, et al.
0

This paper presents and evaluates two pruning techniques to reinforce the efficiency of constraint optimization solvers based on multi-valued decision-diagrams (MDD). It adopts the branch-and-bound framework proposed by Bergman et al. in 2016 to solve dynamic programs to optimality. In particular, our paper presents and evaluates the effectiveness of the local-bound (LocB) and rough upper-bound pruning (RUB). LocB is a new and effective rule that leverages the approximate MDD structure to avoid the exploration of non-interesting nodes. RUB is a rule to reduce the search space during the development of bounded-width-MDDs. The experimental study we conducted on the Maximum Independent Set Problem (MISP), Maximum Cut Problem (MCP), Maximum 2 Satisfiability (MAX2SAT) and the Traveling Salesman Problem with Time Windows (TSPTW) shows evidence indicating that rough-upper-bound and local-bound pruning have a high impact on optimization solvers based on branch-and-bound with MDDs. In particular, it shows that RUB delivers excellent results but requires some effort when defining the model. Also, it shows that LocB provides a significant improvement automatically; without necessitating any user-supplied information. Finally, it also shows that rough-upper-bound and local-bound pruning are not mutually exclusive, and their combined benefit supersedes the individual benefit of using each technique.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/22/2022

Branch-and-Bound with Barrier: Dominance and Suboptimality Detection for DD-Based Branch-and-Bound

The branch-and-bound algorithm based on decision diagrams introduced by ...
research
08/19/2019

WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track

We present the winning solver of the PACE 2019 Implementation Challenge,...
research
11/23/2019

Smoothed complexity of local Max-Cut and binary Max-CSP

We show that the smoothed complexity of the FLIP algorithm for local Max...
research
01/30/2020

Hybridization of interval methods and evolutionary algorithms for solving difficult optimization problems

Reliable global optimization is dedicated to finding a global minimum in...
research
05/25/2023

Smoothed Complexity of SWAP in Local Graph Partitioning

We give the first quasipolynomial upper bound ϕ n^polylog(n) for the smo...
research
12/21/2022

A Projected Upper Bound for Mining High Utility Patterns from Interval-Based Event Sequences

High utility pattern mining is an interesting yet challenging problem. T...
research
11/19/2017

BPGrad: Towards Global Optimality in Deep Learning via Branch and Pruning

Understanding the global optimality in deep learning (DL) has been attra...

Please sign up or login with your details

Forgot password? Click here to reset