Branch and Bound — Introduction Prior to Coding the Algorithm From Scratch

Author(s): Francis Adrian Viernes

Originally published on Towards AI.

An Introduction to Integer Problems and One of The Ways to Solve Them
Photo by Possessed Photography on Unsplash

Integer programming (IP) is a special case of linear programming (LP) where the decision variables are restricted to integer values. That is, values such as 2.5 or 4.2 are not possible solutions to these problems.

This requirement is treated as an additional constraint to the LP and in turn, makes the process of finding the optimum more challenging.

In real life, a lot of the problems we have take on the form of IP. For example, capital budgeting and allocation, where we decide which investments to make require the decision variables to be binary and take on… Read the full blog for free on Medium.

Join thousands of data leaders on the AI newsletter. Join over 80,000 subscribers and keep up to date with the latest developments in AI. From research to projects and ideas. If you are building an AI startup, an AI-related product, or a service, we invite you to consider becoming a sponsor.

Published via Towards AI