We present a new deterministic sorting algorithm that interleaves the partitioning of a sample sort with merging. Sequentially, it sorts n elements in O(n log n) time cache-oblivi...
Many volume data possess symmetric features that can be clearly observed, for example, those existing in diffusion tensor image data sets. The exploitations of symmetries for volu...
We introduce orbital branching, an effective branching method for integer programs containing a great deal of symmetry. The method is based on computing groups of variables that a...
James Ostrowski, Jeff Linderoth, Fabrizio Rossi, S...
Abstract. A common type of symmetry is when both variables and values partition into interchangeable sets. Polynomial methods have been introduced to eliminate all symmetric soluti...
Yat Chiu Law, Jimmy Ho-Man Lee, Toby Walsh, J. Y. ...
Abstract. We introduce a new global constraint which combines together the lexicographic ordering constraint with two sum constraints. Lexicographic ordering constraints are freque...