scientific article; zbMATH DE number 3847222

MaRDI QIDQ3316964zbMATH OpenFDO

Authors Gottfried Tinhofer

Publication date 1982

zbMATH Keywords

527.00031additional constraintsbinary quadratic optimizationefficient algorithmheuristiclower boundstraveling salesman

Mathematics Subject Classification ID

Boolean programming (90C09) Integer programming (90C10) Quadratic programming (90C20) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 3880463
• Constrained spanning trees and the traveling salesman problem
• Algorithms for solution of the travelling salesman problem. II: New lower bound
• A note on dual solutions of the assignment problem in connection with the traveling salesman problem
• scientific article; zbMATH DE number 795217

Cited in

(1)

• scientific article; zbMATH DE number 3880463 (Why is no real title available?)

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 Q3316964)