scientific article; zbMATH DE number 1445294

MaRDI QIDQ4952607zbMATH OpenFDO

Authors

Publication date 15 January 2001

zbMATH Keywords

combinatorial optimizationlinear programmingtraveling salesman problem

Mathematics Subject Classification ID

Linear programming (90C05) Combinatorial optimization (90C27)

Recommendations

• On the Held-Karp relaxation for the asymmetric and symmetric traveling salesman problems
• A Simple LP Relaxation for the Asymmetric Traveling Salesman Problem
• A simple LP relaxation for the asymmetric traveling salesman problem
• A constant-factor approximation algorithm for the asymmetric traveling salesman problem

Cited in

(9)

• On the Held-Karp relaxation for the asymmetric and symmetric traveling salesman problems
• Matroid-based TSP rounding for half-integral solutions
• A Simple LP Relaxation for the Asymmetric Traveling Salesman Problem
• A simple LP relaxation for the asymmetric traveling salesman problem
• A constant-factor approximation algorithm for the asymmetric traveling salesman problem
• Approximate core allocations for edge cover games
• Approximate core allocations for edge cover games
• On polynomial kernels for traveling salesperson problem and its generalizations
• LP-based solution methods for the asymmetric TSP

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