scientific article

zbMATH Open0645.90089MaRDI QIDQ3789367FDOQ3789367

Jayme L. Szwarcfiter

Publication date: 1987

Title of this publication is not available (Why is that?)

zbMATH Keywords

polynomial complexitydigraphminimal cost Hamilton cycle

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)

Cited In (5)

• On the solution of the problem of the sequential traversing of sets using a ``nonclosed traveling salesman problem.
• Dynamic programming and the graphical traveling salesman problem
• How to survive while visiting a graph
• On the Travelling Salesperson Problem in Many Dimensions
• The multi-stripe travelling 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 Q3789367)