Relevant bibliographies by topics / Generalized assignments problem

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Generalized assignments problem'

Author: Grafiati
Published: 28 May 2022
Last updated: 30 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Generalized assignments problem.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Generalized assignments problem"

1

Arslan, Gürdal, Jason R. Marden, and Jeff S. Shamma. "Autonomous Vehicle-Target Assignment: A Game-Theoretical Formulation." Journal of Dynamic Systems, Measurement, and Control 129, no. 5 (2007): 584–96. http://dx.doi.org/10.1115/1.2766722.

Full text
Abstract:
We consider an autonomous vehicle-target assignment problem where a group of vehicles are expected to optimally assign themselves to a set of targets. We introduce a game-theoretical formulation of the problem in which the vehicles are viewed as self-interested decision makers. Thus, we seek the optimization of a global utility function through autonomous vehicles that are capable of making individually rational decisions to optimize their own utility functions. The first important aspect of the problem is to choose the utility functions of the vehicles in such a way that the objectives of the
APA, Harvard, Vancouver, ISO, and other styles
2

Perez, Guillaume, Steve Malalel, Gael Glorian, et al. "Generalized Confidence Constraints." Proceedings of the AAAI Conference on Artificial Intelligence 37, no. 4 (2023): 4078–86. http://dx.doi.org/10.1609/aaai.v37i4.25523.

Full text
Abstract:
In robust optimization, finding a solution that solely respects the constraints is not enough. Usually, the uncertainty and unknown parameters of the model are represented by random variables. In such conditions, a good solution is a solution robust to most-likely assignments of these random variables. Recently, the Confidence constraint has been introduced by Mercier-Aubin et al. in order to enforce this type of robustness in constraint programming. Unfortunately, it is restricted to a conjunction of binary inequalities In this paper, we generalize the Confidence constraint to any constraint
APA, Harvard, Vancouver, ISO, and other styles
3

Steven, Alasdair C., James F. Conway, Naiqian Cheng, Norman R. Watts, and Paul T. Wingfield. "Vive La Différence! Mapping Macromolecular Complexes by Generalized Difference Imaging." Microscopy and Microanalysis 6, S2 (2000): 252–53. http://dx.doi.org/10.1017/s1431927600033754.

Full text
Abstract:
Overview. Three-dimensional cryo-electron microscopy holds great potential for the investigation of macromolecular complexes, including viruses, the cytoskeleton, and the nanomachines that carry out many vital cellular functions. Such complexes often contain protein subunits of different kinds, with cumulative molecular weights running well into the megadalton range. To rationalize their functional assignments in structural terms, the first order of business is to map the locations of the component subunits of a given complex. A more detailed objective then becomes to understand the organizati
APA, Harvard, Vancouver, ISO, and other styles
4

KHODABANDEH, MAHDI, and ALIREZA MOHAMMAD-SHAHRI. "TWO GENERALIZATIONS OF AGGREGATED UNCERTAINTY MEASURE FOR EVALUATION OF DEZERT–SMARANDACHE THEORY." International Journal of Information Technology & Decision Making 11, no. 01 (2012): 119–42. http://dx.doi.org/10.1142/s021962201250006x.

Full text
Abstract:
Generality of the model which is used in Dezert–Smarandache Theory (DSmT) rather than other fusion algorithms such as Dempster–Shafer theory and capability of DSmT for dealing with highly conflict problems are two main reasons to prefer DSmT for decision-making systems. Aggregated uncertainty measure, which is called AU measure, has been introduced for Dempster–Shafer theory as one of the best presented ways to quantify the total uncertainty or the ambiguity of a belief function. Since AU cannot be applied to DSmT, two generalized aggregated uncertainty measures for DSmT, which are called GAU1
APA, Harvard, Vancouver, ISO, and other styles
5

