scientific article; zbMATH DE number 4027206

Extremal problems in graph theory (05C35) Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Programming involving graphs or networks (90C35)

Recommendations

scientific article; zbMATH DE number 34438
Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
Small and large TSP: Two polynomially solvable cases of the traveling salesman problem
Special cases of the traveling salesman problem
Efficiently solvable special cases of bottleneck travelling salesman problems

Cited in

(only showing first 100 items - show all)

Minimum-weight cycle covers and their approximability
Recognition of Gilmore-Gomory traveling salesman problem
A polynomial-time solution to Papadimitriou and Steiglitz's ``traps
An algorithm for the detection and construction of Monge sequences
Efficiently solvable special cases of bottleneck travelling salesman problems
A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time
The traveling salesman problem: An overview of exact and approximate algorithms
Optimal arcs for the traveling salesman problem
Traveling salesman problem under categorization
Pyramidal tours with step-backs and the asymmetric traveling salesman problem
Stability aspects of the traveling salesman problem based on \(k\)-best solutions
K-center and K-median problems in graded distances
Scheduling of flexible flow lines in an automobile assembly plant
Combinatorial optimization models for production scheduling in automated manufacturing systems
A generalization of the convex-hull-and-line traveling salesman problem
Small and large TSP: Two polynomially solvable cases of the traveling salesman problem
An O(n) algorithm to solve the Bottleneck Traveling Salesman Problem restricted to ordered product matrices
Special cases of the traveling salesman problem
Graphs in which all Hamiltonian cycles have the same length
Maximizing traveling salesman problem for special matrices
The Convex-hull-and-k-line Travelling Salesman Problem
Efficiently solvable special cases of hard combinatorial optimization problems
The computational complexity of Steiner tree problems in graded matrices
Two-stage no-wait scheduling models with setup and removal times separated
Hamiltonian cycles in circulant digraphs with two stripes
Weighted graphs with all Hamiltonian cycles of the same length
A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups
Linearity in the traveling salesman problem
Survey of facial results for the traveling salesman polytope
An asymmetric analog of van der Veen conditions and the traveling salesman problem. II
Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility
Efficient filtering for the resource-cost alldifferent constraint
A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion
The constant objective value property for multidimensional assignment problems
Polynomially solvable cases of the bipartite traveling salesman problem
Two-machine flow shop scheduling problems with no-wait jobs
Hamiltonian path and symmetric travelling salesman polytopes
Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds
Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood
The computational complexity of the k-minimum spanning tree problem in graded matrices
Traveling salesman games with the Monge property
Monge matrices make maximization manageable
On the recognition of permuted bottleneck Monge matrices
Perspectives of Monge properties in optimization
The maximum travelling salesman problem on symmetric Demidenko matrices
Minimizing the number of workers in a paced mixed-model assembly line
A two-machine no-wait flow shop problem with two competing agents
The two-stripe symmetric circulant TSP is in P
The \(x\)-and-\(y\)-axes travelling salesman problem
Euclidean TSP on two polygons
The pyramidal capacitated vehicle routing problem
The Northwest corner rule revisited
Four-point conditions for the TSP: the complete complexity classification
Multiobjective traveling salesperson problem on Halin graphs
Some local search algorithms for no-wait flow-shop problem with makespan criterion
On the Euclidean TSP with a permuted van der Veen matrix
Monge properties, discrete convexity and applications
Fast local search algorithms for the handicapped persons transportation problem
Linearizable special cases of the QAP
The traveling salesman problem: new polynomial approximation algorithms and domination analysis
A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph
On the traveling salesman problem with a relaxed Monge matrix
On the complexity of master problems
Universal conditions for algebraic travelling salesman problems to be efficiently solvable
New exponential neighbourhood for polynomially solvable TSPs
One-Sided Monge TSP Is NP-Hard
scientific article; zbMATH DE number 4029294 (Why is no real title available?)
scientific article; zbMATH DE number 4053381 (Why is no real title available?)
scientific article; zbMATH DE number 34438 (Why is no real title available?)
Monge properties of sequence alignment
Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
Three easy special cases of the euclidean travelling salesman problem
On the skeleton of the polytope of pyramidal tours
The Kth TSP is pseudopolynomial when TSP is polynomial
The travelling salesman and the PQ-tree
On constant-weight TSP-tours
Applications of a special polynomial class of TSP
Characterizing the integrality gap of the subtour LP for the circulant traveling salesman problem
On cost matrices with two and three distinct values of Hamiltonian paths and cycles
Some Special Cases Treated by the Whitham Theory
scientific article; zbMATH DE number 4189491 (Why is no real title available?)
An asymmetric analogue of van der Veen conditions and the traveling salesman problem
Pyramidal tours and multiple objectives
Sometimes travelling is easy: The master tour problem
On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices
A comparison of lower bounds for the symmetric circulant traveling salesman problem
Recognising permuted Demidenko matrices
Travelling salesman paths on Demidenko matrices
Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming
Monge and feasibility sequences in general flow problems
The two-stripe symmetric circulant TSP is in P
Circulant TSP: vertices of the edge-length polytope and superpolynomial lower bounds
The bipartite travelling salesman problem: a pyramidally solvable case
Computing Hamiltonian paths with partial order restrictions
SC-Hamiltonian graphs and digraphs: new necessary conditions and their impacts
A graph width perspective on partially ordered Hamiltonian paths and cycles ii: vertex and edge deletion numbers
Three value TSP and linkages with the three value linear spanning 2-forests
Classes of matrices for the traveling salesman problem
Pyramidal tours and the traveling salesman problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3768703)