Zobrazeno 1 - 10
of 1 103
pro vyhledávání: '"Linear bottleneck assignment problem"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Mohammed Essaid Riffi, Fatima Sayoti
Publikováno v:
International Journal of Interactive Multimedia and Artificial Intelligence, Vol 5, Iss 4, Pp 68-74 (2019)
Re-Unir. Archivo Institucional de la Universidad Internacional de La Rioja
instname
Re-Unir. Archivo Institucional de la Universidad Internacional de La Rioja
instname
The Quadratic Assignment Problem (QAP) is a combinatorial optimization problem; it belongs to the class of NP-hard problems. This problem is applied in various fields such as hospital layout, scheduling parallel production lines and analyzing chemica
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6b4358ad95330d53324d992dbd810747
http://www.ijimai.org/journal/node/1917
http://www.ijimai.org/journal/node/1917
Autor:
Nilanjan Chakraborty, Fan Yang
Publikováno v:
ICRA
We present a novel algorithm for combined task assignment and path planning on a roadmap with stochastic costs. In this problem, the initially unassigned robots and tasks are located at known positions in a roadmap. We want to assign a unique task to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6fcb49e2d5250d4c63c9aa904396613f
https://doi.org/10.1109/icra48506.2021.9561276
https://doi.org/10.1109/icra48506.2021.9561276
Publikováno v:
Neurocomputing. 314:409-428
There has always been a need to solve real-life large-scale problems, suchas efficiently allocating limited resources, and other complex and conflicting situations related to combinatorial optimization genre. A class of combinato- rial optimization p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d26b0fb646c79085a7f9837ae22610c2
https://doi.org/10.1016/j.neucom.2018.07.008
https://doi.org/10.1016/j.neucom.2018.07.008
Autor:
Luitpold Babel
Publikováno v:
Journal of Intelligent & Robotic Systems. 94:857-869
The engagement of a group of autonomous air vehicles against several targets is a major challenge in mission planning. This paper addresses the problem of cooperative flight path planning where the air vehicles should arrive at the destinations simul
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::41570d99819df53d5955ef206161cb57
https://doi.org/10.1007/s10846-018-0910-9
https://doi.org/10.1007/s10846-018-0910-9
Autor:
Xiaoge Zhang, Sankaran Mahadevan
Publikováno v:
IEEE Transactions on Cybernetics. 48:1304-1315
Finding an equilibrium state of the traffic assignment plays a significant role in the design of transportation networks. We adapt the path finding mathematical model of slime mold Physarum polycephalum to solve the traffic equilibrium assignment pro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9cdb88f449f4429e458da94568cd8523
https://doi.org/10.1109/tcyb.2017.2691666
https://doi.org/10.1109/tcyb.2017.2691666
Autor:
Barna Saha, Aravind Srinivasan
Publikováno v:
Random Structures & Algorithms. 52:680-715
We develop a rounding method based on random walks in polytopes, which leads to improved approximation algorithms and integrality gaps for several assignment problems that arise in resource allocation and scheduling. In particular, it generalizes the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::673b3a56783d058b8e84eaa6a503ec4e
https://doi.org/10.1002/rsa.20756
https://doi.org/10.1002/rsa.20756
Autor:
Phuong Le
Publikováno v:
International Journal of Economic Theory. 13:369-385
This paper studies the problem of random assignment with fractional endowments. In the random assignment problem, a number of objects has to be assigned to a number of agents. Though the objects are indivisible, an assignment can be probabilistic: it
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7e627d035e6a783f096d3ab54d069a7c
https://doi.org/10.1111/ijet.12135
https://doi.org/10.1111/ijet.12135
Publikováno v:
Transportation Research Part B: Methodological. 105:270-296
This paper describes a spatial parallelization scheme for the static traffic assignment problem. In this scheme, which we term a decomposition approach to the static traffic assignment problem (DSTAP), the network is divided into smaller networks, an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::29aa2c51406d841eb71391243e8f27ee
https://doi.org/10.1016/j.trb.2017.09.011
https://doi.org/10.1016/j.trb.2017.09.011
Autor:
Lúcia Maria de A. Drummond, Cristiana Bentes, Alexandre Domingues Gonçalves, Artur Alves Pessoa, Ricardo Farias
Publikováno v:
INFORMS Journal on Computing. 29:676-687
The quadratic assignment problem (QAP) is a combinatorial optimization problem that arises in many real-world applications, such as equipment allocation in industry. The QAP is NP-hard and, in practice, one of the hardest combinatorial optimization p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3495025a555ba3bb292d83cc4a243b2d
https://doi.org/10.1287/ijoc.2017.0754
https://doi.org/10.1287/ijoc.2017.0754