Universal conditions for algebraic travelling salesman problems to be efficiently solvable
From MaRDI portal
Publication:3360022
DOI10.1080/02331939108843720zbMATH Open0732.90088OpenAlexW4244086314MaRDI QIDQ3360022FDOQ3360022
Authors: Rainer E. Burkard, Jack A. A. van der Veen 
Publication date: 1991
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939108843720
Recommendations
Combinatorial optimization (90C27) Programming in abstract spaces (90C48) Ordered semigroups and monoids (06F05) Semigroups (20M99)
Cites Work
- Title not available (Why is that?)
- Edgeconvex Circuits and the Traveling Salesman Problem
- Extreme Hamiltonian lines
- Title not available (Why is that?)
- An algebraic approach to assignment problems
- An equivalency problem in discrete programming over ordered semigroups
- A solvable case of the traveling salesman problem
Cited In (13)
- Pyramidal tours for the traveling salesman
- An \(O(n)\) algorithm to solve the Bottleneck Traveling Salesman Problem restricted to ordered product matrices
- On the traveling salesman problem with a relaxed Monge matrix
- Sometimes travelling is easy: The master tour problem
- An asymmetric analog of van der Veen conditions and the traveling salesman problem. II
- A general approach to avoiding two by two submatrices
- Efficiently solvable special cases of hard combinatorial optimization problems
- Perspectives of Monge properties in optimization
- The travelling salesman and the PQ-tree
- Generalisations of the Gilmore-Gomory traveling salesman problem and the Gilmore-Gomory scheme: a survey
- Special cases of the traveling salesman problem
- Hamiltonian cycles in circulant digraphs with two stripes
- On the recognition of permuted bottleneck Monge matrices
This page was built for publication: Universal conditions for algebraic travelling salesman problems to be efficiently solvable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3360022)
