Eight distinct (and in some cases little known) formulations of the Travelling Salesman
Problem as an Integer Programme are given. Apart from the standard formulation all the …

In this paper we define a combinatorial object called a pedigree, and study the
corresponding polytope, called the pedigree polytope. Pedigrees are in one-to-one …

For a graph (V, E), existing compact linear formulations for the minimum cut problem require
Θ (| V|| E|) variables and constraints and can be interpreted as a composition of| V|− 1 …

The pedigree is a combinatorial object defined over the cartesian product of certain subsets
of edges in a complete graph. There is a 1–1 correspondence between the pedigrees and …

Abstract The Symmetric Travelling Salesman Problem (STSP) has many different
formulations. The most famous formulation is the standard formulation by Dantzig, Fulkerson …

Intelligent cooperative multiagent systems are applied for solving a large range of real-life
problems, including in domains like biology and healthcare. There are very few metrics able …

Arthanari (On the traveling salesman problem, presented at the XI Symposium on
Mathematical Programming held at Bonn, West Germany, 1982) proposed a Multistage …

Given a polytope P and a in the interior of P and x∉ P, to identify a violated facet of P, whose
supporting hyperplane separates x from P constitutes the separation problem for P. In …

Symmetric traveling salesman problem (STSP), a difficult combinatorial problem is
formulated as a multistage insertion (MI) decision problem in Arthanari and Usha (2000). MI …

The traveling salesperson problem (TSP) is a very well-known NP-hard combinatorial
optimization problem. Many different integer programming formulations are known for the …