All of the semantic minimalists come together in seeking to reduce contextual inputs in semantics to a minimum, but they disagree over what this quantity may be, and more specifically, the extent to which something can still be classed as “minimal”. With this issue increasingly addressed, three versions of semantic minimalism can be identified: weak, strong, and radical. They are still gathered...

We describe a hybrid meta-heuristic algorithm for combinatorial optimization problems with a specific reference to the travelling salesman problem (TSP). The method is a combination of a genetic algorithm (GA) and greedy randomized adaptive search procedure (GRASP). A new adaptive fuzzy a greedy search operator is developed for this hybrid method. Computational experiments using a wide range of...

The selective travelling salesman problem (STSP) appears in various applications. The paper presents a new version of this problem called the selective travelling salesman problem on a road network (R-STSP). While in the classical STSP a graph is complete and each vertex can be visited at most once, in R-STSP these two constraints are not obligatory which makes the problem more real-life and ap...

We design a new LP-based algorithm for the graphic s-t path Traveling Salesman Problem (TSP), which achieves the best approximation factor of 1.5. The algorithm is based on the idea of narrow cuts due to An, Kleinberg, and Shmoys. It partly answers an open question of Sebő.

We describe how to use the traveling salesman problem (TSP) to create continuous line drawings of target pictures.

The probabilistic traveling salesman problem (PTSP) was introduced by Jaillet [6] as an extension of the classical traveling salesman problem (TSP). In the PTSP, the salesman does not necessarily have to visit every node, but a probability of requiring a visit is given for each node. The goal is to find an a-priori tour that includes every node and minimizes the expected length of an a-posterio...