scientific article; zbMATH DE number 1082100

zbMath0966.90506MaRDI QIDQ4365127

Mihalis Yannakakis

Publication date: 30 October 1997

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

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Parallel numerical computation (65Y05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (10)

Computing equilibria: a computational complexity perspective ⋮ The \(p\)-median problem: a survey of metaheuristic approaches ⋮ A local search template. ⋮ On the Relative Complexity of 15 Problems Related to 0/1-Integer Programming ⋮ Complexity of local search for the \(p\)-median problem ⋮ Memetic algorithms: The polynomial local search complexity theory perspective ⋮ Data-independent neighborhood functions and strict local optima ⋮ The Complexity of Propositional Proofs ⋮ Local search with an exponential neighborhood for the servers load balancing problem ⋮ On local search for the generalized graph coloring problem

This page was built for publication: