資料結構與演算法

(5 points) Consider the following 0-1 integer linear program $P$:

Let $\alpha$ be the number of feasible solutions to $P$. Let $\beta$ be the number of optimal solutions to $P$. Let $\gamma$ be the integrality gap. Let $P'$ be the relaxed linear program of $P$, let $\nu_4$ be the four-dimensional volume of the convex polytope that consists of all feasible solutions to $P'$. Let $\nu_3$ be the three-dimensional volume of the convex polyhedron that consists of all optimal solutions to $P'$. Select all correct statement(s) below.