نتایج جستجو برای: quadratic assignment problem
تعداد نتایج: 946859 فیلتر نتایج به سال:
The university course timetabling problem is an over-constrained optimisation problem that consists in scheduling a set of events in a given number of rooms and timeslots. In a previous work a general case of the problem was considered and an effective hybrid algorithm based on local search optimisation was developed to solve it. Landscape analysis is the new trend to explain local improvements...
We consider a new semidefinite programming (SDP) relaxation of the symmetric traveling salesman problem (TSP), that may be obtained via an SDP relaxation of the more general quadratic assignment problem (QAP). We show that the new relaxation dominates the one in the paper: [D. Cvetković, M. Cangalović and V. Kovačević-Vujčić. Semidefinite Programming Methods for the Symmetric Traveling Salesman...
Matching one set of objects to another is a ubiquitous task in machine learning and computer vision that often reduces to some form of the quadratic assignment problem (QAP). The QAP is known to be notoriously hard, both in theory and in practice. Here, we investigate if this difficulty can be mitigated when some additional piece of information is available: (a) that all QAP instances of intere...
The application of the Reformulation Linearization Technique (RLT) to the Quadratic Assignment Problem (QAP) leads to a tight linear relaxation with huge dimensions that is hard to solve. Previous works found in the literature show that these relaxations combined with branch-and-bound algorithms belong to the state-of-the-art of exact methods for the QAP. For the level 3 RLT (RLT3), using this ...
Computer systems are subject to continuously increasing performance demands. However, energy consumption has become a critical issue, both for high-end large-scale parallel systems [12], as well as for portable devices [34]. In other words, more work needs to be done in less time, preferably with the same or smaller energy budget. Future performance and efficiency goals of computer systems can ...
The quadratic assignment problem is a well studied and notoriously difficult combinatorial problem. Recently, a discrete linear formulation of the quadratic assignment problem was presented that solved five previously unsolved instances from the quadratic assignment library, QAPLIB, to optimality. That formulation worked especially well on sparse instances. In this paper we show how to tighten ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید