Mathematics – Combinatorics
Scientific paper
2008-12-11
Mathematics
Combinatorics
Scientific paper
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. For the binary case, it is based on defining a neighbourhood of the current incumbent solution by allowing only a few binary variables to flip their value, through the addition of a local branching constraint. The neighbourhood is then explored with a branch-and-bound solver. We propose a local branching scheme for (nonconvex) MINLPs which is based on iteratively solving MILPs and NLPs. Preliminary computational experiments show that this approach is able to improve the incumbent solution on the majority of the test instances, requiring only a short CPU time. Moreover, we provide algorithmic ideas for a primal heuristic whose purpose is to find a first feasible solution, based on the same scheme.
Belotti Pietro
Liberti Leo
Nannicini Giacomo
No associations
LandOfFree
A local branching heuristic for MINLPs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A local branching heuristic for MINLPs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A local branching heuristic for MINLPs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-61037