scientific article; zbMATH DE number 1489999
From MaRDI portal
Publication:4496241
zbMath0961.65060MaRDI QIDQ4496241
Publication date: 6 June 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
stabilityknapsack problempolynomial-time algorithmworst-case complexityhard optimization problemstraveling salesperson problem
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Transportation, logistics and supply chain management (90B06) Complexity and performance of numerical algorithms (65Y20)
Related Items
Approximation Algorithms for the Traveling Salesman Problem with Range Condition ⋮ On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality ⋮ Stability of Reapproximation Algorithms for the $$\beta $$-Metric Traveling Salesman (Path) Problem ⋮ Reoptimization of the metric deadline TSP ⋮ On the Hardness of Reoptimization
This page was built for publication:
