Stratifying On-Shell Cluster Varieties: the Geometry of Non-Planar On-Shell Diagrams

The correspondence between on-shell diagrams in maximally supersymmetric Yang-Mills theory and cluster varieties in the Grassmannian remains largely unexplored beyond the planar limit. In this article, we describe a systematic program to survey such 'on-shell varieties', and use this to provide a complete classification in the case of $G(3,6)$. In particular, we find exactly 24 top-dimensional varieties and 10 co-dimension one varieties in $G(3,6)$---up to parity and relabeling of the external legs. We use this case to illustrate some of the novelties found for non-planar varieties relative to the case of positroids, and describe some of the features that we expect to hold more generally.Comment: 35 pages, 70 figures, and 1 table; also included is a file with explicit details for our classification. Signs corrected in two residue theorems, and a new interpretation (and formula) given for the las

Investigating edge-reordering procedures in a tabu search algorithm for the capacitated arc routing problem

This paper presents two ideas to guide a tabu search algorithm for the Capacitated Arc Routing Problem to a promising region of the solution space. Both ideas involve edge-reordering, although they work in different ways. One of them aims to directly tackle deadheading cycles, and the other tries to reorder edges with the aim of extending a scope of solutions that can be reached from a given solution. Experiments were performed on 134 benchmark instances of various sizes, and the two ideas were shown to have an ability to guide the search to good solutions. Possible issues that may arise when implementing these ideas are also discussed

Conceptual design for Mobile Geological Laboratory position and heading fix system

Conceptual design of position fixing system for Mobile Geological Laboratory in Lunar Mobile Laboratory simulatio

Single Commodity Flow Algorithms for Lifts of Graphic and Cographic Matroids

Consider a binary matroid M given by its matrix representation. We show that if M is a lift of a graphic or a cographic matroid, then in polynomial time we can either solve the single commodity flow problem for M or find an obstruction for which the Max-Flow Min-Cut relation does not hold. The key tool is an algorithmic version of Lehman's Theorem for the set covering polyhedron

Approximation Algorithms for Traveling Salesman Problems

The traveling salesman problem is the probably most famous problem in combinatorial optimization. Given a graph G and nonnegative edge costs, we want to find a closed walk in G that visits every vertex at least once and has minimum cost. We consider both the symmetric traveling salesman problem (TSP) where G is an undirected graph and the asymmetric traveling salesman problem (ATSP) where G is a directed graph. We also investigate the unit-weight special cases and the more general path versions, where we do not require the walk to be closed, but to start and end in prescribed vertices s and t. In this thesis we give improved approximation algorithms and better upper bounds on the integrality ratio of the classical linear programming relaxations for several of these traveling salesman problems. For this we use techniques arising from various parts of combinatorial optimization such as linear programming, network flows, ear-decompositions, matroids, and T-joins. Our results include a (22 + &epsilon)-approximation algorithm for ATSP (for any &epsilon > 0), the first constant upper bound on the integrality ratio for s-t-path ATSP, a new upper bound on the integrality ratio for s-t-path TSP, and a black-box reduction from s-t-path TSP to TSP