Xiao, Fuyuan. "Complex Pignistic Transformation-Based Evidential Distance for Multisource Information Fusion of Medical Diagnosis in the IoT." Sensors 21, no. 3 (2021): 840. http://dx.doi.org/10.3390/s21030840.

Full text
Abstract:
Multisource information fusion has received much attention in the past few decades, especially for the smart Internet of Things (IoT). Because of the impacts of devices, the external environment, and communication problems, the collected information may be uncertain, imprecise, or even conflicting. How to handle such kinds of uncertainty is still an open issue. Complex evidence theory (CET) is effective at disposing of uncertainty problems in the multisource information fusion of the IoT. In CET, however, how to measure the distance among complex basis belief assignments (CBBAs) to manage conf
APA, Harvard, Vancouver, ISO, and other styles
6

L. Carr, James, Dong L. Wu, Michael A. Kelly, and Jie Gong. "MISR-GOES 3D Winds: Implications for Future LEO-GEO and LEO-LEO Winds." Remote Sensing 10, no. 12 (2018): 1885. http://dx.doi.org/10.3390/rs10121885.

Full text
Abstract:
Global wind observations are fundamental for studying weather and climate dynamics and for operational forecasting. Most wind measurements come from atmospheric motion vectors (AMVs) by tracking the displacement of cloud or water vapor features. These AMVs generally rely on thermal infrared (IR) techniques for their height assignments, which are subject to large uncertainties in the presence of weak or reversed vertical temperature gradients near the planetary boundary layer (PBL) and tropopause folds. Stereo imaging can overcome the height assignment problem using geometric parallax for featu
APA, Harvard, Vancouver, ISO, and other styles
7

Taleyarkhan, Meher R., Anne Lucietto, Natalie Hobson, and Therese Azevedo. "Approach to problem solving and use of intuition by engineering technology students." Journal of Global Education and Research 7, no. 1 (2023): 81–98. http://dx.doi.org/10.5038/2577-509x.7.1.1174.

Full text
Abstract:
Engineering technology students often forgo a methodical approach of solving or answering questions on assignments or exams in favor of an intuition-based approach, emphasizing educated guessing (Broberg et al., 2008). Faculty observations have noted these student solutions often provide explanations, usually sans calculations, to support answers the students believe to be reasonable when in reality deviated from the correct answer. An extensive study was developed to assess several distinctions between student intuition and use of cognition in problem solving, as related to a generalized stud
APA, Harvard, Vancouver, ISO, and other styles
8

Lee, J. H. M., and K. L. Leung. "Consistency Techniques for Flow-Based Projection-Safe Global Cost Functions in Weighted Constraint Satisfaction." Journal of Artificial Intelligence Research 43 (February 28, 2012): 257–92. http://dx.doi.org/10.1613/jair.3476.

Full text
Abstract:
Many combinatorial problems deal with preferences and violations, the goal of which is to find solutions with the minimum cost. Weighted constraint satisfaction is a framework for modeling such problems, which consists of a set of cost functions to measure the degree of violation or preferences of different combinations of variable assignments. Typical solution methods for weighted constraint satisfaction problems (WCSPs) are based on branch-and-bound search, which are made practical through the use of powerful consistency techniques such as AC*, FDAC*, EDAC* to deduce hidden cost information
APA, Harvard, Vancouver, ISO, and other styles
9

Krasavina, Yuliya Vitalevna, Ekaterina Petrovna Ponomarenko, Andrey Aleksandrovich Gareyev, and Anastasia Andreevna Shishkina. "Learning experiences of deaf and hard-of-hearing students in digital media: challenges and the use of cognitive and metacognitive strategies." Science for Education Today 13, no. 6 (2023): 60–81. http://dx.doi.org/10.15293/2658-6762.2306.03.

