Abstract Local search algorithms are frequently used to handle complex optimization problems involving binary decision variables. One way of implementing a local procedure is by using mixed-integer programming solver explore neighborhood defined through constraint that limits the number variables whose values allowed change in given iteration. Recognizing not all equally promising when searchin...

We introduce a scheme to simplify a multi-valued network using redundancy removal techniques. Recent methods [1], [2] for binary redundancy removal avoid the use of state traversal. Additionally, [2] finds multiple compatible redundancies simultaneously. We extend these powerful advances in the field of binary redundancy removal to perform redundancy removal for multi-valued networks. First we ...