scientific article; zbMATH DE number 16400
From MaRDI portal
Publication:3973054
zbMATH Open0744.90071MaRDI QIDQ3973054
Publication date: 26 June 1992
Title of this publication is not available (Why is that?)
Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Recommendations
- Quasiabelian landscapes of the traveling salesman problem are elementary π π
- Quantizers ad the worst case Euclidean traveling salesman problem π π
- The Euclidean traveling salesman problem and a space-filling curve π π
- Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation π π
- A Polyhedral Study of the Quadratic Traveling Salesman Problem π π
- The Traveling Salesman Problem under squared Euclidean distances π π
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems π π
- A Priori Bounds on the Euclidean Traveling Salesman π π
- VORONOI DIAGRAMS FOR A TRANSPORTATION NETWORK ON THE EUCLIDEAN PLANE π π
- Algorithms and Computation π π
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 Q3973054)