I. INTRODUCTION
There is a class of optimization problems subject to a binary constraint matrix. For the fast packet switching problem (FPSP) in computer networks, the synchronization between input and output ports in a network router requires that each input port may send packets through at most one buffer and each output port may receive packets from at most one buffer at any time. As result, at most one entry in every row and every column of a constraint matrix for FPSP may be equal to 1. For the traveling salesman problem (TSP), since each city must be visited once and only once by a salesman, every row and every column of the constraint matrix for TSP must have one entry that is equal to 1. Moreover, FPSP and TSP have different objective functions to be optimized.