3 papers
math.CO2026
Algorithms for Computing Set Tolerances: Theory, Computational Analysis and Applications
Gerold Jäger, Gerold Jäger, Dmitrii Panasenko
The regular set tolerance is an important term in sensitivity analysis. For combinatorial sum problems, e.g., the Traveling Salesman Problem, Shortest Path Problem and Minimum Span…
cs.DM2024
Extending the definition of set tolerances
Gerold Jäger, Marcel Turkensteen
Optimal solutions of combinatorial optimization problems can be sensitive to changes in the cost of one or more elements of the ground set E. Single and set tolerances measure the…
math.CO2024
Enumeration of Row-Column Designs
Gerold Jäger, Klas Markström, Lars-Daniel Ãhman +1
We computationally completely enumerate a number of types of row-column designs up to isotopism, including double, sesqui and triple arrays as known from the literature, and two ne…