72 research outputs found
On Semidefinite Programming Relaxations of the Travelling Salesman Problem (Replaced by DP 2008-96)
AMS classification: 90C22, 20Cxx, 70-08traveling salesman problem;semidefinite programming;quadratic as- signment problem
On Semidefinite Programming Relaxations of the Travelling Salesman Problem (Replaced by DP 2008-96)
AMS classification: 90C22, 20Cxx, 70-08
Traveling Salesman Problem
The idea behind TSP was conceived by Austrian mathematician Karl Menger in mid 1930s who invited the research community to consider a problem from the everyday life from a mathematical point of view. A traveling salesman has to visit exactly once each one of a list of m cities and then return to the home city. He knows the cost of traveling from any city i to any other city j. Thus, which is the tour of least possible cost the salesman can take? In this book the problem of finding algorithmic technique leading to good/optimal solutions for TSP (or for some other strictly related problems) is considered. TSP is a very attractive problem for the research community because it arises as a natural subproblem in many applications concerning the every day life. Indeed, each application, in which an optimal ordering of a number of items has to be chosen in a way that the total cost of a solution is determined by adding up the costs arising from two successively items, can be modelled as a TSP instance. Thus, studying TSP can never be considered as an abstract research with no real importance
Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: theory and software
A common computational approach for polynomial optimization problems (POPs)
is to use (hierarchies of) semidefinite programming (SDP) relaxations. When the
variables in the POP are required to be nonnegative, these SDP problems
typically involve nonnegative matrices, i.e. they are conic optimization
problems over the doubly nonnegative cone. The Jordan reduction, a symmetry
reduction method for conic optimization, was recently introduced for symmetric
cones by Parrilo and Permenter [Mathematical Programming 181(1), 2020]. We
extend this method to the doubly nonnegative cone, and investigate its
application to known relaxations of the quadratic assignment and maximum stable
set problems. We also introduce new Julia software where the symmetry reduction
is implemented.Comment: 19 pages, titled change from earlier version. arXiv admin note: text
overlap with arXiv:1908.0087
- ā¦