Full text
Abstract:
Introduction. The paper deals with the problem of developing cognitive competence of deaf and hard-of-hearing students when learning in the digital media. It is aimed at identifying and generalizing difficulties and successful strategies of metacognitive and cognitive nature in deaf and hard of hearing students of a technical university when performing assignments in the digital media. Materials and Methods. For the preliminary selection of participants, V. S. Yurkevich's "Intensity of cognitive interests" inventory and N. S. Kopeina’s learning styles questionnaire were used. Qualitative resea
APA, Harvard, Vancouver, ISO, and other styles
10

Masol, V. "Generalized results of raising the determination of high school students in the process of physical education." Scientific Journal of National Pedagogical Dragomanov University. Series 15. Scientific and pedagogical problems of physical culture (physical culture and sports), no. 3(162) (March 30, 2023): 245–48. http://dx.doi.org/10.31392/npu-nc.series15.2023.3k(162).50.

Full text
Abstract:
The article presents the generalized results of raising the determination of high school students in the process of physical education. With the help of the study of psychological and pedagogical literature on raising the determination of high school students in the process of physical education, it was established that, under modern conditions, little attention is paid to this problem in general secondary education institutions. A number of studies devoted to certain aspects of the problem of raising moral and volitional qualities of education seekers in the process of physical education have
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Generalized assignments problem"

1

Болмат, О. В. "Моделювання узагальненої задачі про призначення з підбором ефективного алгоритму". Master's thesis, Сумський державний університет, 2020. https://essuir.sumdu.edu.ua/handle/123456789/81392.

Full text
Abstract:
В роботі побудовано моделі для задачі про оптимальне призначення виконавцям (бібліотекам) робіт (сканування книг) за наявності обмежень на ресурси виконавців (час реєстрації для виконання робіт, обмежена кількість робіт на день) та обмеженні загального часу. Задача розв’язується з залученням евристичних алгоритмів, що застосовні для задач великого розміру. Побудовані алгоритми, що ґрунтуються на принципі оптимальності з динамічного програмування, та ітераційних послідовностях перестановок робіт з сортуванням. Наводяться результати програмної реалізації.<br>В роботі побудовано моделі для задачі
APA, Harvard, Vancouver, ISO, and other styles
2

Brommesson, Peter. "Solving the Generalized Assignment Problem by column enumeration based on Lagrangian reduced costs." Thesis, Linköping University, Department of Mathematics, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-5583.

Full text
Abstract:
<p>In this thesis a method for solving the Generalized Assignment Problem (GAP) is described. It is based on a reformulation of the original problem into a Set Partitioning Problem (SPP), in which the columns represent partial solutions to the original problem. For solving this problem, column generation, with systematic overgeneration of columns, is used. Conditions that guarantee that an optimal solution to a restricted SPP is optimal also in the original problem are given. In order to satisfy these conditions, not only columns with the most negative Lagrangian reduced costs need to be gener
APA, Harvard, Vancouver, ISO, and other styles
3

Karabulut, Ozlem. "Multi Resource Agent Bottleneck Generalized Assignment Problem." Master's thesis, METU, 2010. http://etd.lib.metu.edu.tr/upload/3/12611790/index.pdf.

Full text
Abstract:
In this thesis, we consider the Multi Resource Agent Bottleneck Generalized Assignment Problem. We aim to minimize the maximum load over all agents. We study the Linear Programming (LP) relaxation of the problem. We use the optimal LP relaxation solutions in our Branch and Bound algorithm while defining lower and upper bounds and branching schemes. We find that our Branch and Bound algorithm returns optimal solutions to the problems with up to 60 jobs when the number of agents is 5, and up to 30 jobs when the number of agents is 10, in less than 20 minutes. To find approximate solutions, we
APA, Harvard, Vancouver, ISO, and other styles
4

Jaramillo, Juan R. "The generalized machine layout problem." Morgantown, W. Va. : [West Virginia University Libraries], 2007. https://eidr.wvu.edu/etd/documentdata.eTD?documentid=5504.

Full text
Abstract:
Thesis (Ph. D.)--West Virginia University, 2007.<br>Title from document title page. Document formatted into pages; contains xi, 86 p. : ill. Includes abstract. Includes bibliographical references (p. 82-86).
APA, Harvard, Vancouver, ISO, and other styles
5

Tsakonas, Efthymios. "Convex Optimization for Assignment and Generalized Linear Regression Problems." Doctoral thesis, KTH, Signalbehandling, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-150338.

Full text
Abstract:
This thesis considers optimization techniques with applications in assignment and generalized linear regression problems. The first part of the thesis investigates the worst-case robust counterparts of combinatorial optimization problems with least squares (LS) cost functions, where the uncertainty lies on the linear transformation of the design variables. We consider the case of ellipsoidal uncertainty, and prove that the worst case robust LS optimization problem, although NP-hard, is still amenable to convexrelaxation based on semidefinite optimization. We motivate our proposed relaxation us
APA, Harvard, Vancouver, ISO, and other styles
6

Monori, Akos. "Task assignment optimization in SAP Extended WarehouseManagement." Thesis, Högskolan Dalarna, Datateknik, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:du-3598.

Full text
Abstract:
Nowadays in the world of mass consumption there is big demand for distributioncenters of bigger size. Managing such a center is a very complex and difficult taskregarding to the different processes and factors in a usual warehouse when we want tominimize the labor costs. Most of the workers’ working time is spent with travelingbetween source and destination points which cause deadheading. Even if a worker knowsthe structure of a warehouse well and because of that he or she can find the shortest pathbetween two points, it is still not guaranteed that there won’t be long traveling timebetween th
APA, Harvard, Vancouver, ISO, and other styles
7

PIGATTI, ALEXANDRE ALTOE. "MODELS AND ALGORITHMS FOR THE GENERALIZED ASSIGNMENT PROBLEM (PAG) AND APPLICATIONS." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2003. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=4132@1.

Full text
Abstract:
COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR<br>Esta dissertação estuda modelos e algoritmos para o Problema de Alocação Generalizada (PAG) . A motivação para este estudo foi uma nova aplicação do PAG: o Problema de Carregamento de Caminhões (PCC) . A pesquisa desenvolvida concentra-se no estudo e na proposta de algoritmos aproximados (metaeurísticas) e exatos para a resolução do PAG. Os algoritmos aproximados propostos baseiam-se em um conceito recentemente criado por Fischetti e Lodi (2003), que utiliza programação matemática inteira para a exploração eficiente de viz
APA, Harvard, Vancouver, ISO, and other styles
8

Woodcock, Andrew John. "Solving the generalized assignment problem : a hybrid Tabu search/branch and bound algorithm." Thesis, Loughborough University, 2007. https://dspace.lboro.ac.uk/2134/17881.

Full text
Abstract:
The research reported in this thesis considers the classical combinatorial optimization problem known as the Generalized Assignment Problem (GAP). Since the mid 1970's researchers have been developing solution approaches for this particular type of problem due to its importance both in practical and theoretical terms. Early attempts at solving GAP tended to use exact integer programming techniques such as Branch and Bound. Although these tended to be reasonably successful on small problem instances they struggle to cope with the increase in computational effort required to solve larger instanc
APA, Harvard, Vancouver, ISO, and other styles
9

ROCHA, DANIEL AMARAL DE MEDEIROS. "COMBINING METAHEURISTICS WITH MP SOLVERS, WITH APPLICATIONS TO THE GENERALIZED ASSIGNMENT PROBLEM (GAP)." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2009. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=15363@1.

Full text
Abstract:
COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR<br>Métodos que combinam estratégias normalmente encontradas em algoritmos metaeurísticos com técnicas para resolver problemas de programação inteira mista (MIP) têm apresentado ótimos resultados nos últimos anos. Este trabalho propõe dois novos algoritmos nessa linha: um algoritmo que faz pós-processamento nas soluções encontradas pelo resolvedor MIP. Os dois algoritmos utilizam um novo tipo de vizinhança, chamada de vizinhança elipsoidal, que possui fortes semelhanças com as técnicas de relinking de algoritmos PR e que neste trabalh
APA, Harvard, Vancouver, ISO, and other styles
10

Kim, Seon Ki. "Branch-and-Price Method for Stochastic Generalized Assignment Problem, Hospital Staff Scheduling Problem and Stochastic Short-Term Personnel Planning Problem." Diss., Virginia Tech, 2009. http://hdl.handle.net/10919/37487.

Full text
Abstract:
The work presented in this dissertation has been focused on exploiting the branch-and-price (BNP) method for the solution of various stochastic mixed integer programming problems (MIPs). In particular, we address the stochastic generalized assignment problem (SGAP), a hospital staff scheduling problem (HSSP), a stochastic hospital staff scheduling problem (SHSSP), and a stochastic short-term personnel planning problem (SSTPP). The BNP method has been developed in concert with the dual stabilization technique and other enhancements of this method for each of these problems. In view of an excess
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Generalized assignments problem"

1

Ma, Zhong. The generalized quadratic assignment problem. National Library of Canada, 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Wassenhove, Luk N. van. A set partitioning heuristic for the generalized assignment problem. INSEAD, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Foulds, L. R. A variation of the generalized assignment problem arising in the New Zealand dairy industry. Loughborough University Business School, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Holzbaur, Christoph. Neue lösungsansätze Für das Generalized-Assignment-Problem. GRIN Verlag GmbH, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Generalized assignments problem"

1

Nissim, Roy, Oded Schwartz, and Reut Shabo. "Challenges in Parallel Matrix Chain Multiplication." In Lecture Notes in Computer Science. Springer Nature Switzerland, 2024. https://doi.org/10.1007/978-3-031-74430-3_7.

Full text
Abstract:
AbstractMatrix chain multiplication is widely used in high-performance computing environments. Different parenthesis assignments, which determine the multiplication order, produce the same output but may significantly affect the runtime. Thus, finding the optimal parentheses assignment is crucial. Several algorithms, such as Godbole (1973) and Hu &amp; Shing (1982), have been proposed to address this optimization problem. However, they only focus on minimizing arithmetic operations and disregard inter-processor communication. In many cases, the inter-processor communication cost dominates the
APA, Harvard, Vancouver, ISO, and other styles
2

Findik, Ulvi, O. Erhun Kundakcioglu, and Saed Alizamir. "Generalized Assignment Problem." In Encyclopedia of Optimization. Springer Nature Switzerland, 2012. https://doi.org/10.1007/978-3-030-54621-2_200-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Martello, Silvano, and Paolo Toth. "Generalized assignment problems." In Algorithms and Computation. Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/3-540-56279-6_88.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Maniezzo, Vittorio, Marco Antonio Boschetti, and Thomas Stützle. "The Generalized Assignment Problem." In Matheuristics. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-70277-9_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Atserias, Albert, Phokion G. Kolaitis, and Simone Severini. "Generalized Satisfiability Problems via Operator Assignments." In Fundamentals of Computation Theory. Springer Berlin Heidelberg, 2017. http://dx.doi.org/10.1007/978-3-662-55751-8_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Alaei, Saeed, MohammadTaghi Hajiaghayi, and Vahid Liaghat. "The Online Stochastic Generalized Assignment Problem." In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-40328-6_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Neebe, Alan W., and Joseph B. Mazzola. "Procedures for Solving Bottleneck Generalized Assignment Problems." In Algorithms and Model Formulations in Mathematical Programming. Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/978-3-642-83724-1_24.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Yuan, Mindi, Chong Jiang, Shen Li, Wei Shen, Yannis Pavlidis, and Jun Li. "Message Passing Algorithm for the Generalized Assignment Problem." In Advanced Information Systems Engineering. Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-662-44917-2_35.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Garrett, Deon, and Dipankar Dasgupta. "Multiobjective Landscape Analysis and the Generalized Assignment Problem." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-92695-5_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Geibinger, Tobias, Lucas Kletzander, and Nysret Musliu. "Instance Space Analysis for the Generalized Assignment Problem." In Metaheuristics. Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-26504-4_30.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Generalized assignments problem"

1

Häggblom, Matilda. "Axiomatization of Approximate Exclusion." In 21st International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}. International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/kr.2024/38.

Full text
Abstract:
We define and axiomatize approximate exclusion atoms in the team semantic setting. A team is a set of assignments, which can be seen as a mathematical model of a uni-relational database. We say that an approximate exclusion atom is satisfied in a team if the corresponding usual exclusion atom is satisfied in a large enough subteam. We consider the implication problem for a set of approximate exclusion atoms and show that it is axiomatizable for consequences with a degree of approximation that is not too large. We prove the completeness theorem for usual exclusion atoms, currently missing from
APA, Harvard, Vancouver, ISO, and other styles
2

Xue-Jie Bai, Yan-Kui Liu, and Si-Yuan Shen. "Fuzzy generalized assignment problem with credibility constraints." In 2009 International Conference on Machine Learning and Cybernetics (ICMLC). IEEE, 2009. http://dx.doi.org/10.1109/icmlc.2009.5212355.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Grigorchuk, S. E., M. O. Krivosheev, and A. P. Pirozhnikova. "Generalized problem modelling on “block indicator” assignment." In 2017 International Conference on Industrial Engineering, Applications and Manufacturing (ICIEAM). IEEE, 2017. http://dx.doi.org/10.1109/icieam.2017.8076448.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Janosikova, L'Udmila. "Kernel Search for the Generalized Assignment Problem." In 2021 IEEE 25th International Conference on Intelligent Engineering Systems (INES). IEEE, 2021. http://dx.doi.org/10.1109/ines52918.2021.9512916.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Gunawan, Aldy, Kien Ming Ng, Kim Leng Poh, and Hoong Chuin Lau. "Hybrid metaheuristics for solving the quadratic assignment problem and the generalized quadratic assignment problem." In 2014 IEEE International Conference on Automation Science and Engineering (CASE). IEEE, 2014. http://dx.doi.org/10.1109/coase.2014.6899314.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Sun, Tingting, Yang Xu, and Qingyi He. "Improving Asynchronous Search for Distributed Generalized Assignment Problem." In 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT). IEEE, 2012. http://dx.doi.org/10.1109/wi-iat.2012.142.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bozdogan, Ali Onder, Murat Efe, and Asim Egemen Yilmaz. "Swarm Optimization Approaches for the Generalized Assignment Problem." In 2007 IEEE 15th Signal Processing and Communications Applications. IEEE, 2007. http://dx.doi.org/10.1109/siu.2007.4298809.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Fatih Tasgetiren, M., P. N. Suganthan, Tay Jin Chua, and Abdullah Al-Hajri. "Differential Evolution Algorithms for the Generalized Assignment problem." In 2009 IEEE Congress on Evolutionary Computation (CEC). IEEE, 2009. http://dx.doi.org/10.1109/cec.2009.4983269.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Beham, Andreas, Stefan Wagner, and Michael Affenzeller. "Algorithm selection on generalized quadratic assignment problem landscapes." In GECCO '18: Genetic and Evolutionary Computation Conference. ACM, 2018. http://dx.doi.org/10.1145/3205455.3205585.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Lim, Wee Loon, Muhammad A'rif Shah Alias, and Habibollah Haron. "A hybrid metaheuristic for the generalized quadratic assignment problem." In 2015 IEEE Student Conference on Research and Development (SCOReD). IEEE, 2015. http://dx.doi.org/10.1109/scored.2015.7449380.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Generalized assignments problem' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography