AI Chat AI Image Generator AI Video Text to Speech

A characterization of Linearizable instances of the Quadratic Traveling Salesman Problem

08/23/2017

∙

by Abraham P. Punnen, et al.

∙

∙

We consider the linearization problem associated with the quadratic traveling salesman problem (QTSP). Necessary and sufficient conditions are given for a cost matrix Q of QTSP to be linearizable. It is shown that these conditions can be verified in O(n^7) time. Some simpler sufficient conditions for linearization are also given along with related open problems.

Abraham P. Punnen
6 publications
Brad D. Woods
1 publication

page 1

page 2

page 3

page 4

research

∙ 03/01/2023

Sufficient conditions for the surjectivity of radical curve parametrizations

In this paper, we introduce the notion of surjective radical parametriza...

0 Jorce Caravantes, et al. ∙

research

∙ 04/11/2023

Necessary and Sufficient Conditions for Simultaneous State and Input Recovery of Linear Systems with Sparse Inputs by ℓ_1-Minimization

The study of theoretical conditions for recovering sparse signals from c...

0 Kyle Poe, et al. ∙

research

∙ 02/11/2022

Necessary and sufficient conditions for identifiability in the admixture model

We consider M SNP data from N individuals who are an admixture of K unkn...

0 Jan van Waaij, et al. ∙

research

∙ 02/19/2020

Holistic Specifications for Robust Programs

Functional specifications describe what program components do: the suffi...

0 Sophia Drossopoulou, et al. ∙

research

∙ 10/22/2019

Folding Polyominoes with Holes into a Cube

When can a polyomino piece of paper be folded into a unit cube? Prior wo...

0 Oswin Aichholzer, et al. ∙

research

∙ 03/20/2017

Empirical Analysis of the Necessary and Sufficient Conditions of the Echo State Property

The Echo State Network (ESN) is a specific recurrent network, which has ...

0 Sebastián Basterrech, et al. ∙

research

∙ 05/28/2020

On Functions of Markov Random Fields

We derive two sufficient conditions for a function of a Markov random fi...

0 Bernhard C. Geiger, et al. ∙