Solving the ILP using branch-and-cut Solving ILPs is a main topic in combinatorial optimization. We will take a brief look at the branch-and-cut approach. Branch-and-cut makes use of two techniques: • Cutting planes: t - Branch and cut - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2007-11-21 04:29:24		Solving the ILP using branch-and-cut Solving ILPs is a main topic in combinatorial optimization. We will take a brief look at the branch-and-cut approach. Branch-and-cut makes use of two techniques: • Cutting planes: t Add to Reading List Source URL: www.mi.fu-berlin.de Download Document from Source Website File Size: 45,07 KB Share Document on Facebook