以拉式松弛演算法求解车辆定线问题.pptVIP

The Set Covering Problem,the Set Partitioning Problem Speakr：Yung- Yao Hung Introduction The set covering problem (SCP) is the zero-one integer program where E =(eij) is an m by n matrix whose entries eij are 0 or 1, c= (cij)(j=1,…, n) is a cost row with positive components, x= (xij)(j=1,…, n) is a vector of zero-one variables, and e is an m vector of ls. Introduction If the constraints are replaced by the equalities Ex = e, (1) the integer program is referred to as a set partitioning problem (SPP). Background Certain network