Branch-and-Bound method

Date and Time

2020-09-18 10:00 오전

Place

24205 (off-line)

Speaker(s)

Jeongmin Jeon

Overview

Branch and bound (BB, B&B, or BnB) 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

YouTube

Reference(s)

A. H. Land and A. G. Doig (1960). “An automatic method of solving discrete programming problems”. Econometrica. 28 (3). pp. 497–520.

Next Speaker(s)

Francisco

File Station > Seminar Materials > Lab Seminar Materials

Go to Top