http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Lifting of probabilistic cover inequalities
Joung, Seulgi,Park, Sungsoo North-Holland 2017 Operations research letters Vol.45 No.5
<P><B>Abstract</B></P> <P>We consider a chance-constrained binary knapsack problem where weights of items are independent and normally distributed. Probabilistic cover inequalities can be defined for the problem. The lifting problem for probabilistic cover inequalities is NP-hard. We propose a polynomial time approximate lifting method for probabilistic cover inequalities based on the robust optimization approach. We present computational experiments on multidimensional chance-constrained knapsack problems. The results show that our lifting method reduces the computation time substantially.</P>