Fast Separation Algorithms for Three-Index Assignment Problems

Dokka, Trivikram and Mourtos, I and Spieksma, Frits C.r. (2012) Fast Separation Algorithms for Three-Index Assignment Problems. In: Combinatorial optimization. Lecture Notes in Computer Science . Springer Berlin Heidelberg, New York, pp. 189-200. ISBN 9783642321467

Full text not available from this repository.


In polyhedral combinatorics, the polytope related to a combinatorial optimization problem is examined in order to obtain families of valid inequalities. To incorporate such families of inequalities within a ‘Branch & Cut’ algorithm requires one further step: that of deriving an algorithm which determines whether an inequality of a specific family is violated by a given vector (the separation problem). The idea put forward in this work is to consider a compact representation of the given vector, and measure the complexity of a separation algorithm in terms of this compact representation. We illustrate the idea on the separation of known inequalities for the three index assignment polytope. It turns out that we find new separation algorithms with better complexities than the current ones (that were called best possible).

Item Type:
Contribution in Book/Report/Proceedings
ID Code:
Deposited By:
Deposited On:
26 Jun 2013 14:50
Last Modified:
16 Sep 2023 03:03