5 citations · 6 across the 4 of their papers we have counts for
5 papers
A Survey of Approximability Results for Traveling Salesman Problems using the TSP-T3CO Definition Scheme
Sophia Saller, Jana Koehler, Andreas Karrenbauer
The traveling salesman (or salesperson) problem, short TSP, is a problem of strong interest to many researchers from mathematics, economics, and computer science. Manifold TSP vari…
Easy, adaptable and high-quality Modelling with domain-specific Constraint Patterns
Sophia Saller, Jana Koehler
Domain-specific constraint patterns are introduced, which form the counterpart to design patterns in software engineering for the constraint programming setting. These patterns des…
Random graphs embeddable in order-dependent surfaces
Colin McDiarmid, Sophia Saller
Given a `genus' function , we let be the class of all graphs such that if has order (that is, has vertices) then it is embeddable in a surfa…
Classes of graphs embeddable in order-dependent surfaces
Colin McDiarmid, Sophia Saller
Given a function we let be the class of all graphs such that if has order (that is, has vertices) then it is embeddable in some surface of…
Cable Tree Wiring -- Benchmarking Solvers on a Real-World Scheduling Problem with a Variety of Precedence Constraints
Jana Koehler, Joseph Bürgler, Urs Fontana +7
Cable trees are used in industrial products to transmit energy and information between different product parts. To this date, they are mostly assembled by humans and only few autom…