scientific article; zbMATH DE number 1499191

MaRDI QIDQ4501237zbMATHFDO

Authors Ana Maria de Almeida, Maria Rosália Dinis Rodrigues

Publication date 3 September 2000

zbMATH Keywords

complexityNP-completepolynomial methoddecision problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Integer programming (90C10)

Recommendations

• scientific article; zbMATH DE number 4031726
• scientific article; zbMATH DE number 7059568
• The traveling salesman problem. Approximate algorithms
• On the solution of traveling salesman problems
• The traveling salesman problem. A computational study.
• scientific article; zbMATH DE number 4095236
• On the approximability of the traveling salesman problem
• The traveling salesman problem and its variations.
• Another approach for the traveling salesman problem.
• The traveling salesman problem. I: Theoretical issues

Cited in

(2)

• scientific article; zbMATH DE number 7059568 (Why is no real title available?)
• scientific article; zbMATH DE number 4031726 (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 Q4501237)