Branch and cut
id:
branch-and-cut-247-4888998
title:
Branch and cut
text:
Branch and cut is a method of combinatorial optimization for solving integer linear programs (ILPs), that is, linear programming (LP) problems where some or all the unknowns are restricted to integer values. Branch and cut involves running a branch and bound algorithm and using cutting planes to tighten the linear programming relaxations. Note that if cuts are only used to tighten the initial LP relaxation, the algorithm is called cut and branch.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Branch_and_cut
date created:
date modified:
2023-02-02T22:42:18Z
main entity:
{"identifier":"Q498566","url":"https://www.wikidata.org/entity/Q498566"}
image:
fields total:
13
integrity:
13