scientific article; zbMATH DE number 1405785

zbMath0946.90007MaRDI QIDQ4938770

R. Ravi, F. Sibel Salman

Publication date: 23 February 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

traveling purchaser problemSteiner tree problemsLP relaxationpoly-logarithmic worst-case ratio

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Deterministic network models in operations research (90B10)

Related Items (15)

The bi-objective traveling purchaser problem with deliveries ⋮ Budget constrained minimum cost connected medians ⋮ The traveling purchaser problem with fast service option ⋮ Connected facility location via random facility sampling and core detouring ⋮ Improved heuristics for the traveling purchaser problem. ⋮ Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems ⋮ The traveling purchaser problem and its variants ⋮ Models for a traveling purchaser problem with additional side-constraints ⋮ Hedging uncertainty: approximation algorithms for stochastic optimization problems ⋮ The traveling purchaser problem with budget constraint ⋮ Algorithms for the metric ring star problem with fixed edge-cost ratio ⋮ Securely Connected Facility Location in Metric Graphs ⋮ Parameterized algorithms and complexity for the traveling purchaser problem and its variants ⋮ Effective Algorithms for a Bounded Version of the Uncapacitated TPP ⋮ Optimizing a mail-order with discount and shipping costs

This page was built for publication: