scientific article; zbMATH DE number 3632217
From MaRDI portal
Publication:4193256
zbMath0406.90045MaRDI QIDQ4193256
No author found.
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items (12)
Efficiently solvable special cases of hard combinatorial optimization problems ⋮ A new asymmetric pyramidally solvable class of the traveling salesman problem ⋮ Flow shop scheduling with peak power consumption constraints ⋮ The multi-stripe travelling salesman problem ⋮ Unnamed Item ⋮ Efficiently solvable special cases of bottleneck travelling salesman problems ⋮ An asymmetric analogue of van der Veen conditions and the traveling salesman problem ⋮ Universal conditions for algebraic travelling salesman problems to be efficiently solvable ⋮ Pyramidal tours with step-backs and the asymmetric traveling salesman problem ⋮ An \(O(n)\) algorithm to solve the Bottleneck Traveling Salesman Problem restricted to ordered product matrices ⋮ An asymmetric analog of van der Veen conditions and the traveling salesman problem. II ⋮ Pyramidal tours and the traveling salesman problem
This page was built for publication:
