نتایج جستجو برای: assignment problem
تعداد نتایج: 912304 فیلتر نتایج به سال:
The quantum guesswork quantifies the minimum number of queries needed to guess state a ensemble if one is allowed query only at time. Previous approaches computation were based on standard semi-definite programming techniques and therefore lead approximated results. In contrast, we show that computing qubit ensembles with uniform probability distribution corresponds solving quadratic assignment...
— Using an approach that seems to be patterned after that of Yannakakis, Hofman argues that an NP-complete problem cannot be formulated as a polynomial bounded-sized linear programming problem. He then goes on to propose a " construct " that he claims to be a " counterexample " to recently published linear programming formulations of the Traveling Salesman Problem (TSP) and the Quadratic Assign...
The generalized assignment problem is a classical combinatorial optimization problem known to be NP-hard. It can model a variety of real world applications in location, allocation, machine assignment, and supply chains. The problem has been studied since the late 1960s, and computer codes for practical applications emerged in the early 1970s. We propose a new algorithm for this problem that pro...
the hierarchical hub location problem is encountered three-level network that is applied in production-distribution system, education system, emergency medical services, telecommunication network, etc. this paper addresses the hierarchical hub covering problem with single assignment accounting for mandatory dispersion of central hubs restriction as a special case. this formulation with incorpor...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید