Efficiently solvable special cases of hard combinatorial optimization problems
type: Item
instance of: scholarly article
title: Efficiently solvable special cases of hard combinatorial optimization problems
zbMATH Open document ID: 0887.90135
DOI: 10.1007/BF02614311
author: Rainer E. Burkard
published in: Mathematical Programming. Series A. Series B
publication date: 1997-08-28T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 1053952
zbMATH Keywords: survey
zbMATH Keywords: polynomially solvable special cases
zbMATH Keywords: travelling salesman
zbMATH Keywords: quadratic assignment
zbMATH Keywords: Steiner tree
zbMATH Keywords: recognition algorithms
MaRDI profile type: Publication
cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
cites work: The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
cites work: Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood
cites work: Q4369631
cites work: Cut and patch Steiner trees for ladders
cites work: Perspectives of Monge properties in optimization
cites work: Universal conditions for algebraic travelling salesman problems to be efficiently solvable
cites work: The structure of circular decomposable metrics
cites work: Steiner Trees on a Checkerboard
cites work: Steiner Trees for Ladders
cites work: Halin graphs and the travelling salesman problem
cites work: On the recognition of permuted Supnick and incomplete Monge matrices
cites work: Q4193256
cites work: Steiner minimal trees for regular polygons
cites work: Sequence comparison with mixed convex and concave costs
cites work: A Travelling Salesman Model for the Sequencing of Duties in Bus Crew Rotas
cites work: Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
cites work: Q3768703
cites work: Permutational extreme values of autocorrelation coefficients and a Pitman test against serial dependence
cites work: A primer of the Euclidean Steiner problem
cites work: The Steiner tree problem
cites work: A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time
cites work: The Product Matrix Traveling Salesman Problem: An Application and Solution Heuristic
cites work: Quadratic assignment problems on series-parallel digraphs
cites work: Recognition of \(d\)-dimensional Monge arrays
cites work: Q3932608
cites work: Steiner problem in Halin networks
cites work: Hamiltonian cycles in circulant digraphs with two stripes
description: scientific article; zbMATH DE number 1053952