NP-complete optimization
Description: The study of optimization problems whose decision versions are NP-complete, in computational complexity and algorithm design.
Related topic: Metaheuristic Optimization Algorithms Research (16%)
OpenAlex ID: keywords/np-complete-optimization
