登入選單

返回Google圖書搜尋

Intersection Cuts from Maximal Convex Extensions of the Ball and the Octahedron

Egon Balas

出版	Management Sciences Research Group, Graduate School of Industrial Administration, Carnegie-Mellon University, 1970
URL	http://books.google.com.hk/books?id=xAwvPQAACAAJ&hl=&source=gbs_api

註釋

Intersection cuts represent a new type of cutting planes for integer programming. Given an integer program, the basic idea of these cuts is to intersect the boundary of some convex set circumscribing the unit cube that contains a basic feasible, but noninteger, solution x bar to the associated linear program, with the n halflines originating at x bar and defined by the problem constraints that are tight for x bar. The n intersection points then define a valid cut. (Author).