scientific article; zbMATH DE number 6469164
From MaRDI portal
Publication:5501277
zbMath1318.90043MaRDI QIDQ5501277
Publication date: 3 August 2015
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (3)
Approximation algorithms for the priority facility location problem with penalties ⋮ Hedging uncertainty: approximation algorithms for stochastic optimization problems ⋮ Complexity and Approximability of Optimal Resource Allocation and Nash Equilibrium over Networks
This page was built for publication:
