To see the other types of publications on this topic, follow the link: Generalized assignments problem.

Journal articles on the topic 'Generalized assignments problem'

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

Select a source type:

Consult the top 50 journal articles for your research 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.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

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
11

Büther, M. "Reducing the elastic generalized assignment problem to the standard generalized assignment problem." Journal of the Operational Research Society 61, no. 11 (2010): 1582–95. http://dx.doi.org/10.1057/jors.2009.108.

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

S., Subasri. "Fuzzy Assignment Problem with Ranking of Generalized Nonagonal Fuzzy Number Using Centroid of Centroid." Journal of Advanced Research in Dynamical and Control Systems 12, SP4 (2020): 978–83. http://dx.doi.org/10.5373/jardcs/v12sp4/20201570.

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

Mazzola, J. B., and A. W. Neebe. "Bottleneck generalized assignment problems." Engineering Costs and Production Economics 14, no. 1 (1988): 61–65. http://dx.doi.org/10.1016/0167-188x(88)90053-5.

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

Khatibi, Arash, and Sheldon H. Jacobson. "Generalized Sequential Stochastic Assignment Problem." Stochastic Systems 8, no. 4 (2018): 293–306. http://dx.doi.org/10.1287/stsy.2018.0017.

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

Nauss, R. M. "The elastic generalized assignment problem." Journal of the Operational Research Society 55, no. 12 (2004): 1333–41. http://dx.doi.org/10.1057/palgrave.jors.2601806.

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

Martello, Silvano, and Paolo Toth. "The bottleneck generalized assignment problem." European Journal of Operational Research 83, no. 3 (1995): 621–38. http://dx.doi.org/10.1016/0377-2217(93)e0271-x.

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

Karsu, Özlem, and Meral Azizoğlu. "Bicriteria multiresource generalized assignment problem." Naval Research Logistics (NRL) 61, no. 8 (2014): 621–36. http://dx.doi.org/10.1002/nav.21607.

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

Jeet, V., and E. Kutanoglu. "Lagrangian relaxation guided problem space search heuristics for generalized assignment problems." European Journal of Operational Research 182, no. 3 (2007): 1039–56. http://dx.doi.org/10.1016/j.ejor.2006.09.060.

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

Ufuoma, Okoh. "A Novel, Efficient and Generalised Approach to Boolean Satisfiability." Journal of Engineering Research and Reports 26, no. 3 (2024): 91–103. http://dx.doi.org/10.9734/jerr/2024/v26i31096.

Full text
Abstract:
One question which has occupied mathematicians, engineers and scientists of this age is the problem of Boolean satisfiability (SAT) which asks whether a given CNF formula has at least a satisfying assignment. The goal of this work is to present a novel, efficient and general method of deciding SAT and finding all the satisfying assignments of CNF formulas. This method is powerful as it employs resolution identities in transforming clauses without a particular variable into clauses with that variable.
APA, Harvard, Vancouver, ISO, and other styles
20

Wu, Wen Bo, Yu Fu Jia, and Hong Xing Sun. "A Determinant Elimination Method for Bottleneck Assignment and Generalized Assignment Problems." Applied Mechanics and Materials 239-240 (December 2012): 1522–27. http://dx.doi.org/10.4028/www.scientific.net/amm.239-240.1522.

Full text
Abstract:
The bottleneck assignment (BA) and the generalized assignment (GA) problems and their exact solutions are explored in this paper. Firstly, a determinant elimination (DE) method is proposed based on the discussion of the time and space complexity of the enumeration method for both BA and GA problems. The optimization algorithm to the pre-assignment problem is then discussed and the adjusting and transformation to the cost matrix is adopted to reduce the computational complexity of the DE method. Finally, a synthesis method for both BA and GA problems is presented. The numerical experiments are
APA, Harvard, Vancouver, ISO, and other styles
21

Atserias, Albert, Phokion G. Kolaitis, and Simone Severini. "Generalized satisfiability problems via operator assignments." Journal of Computer and System Sciences 105 (November 2019): 171–98. http://dx.doi.org/10.1016/j.jcss.2019.05.003.

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

Özbakir, Lale, Adil Baykasoğlu, and Pınar Tapkan. "Bees algorithm for generalized assignment problem." Applied Mathematics and Computation 215, no. 11 (2010): 3782–95. http://dx.doi.org/10.1016/j.amc.2009.11.018.

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

Ren, Jianfeng. "THE DISTRIBUTIONALLY ROBUST GENERALIZED ASSIGNMENT PROBLEM." Far East Journal of Applied Mathematics 116, no. 1 (2023): 47–54. http://dx.doi.org/10.17654/0972096023003.

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

Simić, Petar D. "Constrained Nets for Graph Matching and Other Quadratic Assignment Problems." Neural Computation 3, no. 2 (1991): 268–81. http://dx.doi.org/10.1162/neco.1991.3.2.268.

Full text
Abstract:
Some time ago Durbin and Willshaw proposed an interesting parallel algorithm (the “elastic net”) for approximately solving some geometric optimization problems, such as the Traveling Salesman Problem. Recently it has been shown that their algorithm is related to neural networks of Hopfield and Tank, and that they both can be understood as the semiclassical approximation to statistical mechanics of related physical models. The main point of the elastic net algorithm is seen to be in the way one deals with the constraints when evaluating the effective cost function (free energy in the thermodyna
APA, Harvard, Vancouver, ISO, and other styles
25

Gottlieb, Elsie Sterbin. "Generalized cover facet inequalities for the generalized assignment problem." Optimization 59, no. 2 (2010): 223–33. http://dx.doi.org/10.1080/02331930801951124.

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

McKendall, Alan, and Yugesh Dhungel. "A Simulated Annealing Algorithm for the Generalized Quadratic Assignment Problem." Algorithms 17, no. 12 (2024): 540. http://dx.doi.org/10.3390/a17120540.

Full text
Abstract:
The generalized quadratic assignment problem (GQAP) involves assigning a set of facilities to a set of locations such that the sum of the assignment and transportation costs is minimized. Unlike the traditional one-to-one assignment problem, the GQAP is a many-to-one assignment problem. That is, multiple facilities can be assigned to each location without exceeding the capacity of the location. This research was motivated by the problem of assigning multiple facilities (e.g., machines or equipment) to locations at manufacturing plants. Another well-known application of the GQAP includes the as
APA, Harvard, Vancouver, ISO, and other styles
27

Thorani, Y. L. P., and N. Ravi Shankar. "Fuzzy assignment problem with generalized fuzzy numbers." Applied Mathematical Sciences 7 (2013): 3511–37. http://dx.doi.org/10.12988/ams.2013.34228.

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

Krumke, Sven O., and Clemens Thielen. "The generalized assignment problem with minimum quantities." European Journal of Operational Research 228, no. 1 (2013): 46–55. http://dx.doi.org/10.1016/j.ejor.2013.01.027.

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

Rainwater, Chase, Joseph Geunes, and H. Edwin Romeijn. "The generalized assignment problem with flexible jobs." Discrete Applied Mathematics 157, no. 1 (2009): 49–67. http://dx.doi.org/10.1016/j.dam.2008.04.017.

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

Arora, Shalini, and M. C. Puri. "Minimization of Makespan in Generalized Assignment Problem." OPSEARCH 36, no. 4 (1999): 360–73. http://dx.doi.org/10.1007/bf03398589.

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

Lorena, Luiz Antonio N., and Marcelo G. Narciso. "Relaxation heuristics for a generalized assignment problem." European Journal of Operational Research 91, no. 3 (1996): 600–610. http://dx.doi.org/10.1016/0377-2217(95)00041-0.

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

Dyer, Martin, and Alan Frieze. "Probabilistic analysis of the generalised assignment problem." Mathematical Programming 55, no. 1-3 (1992): 169–81. http://dx.doi.org/10.1007/bf01581197.

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

Kar, Supriya, Kajla Basu, and Sathi Mukherjee. "Solution of a class of generalized assignment problem." Journal of Intelligent & Fuzzy Systems 33, no. 3 (2017): 1687–97. http://dx.doi.org/10.3233/jifs-17086.

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

Tamaki, Mitsushi. "A Generalized Problem of Optimal Selection and Assignment." Operations Research 34, no. 3 (1986): 486–93. http://dx.doi.org/10.1287/opre.34.3.486.

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

Romeijn, H. Edwin, and Dolores Romero Morales. "Generating Experimental Data for the Generalized Assignment Problem." Operations Research 49, no. 6 (2001): 866–78. http://dx.doi.org/10.1287/opre.49.6.866.10021.

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

Jörnsten, K. O., and P. Värbrand. "A hybrid algorithm for the generalized assignment problem." Optimization 22, no. 2 (1991): 273–82. http://dx.doi.org/10.1080/02331939108843666.

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

Lee, Sang-Un. "Time-Cost Optimization Algorithm for Generalized Assignment Problem." Journal of Korean Institute of Information Technology 14, no. 5 (2016): 147. http://dx.doi.org/10.14801/jkiit.2016.14.5.147.

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

Ramadan, Mohamed A., and Ehab A. El-Sayed. "A generalized single-input mixed eigenvalue assignment problem." Journal of Vibration and Control 17, no. 12 (2010): 1851–61. http://dx.doi.org/10.1177/1077546310382807.

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

Fadaei, Salman, and Martin Bichler. "Generalized assignment problem: Truthful mechanism design without money." Operations Research Letters 45, no. 1 (2017): 72–76. http://dx.doi.org/10.1016/j.orl.2016.12.003.

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

Shmoys, David B., and Éva Tardos. "An approximation algorithm for the generalized assignment problem." Mathematical Programming 62, no. 1-3 (1993): 461–74. http://dx.doi.org/10.1007/bf01585178.

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

Gottlieb, Elsie Sterbin, and M. R. Rao. "The generalized assignment problem: Valid inequalities and facets." Mathematical Programming 46, no. 1-3 (1990): 31–52. http://dx.doi.org/10.1007/bf01585725.

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

Gavish, Bezalel, and Hasan Pirkul. "Algorithms for the Multi-Resource Generalized Assignment Problem." Management Science 37, no. 6 (1991): 695–713. http://dx.doi.org/10.1287/mnsc.37.6.695.

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

Fadaei, Salman, and Martin Bichler. "A Truthful Mechanism for the Generalized Assignment Problem." ACM Transactions on Economics and Computation 5, no. 3 (2017): 1–18. http://dx.doi.org/10.1145/3105787.

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

Zhang, Cai Wen, and Hoon Liong Ong. "An efficient solution to biobjective generalized assignment problem." Advances in Engineering Software 38, no. 1 (2007): 50–58. http://dx.doi.org/10.1016/j.advengsoft.2006.06.003.

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

Liu, Linzhong, Haibo Mu, Yubo Song, Haiyan Luo, Xiaojing Li, and Fang Wu. "The equilibrium generalized assignment problem and genetic algorithm." Applied Mathematics and Computation 218, no. 11 (2012): 6526–35. http://dx.doi.org/10.1016/j.amc.2011.12.025.

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

Amini, Mohammad M., and Michael Racer. "A hybrid heuristic for the generalized assignment problem." European Journal of Operational Research 87, no. 2 (1995): 343–48. http://dx.doi.org/10.1016/0377-2217(94)00154-5.

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

Racer, Michael, and Mohammad M. Amini. "A robust heuristic for the Generalized Assignment Problem." Annals of Operations Research 50, no. 1 (1994): 487–503. http://dx.doi.org/10.1007/bf02085655.

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

Cohen, Reuven, Liran Katzir, and Danny Raz. "An efficient approximation for the Generalized Assignment Problem." Information Processing Letters 100, no. 4 (2006): 162–66. http://dx.doi.org/10.1016/j.ipl.2006.06.003.

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

Laguna, Manuel, James P. Kelly, JoséLuis González-Velarde, and Fred Glover. "Tabu search for the multilevel generalized assignment problem." European Journal of Operational Research 82, no. 1 (1995): 176–89. http://dx.doi.org/10.1016/0377-2217(93)e0174-v.

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

Hahn, Peter M., Bum-Jin Kim, Monique Guignard, J. MacGregor Smith, and Yi-Rong Zhu. "An algorithm for the generalized quadratic assignment problem." Computational Optimization and Applications 40, no. 3 (2007): 351–72. http://dx.doi.org/10.1007/s10589-007-9093-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
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!