binary integer linear programming
preferred label: برنامه‌ریزی خطی با اعداد صحیح صفر و یک @fa
type: Concept
related: nP-hard problem

finding maximum clique
preferred label: یافتن ماکسیمم خوشه @fa
type: Concept
related: nP-hard problem

uncapacitated facility location problem
preferred label: مسئله مکان‌یابی امکانات ناگنجایشی @fa
type: Concept
related: nP-hard problem

problem complexity
preferred label: پیچیدگی مسئله @fa
type: Concept
narrower: nP-hard problem

nP-hard problem
preferred label: مسئله np-سخت @fa
related: binary integer linear programming
related: subset sum problem
related: integer linear programming
related: uncapacitated facility location problem
related: finding maximum clique
related: scheduling problem
related: decision problem of graph coloring
related: discrete optimization
related: stacking
type: Concept
broader: problem complexity

subset sum problem
preferred label: مسئله مجموع زیرمجموعه‌ها @fa
type: Concept
related: nP-hard problem

integer linear programming
preferred label: برنامه‌ریزی خطی با اعداد صحیح @fa
type: Concept
related: nP-hard problem

decision problem of graph coloring
preferred label: مسئله تصمیم رنگ‌آمیزی گراف @fa
type: Concept
related: nP-hard problem

discrete optimization
preferred label: بهینه‌سازی گسسته @fa
type: Concept
related: nP-hard problem

scheduling problem
preferred label: مسئله پرسش نامه‌ای @fa
type: Concept
related: nP-hard problem

stacking
preferred label: پشت‌هم گذاری @fa
type: Concept
related: nP-hard problem