Efficiently solvable special cases of hard combinatorial optimization problems
From MaRDI portal
(Redirected from Publication:1365047)
Recommendations
Cites work
- A primer of the Euclidean Steiner problem
- A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time
- A Travelling Salesman Model for the Sequencing of Duties in Bus Crew Rotas
- Cut and patch Steiner trees for ladders
- Halin graphs and the travelling salesman problem
- Hamiltonian cycles in circulant digraphs with two stripes
- scientific article; zbMATH DE number 4027206 (Why is no real title available?)
- scientific article; zbMATH DE number 3748788 (Why is no real title available?)
- scientific article; zbMATH DE number 3632217 (Why is no real title available?)
- scientific article; zbMATH DE number 1099658 (Why is no real title available?)
- On the recognition of permuted Supnick and incomplete Monge matrices
- Permutational extreme values of autocorrelation coefficients and a Pitman test against serial dependence
- Perspectives of Monge properties in optimization
- Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood
- Quadratic assignment problems on series-parallel digraphs
- Recognition of \(d\)-dimensional Monge arrays
- Sequence comparison with mixed convex and concave costs
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- Steiner minimal trees for regular polygons
- Steiner problem in Halin networks
- Steiner Trees for Ladders
- Steiner Trees on a Checkerboard
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- The Product Matrix Traveling Salesman Problem: An Application and Solution Heuristic
- The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
- The Steiner tree problem
- The structure of circular decomposable metrics
- Universal conditions for algebraic travelling salesman problems to be efficiently solvable
Cited in
(14)- Subclasses of solvable problems from classes of combinatorial optimization problems
- Special cases of the traveling salesman problem
- Utilizing shelve slots: Sufficiency conditions for some easy instances of hard problems
- Using well-solvable minimum cost exact covering for VLSI clock energy minimization
- Solvable cases of a new combinatorial problem of optimization
- Combinatorial optimization with interaction costs: complexity and solvable cases
- The two-stripe symmetric circulant TSP is in P
- Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
- scientific article; zbMATH DE number 1953193 (Why is no real title available?)
- A method for modeling the structure of initial data and subclasses of solvable combinatorial optimization problems
- Characterizing the integrality gap of the subtour LP for the circulant traveling salesman problem
- The two-stripe symmetric circulant TSP is in P
- Circulant TSP: vertices of the edge-length polytope and superpolynomial lower bounds
- Circulant TSP special cases: easily-solvable cases and improved approximations
This page was built for publication: Efficiently solvable special cases of hard combinatorial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1365047)
