本文将2005年“电工杯”B题的最优化问题转化为独立的问题来讨论。解决了在比赛项目排序过程中尽可能使每个运动员不连续参加两项比赛问题。即把运动员参加的项目记作1,把未参加的项目记为0,这样把运动员报名表转化成为一个0-1矩阵。问题转化成为0-1矩阵进行列交换顺序,使得每一行中两个1相邻出现的次数和达到最小。并对模型进行了推广。最后指出了模型的优缺点。
This paper transfers the optimal problem of Test Bin 2005's Diangong Cup B into an independent one. We solve the problem of making it possible to have every athlete not participate in two suclessive games in the array items of game. The item that an athlete will attend we can sign as 1,otherwise as 0. Then the table of the enrolled can be looked as a matrix, which only contains element 0 and 1. We can transfer the row of the matrix to make the number of adjoined 1 reach the least, then generalize and form general solutions . The advantages and disadvantage are also pointed out.