scientific article; zbMATH DE number 432785

zbMATH Open0800.68635MaRDI QIDQ3138916FDOQ3138916

Authors Michel X. Goemans, Dimitris Bertsimas 

Publication date 19 September 1994

zbMATH Keywords

linear programmingSteiner tree problemtravelling salesman problem

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35)

Cited in

(6)

• A note on the prize collecting traveling salesman problem
• The parsimonious property of cut covering problems and its applications
• Approximating the asymmetric profitable tour
• Approximating the minimum tour cover of a digraph
• \(\frac{13}{9}\)-approximation for graphic TSP
• Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests

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