Lecture

Exact methods: Branch and Bound

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Description

This lecture discusses the Branch and Bound algorithm in discrete optimization, which tackles the challenge of exploring a vast set of feasible solutions by dividing it into smaller subsets and selecting the best solution. The algorithm efficiently finds optimal solutions by calculating lower bounds on subsets, avoiding the need to solve all sub-problems exactly. By leveraging these lower bounds, the Branch and Bound algorithm proves optimality without solving every sub-problem, making it particularly useful for large feasible sets. In the context of mixed integer linear problems, lower bounds can be computed by solving the relaxation problem using the simplex algorithm.

In MOOC

Optimization: principles and algorithms - Network and discrete optimization

Introduction to the mathematical concept of networks, and to two important optimization problems on networks: the transshipment problem and the shortest path problem. Short introduction to the modeling power of discrete optimization, with reference to classical problems. Introduction to the branch and bound algorithm, and the concept of cuts.

Official source

Ontological neighbourhood

Theoretical computer science

Algorithms and data structures: Combinatorial optimization

Related concepts (19)

Optimization problem

In mathematics, computer science and economics, an optimization problem is the problem of finding the best solution from all feasible solutions. Optimization problems can be divided into two categories, depending on whether the variables are continuous or discrete: An optimization problem with discrete variables is known as a discrete optimization, in which an object such as an integer, permutation or graph must be found from a countable set.

Integer programming

An integer programming problem is a mathematical optimization or feasibility program in which some or all of the variables are restricted to be integers. In many settings the term refers to integer linear programming (ILP), in which the objective function and the constraints (other than the integer constraints) are linear. Integer programming is NP-complete. In particular, the special case of 0-1 integer linear programming, in which unknowns are binary, and only the restrictions must be satisfied, is one of Karp's 21 NP-complete problems.

Branch and bound

Branch and bound (BB, B&B, or BnB) is a method for solving optimization problems by breaking them down into smaller sub-problems and using a bounding function to eliminate sub-problems that cannot contain the optimal solution. It is an algorithm design paradigm for discrete and combinatorial optimization problems, as well as mathematical optimization. A branch-and-bound algorithm consists of a systematic enumeration of candidate solutions by means of state space search: the set of candidate solutions is thought of as forming a rooted tree with the full set at the root.

Feasible region

In mathematical optimization, a feasible region, feasible set, search space, or solution space is the set of all possible points (sets of values of the choice variables) of an optimization problem that satisfy the problem's constraints, potentially including inequalities, equalities, and integer constraints. This is the initial set of candidate solutions to the problem, before the set of candidates has been narrowed down.

Linear programming

Linear programming (LP), also called linear optimization, is a method to achieve the best outcome (such as maximum profit or lowest cost) in a mathematical model whose requirements are represented by linear relationships. Linear programming is a special case of mathematical programming (also known as mathematical optimization). More formally, linear programming is a technique for the optimization of a linear objective function, subject to linear equality and linear inequality constraints.

Related lectures (61)

Branch and Bound: Optimization Techniques

Covers the Branch and Bound optimization technique with LP Relaxation and Integral Optimal Solutions.

Discrete Optimization: Relaxation MOOC: Optimization: principles and algorithms - Network and discrete optimization

Explores solving discrete optimization problems by relaxing integrality constraints.

Discrete Optimization: Definitions MOOC: Optimization: principles and algorithms - Network and discrete optimization

Covers definitions and concepts in discrete optimization, including binary linear problems and combinatorial optimization.

Linear Programming: Weighted Bipartite Matching

Covers linear programming, weighted bipartite matching, and vertex cover problems in optimization.

Simplex Algorithm: Graphical Method MOOC: Optimization: principles and algorithms - Linear optimization