نتایج جستجو برای: np hard problems
تعداد نتایج: 731128 فیلتر نتایج به سال:
Assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. In this study, we solve quadratic assignment problem (QAP), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. It should be noted that any facility must be assign to only one location. In this paper, first o...
A salesman in a red suit who looks suspiciously like Tom Waits presents you with a black steel box with n binary switches on the front and a light bulb on the top. The salesman tells you that the state of the light bulb is controlled by a complex boolean circuit—a collection of AND, OR, and NOT gates connected by wires, with one input wire for each switch and a single output wire for the light ...
A salesman in a red suit who looks suspiciously like Tom Waits presents you with a black steel box with n binary switches on the front and a light bulb on the top. The salesman tells you that the state of the light bulb is controlled by a complex boolean circuit—a collection of AND, OR, and NOT gates connected by wires, with one input wire for each switch and a single output wire for the light ...
در این پایان ابتدا مسائل مکان یابی یعنی مسئله مرکز و میانه را معرفی می کنیم. سپس بطور کامل مسئله یافتن p - میانه را بحث می کنیم و نشان می دهیم که p - میانه روی گراف های کلی np- hard می باشد. ولی روی درخت ها الگوریتم با زمان چند جمله ای برای حل آن وجود دارد. بعد مسئله p - مرکز را مورد بحث قرار می دهیم و نشان می دهیم این مسئله روی گراف کلی حتی گراف ساده و درخت ها np- hard می باشد.
In the last lecture, we studied the KNAPSACK problem. The KNAPSACK problem is an NP-hard problem but does admit a pseudo-polynomial time algorithm and can be solved efficiently if the input size is small. We used this pseudo-polynomial time algorithm to obtain an FPTAS for KNAPSACK. In this lecture, we study another class of problems, known as strongly NP-hard problems. Definition 1 (Strongly N...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید