scientific article
From MaRDI portal
Publication:2753732
zbMath0976.90081MaRDI QIDQ2753732
Michael Langberg, Kobbi Nissim
Publication date: 11 November 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (2)
Fast local search methods for solving limited memory influence diagrams ⋮ Intractability and approximation of optimization theories of cognition
This page was built for publication:
