Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 10,000 papers for “Assignment problem”

Assignment problem

Soňa Partynglová · Digital Repository (National Repository of Grey Literature) · 2007

This thesis is describing one of the most popular method (Hungarian method) for solving the assignment problem. This type of problem is usually just defined by most the writers instead of it's real treatement. The main target of this thesis was to resume the knowledge of this problem, to define it carefully and to use Hungarian method for finding the best solution. This thesis also shows the differences between solving this problem by minimalisation or maximalization of the function of effectiveness and this thesis also shows how to solve the unbalanced tasks.

Cited by 0

The Assignment Problem

Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni et al. · HAL (Le Centre pour la Communication Scientifique Directe) · 2018

International audience

Cited by 0Open access

Node assignment problem

Shubham Vishwakarma, K. S. Sudeep · 2013

We consider the following Constraint Satisfaction Problem: Given a set C of constraints in which each constraint has a subset of Variables V that maps to the set of nodes N(T) of a given tree T . Does their exist c: V → N(T) such that for each constraint of C, the variables can take one of the nodes specified in that constraint as its values. This node assignment to the variables is said to be feasible if it satisfies all the constraints. In this paper, we propose an algorithm which will refine the constraints based on the intersection property and will reduce the recursion. Finally the constraints formed do not have intersection with other constraints. We get a feasible assignment by permuting the variables and mapping it to the node set.

Cited by 0

Generalized assignment problem

Markéta Kocourková · Digital Repository (National Repository of Grey Literature) · 2012

The generalized assignment problem is a topic of this thesis. The knapsack problem in general belongs to among classical operation research problems and belongs to the category of integer linear programming. It is very often formulated as a binary problem or 0-1. There are several types of knapsack problems which are described in this thesis. Some of the knapsack problems are so large and although exist exact algorithms for finding optimal solution, heuristics are rather used. They are not so exact but they find solution much earlier. Therefore some of the knapsack problems belong to NP-hard problems. This thesis is focused on one type particularly, the generalized assignment problem, which is demonstrated on practical example how the problem can be used.

Cited by 0

Quadratic assignment problem

Augusto, Edma Tarine Macedo · Portuguese National Funding Agency for Science, Research and Technology (RCAAP Project by FCT) · 2016

O Problema de Afetação Quadrática, Quadratic Assignment Problem (QAP) tem recebido a atenção da comunidade académica devido a sua importância e complexidade. Este é um dos problemas mais difíceis de otimização combinatória. É fácil de descrever, não é tão fácil de formular e é muito difícil de resolver. O QAP foi introduzido por Koopmans e Beckman em 1957, num contexto económico. A preocupação destes autores era afetar estabelecimentos industriais em locais predeterminados, de tal maneira que o custo de transporte fosse minimizado. Na sua aplicação, o custo é o produto dos termos da matriz fluxo e da matriz distância. Desde o surgimento do QAP uma miríade de aplicações tem emergido. Algumas formulações do QAP apresentadas na literatura foram usadas para resolver o problema com base na atividade de picking. A atividade de picking normalmente representa cerca 50% dos custos de trabalho direto num armazém. Esta atividade despende 50% do seu tempo total em deslocações. Na operação de um armazém de picking, a tomada de decisão quanto à localização dos produtos pode condicionar os custos de deslocação entre as posições dos produtos. Daí a pertinência de modelar o QAP na operação de um armazém de picking. Para tal, inicialmente gerou-se instâncias com dados aleatórios numa aplicação programada em linguagem VBA (Visual Basic Application). De seguida, modelou-se em linguagem AMPL (A Mathematical Programming Language), algumas formulações apresentadas na literatura, designadas por: linearização de Lawler, linearização de Frieze e Yadegar e a linearização de Adam e Johnson. Para serem submetidas no servidor NEOS server (Network-Enabled Optimization System), com as instâncias geradas. As instâncias também foram submetidas no LPSolve e na aplicação da heurística de pesquisa local. Gerou-se uma heurística de pesquisa local em linguagem VBA tendo como suporte o Microsoft Excel. O servidor NEOS server apresentou resultados para instâncias de dimensão até =31. O LPSolve não consegue resolver instâncias de grandes dimensões em tempo computacional aceitável devido ao grande número de variáveis e restrições, uma vez que o LPSolve só resolve problemas com formulação linear inteira mista. A heurística de pesquisa local programada em linguagem VBA obteve resultados em todas instâncias geradas para o propósito deste trabalho.

Cited by 0

Quadratic Assignment Problem

Masoumeh Bayat, Mahdieh Sedghi · Contributions to management science · 2009

The quadratic assignment problem (QAP) in location Theory is the problem of locating facilities the cost of placing a facility depends on the distances from other facilities and also the interaction with other facilities. QAP was introduced by Koopmans and Beckman in 1957 who were trying to model a facilities location problem. It is possible to formulate some classic problems of combinatorial optimization, such as the traveling salesman, maximum clique and graph partitioning problems as a QAP. The QAP belongs to the class of NP-complete problems and is considered one of the most difficult combinatorial optimization problems. Exact solution strategies for the QAP have been unsuccessful for large problem (approximately N ≤ 25).

Cited by 7