
	Where results make sense

Topic: Assignment problem

Related Topics

Traveling salesman problem

Linear programming

Approximation algorithm

Maximal flow problem

George Dantzig

Genetic algorithm

Regression analysis

Operations research

Ordinary differential equation

Nearest neighbour algorithm

Tomorrow is Yesterday

Gary Seven

Television pilot

Perfect competition

Leonard McCoy

In the News (Mon 28 May 12)

EXECUTIVE POWER

Iran

ANALYSIS

Pakistan

Family compact

	Assignment problem - Wikipedia, the free encyclopedia
		The assignment problem is one of the fundamental combinatorial optimization problems in the branch of optimization or operations research in mathematics.
		The Hungarian algorithm is one of many algorithms that have been devised that solve the linear assignment problem within time bounded by a polynomial expression of the number of agents.
		The assignment problem is a special case of the transportation problem, which is a special case of the maximal flow problem, which in turn is a special case of a linear program.
	en.wikipedia.org /wiki/Assignment_problem (889 words)

	Travelling salesman problem - Wikipedia, the free encyclopedia
		The problem is of considerable practical importance, apart from evident transportation and logistics areas.
		The problem has been shown to be NP-hard (more precisely, it is complete for the complexity class FP ; see the function problem article), and the decision problem version ("given the costs and a number x, decide whether there is a roundtrip route cheaper than x") is NP-complete.
		The problem remains NP-hard even for the case when the cities are in the plane with Euclidean distances, as well as in a number of other restrictive cases.
	en.wikipedia.org /wiki/Traveling_salesman_problem#Algorithms (2220 words)

	Models - Operations Research Models and Methods
		The linear assignment problem just described is one of the simplest of the combinatorial problems and can be solved with linear programming as well as with several special purpose algorithms.
		There are a number of problems whose solution is a permutation that that are not so easy to solve including the quadratic assignment problem and the facility location problem.
		For the linear assignment problem a cost is given for each machine-task assignment and the objective is to find the permutation that minimizes the sum of the assignment costs.
	www.me.utexas.edu /~jensen/ORMM/models/unit/combinatorics/permute.html (1015 words)

	Assignment Problem (Site not responding. Last check: 2007-10-09)
		A typical assignment problem, presented in the classic manner, is shown in Fig.
		The problem is to find the minimum cost matching of machines to jobs.
		The only relevant parameter for the assignment model is arc cost (not shown in the figure for clarity) ; all other parameters should be set to default values.
	www.me.utexas.edu /~jensen/models/network/net9.html (143 words)

	AMPL in Action: "Balanced" Assignment
		The person who first brought the problem to my attention was a database specialist; it had landed on his desk for the seemingly logical reason that the names of the participants were in a database file, and the dinner assignments were to be added as a record in that file.
		The linear objective function of the textbook assignment problem could not be made to represent "diversity" in the desired sense, so it was fortunate that the problem gave me plenty of leeway in choosing an objective.
		To reduce the size and symmetry of the problem, I lumped together people who had the same values for all four characteristics; such people were indistinguishable from the standpoint of the assignment.
	cm.bell-labs.com /cm/cs/what/ampl/cases/balassign.html (1619 words)

	IDS 3305 Problem Definition Assignment (Site not responding. Last check: 2007-10-09)
		The problem should be of a scope that allows focused research and development of practical solutions.
		Your job is to define a problem that is large enough to be significant and worth working on but small enough for us to tackle in a one-semester course.
		The problem you define should (1) be clearly related to "information overload" and (2) have a clearly detrimental effect on individuals and social groups.
	itech.fgcu.edu /faculty/bsullivan/3305ProbDef.htm (530 words)

	[No title]
		The related combinatorial problem of assigning railcars to positions on the platform and unloading equipment to railcars is modeled as a mixed-integer nonlinear program.
		Using a set covering formulation, the problem is modeled as an integer linear program, whose linear programming relaxation yields a tight lower bound.
		The slot switching configurations are determined through the solution of a time slot assignment problem, which is equivalent to the decomposition of a nonnegative traffic matrix into the sum of a family of switching mode matrices.
	www.research.att.com /~mgcr/grasp/gannbib/bibtex/assignment.bib (1015 words)

	Assignment Problem (Site not responding. Last check: 2007-10-09)
		A special case of the transportation problem is the assignment problem which occurs when each supply is 1 and each demand is 1.
		This is a transportation problem with all supplies and demands equal to 1, so it is an assignment problem.
		Note that a balanced problem must have the same number of supplies and demands, so we must add a dummy machine (corresponding to receiving no machine) and assign a zero cost for assigning the dummy machine to a plant.
	mat.gsia.cmu.edu /classes/networks/node7.html (179 words)

	Concept Assignment Problem (Site not responding. Last check: 2007-10-09)
		The problem is trying to understand when a programmer tries associate the informal lines of code to a broader understanding that humans can use to understand the problem as a whole.
		A problem associated with DESIRE is that some programs due not have ideal conditions to help aid the programmer in fully understanding the problem.
		This may solve the simplest problems of program understanding but for a tool to significantly aid with this process the tool must understand how the developer works in order to help the programmer understand the problem.
	www2.umassd.edu /cisw3/coursepages/pages/CIS411/notes/biggerstaff.html (400 words)

	[No title]
		In the case of the traveling salesman problem, the mathematical structure is a graph where each city is denoted by a point (or node) and lines are drawn connecting every two nodes (called arcs or edges).
		Of course, the symmetric problem is a special case of the asymmetric one, but practical experience has shown that algorithms for the asymmetric problem perform, in general, badly on symmetric problems.
		Besides being a "polytope" of a difficult combinatorial optimization problem from a complexity theory point of view, there are important cases of practical problems that can be formulated as TSP problems and many other problems are generalizations of this problem.
	iris.gmu.edu /~khoffman/papers/trav_salesman.html (2481 words)

	Quadratic Assignment and Related Problems Panos M. Pardalos and Henry Wolkowicz, Editors
		It is not unusual today to solve large-scale combinatorial problems, such as maximum clique problems on graphs with thousands of vertices and millions of edges, or traveling salesman problems with several thousands of cities.
		There is an exception in the class of combinatorial optimization problems, the quadratic assignment problem (QAP), which is still considered to be of large-scale when, where is the problem dimension.
		From the computational complexity point of view the QAP is one of the most difficult problems to solve, as it is in the class of -hard problems.
	dimacs.rutgers.edu /Volumes/Vol16.html (600 words)

	The Traffic Assignment Problem
		It is a nonlinear problem which often has to be solved repeatedly or, in the case of route guidance systems, instantaneously.
		The idea is to decompose the problem into similar subproblems, by origin and destination pairs, and to solve the subproblems in parallel by algorithms for single-commodity network flows with quadratic link costs.
		In this setting we define two problems to be similar if they occupy the same amount of memory and if the same algorithm, applied separately to each of them, solves the problems.
	www.pdc.kth.se /info/reports/1992/section2_8_5.html (396 words)

	PAPER 6 ASSIGNMENT: PROBLEM/SOLUTION ESSAY (Site not responding. Last check: 2007-10-09)
		To demonstrate that a particular (and reasonably specific) problem exists, through careful reasoning, use of examples, and--if you wish--support from one or two sources...and to argue for a particular (and reasonably specific) solution (or partial solution) to this problem, using good reasoning, effective examples, and--if you wish-- support from one or two other sources.
		You are arguing this point, and supporting your argument, on the assumption that not everyone will agree that the problem exists or that it is as severe as you believe it is or that the problem requires urgent action.
		See the assignment sheet from Paper 3 for additional discussion of these elements, especially with regard to your thesis statement.
	www.siue.edu /~smoiles/Ppr6-101.html (1056 words)

	The Quadratic Assignment Problem (Site not responding. Last check: 2007-10-09)
		In a standard problem in location theory, we are given a set of n locations and n facilities, and told to assign each facility to a location.
		Our aim is to find the assignment that minimizes this cost, and this problem is precisely a quadratic assignment problem.
		Branch and Bound are used to solve problems of this size.
	www-unix.mcs.anl.gov /otc/Guide/CaseStudies/qap (262 words)

	IDS 3301 Problem Definition Assignment (Site not responding. Last check: 2007-10-09)
		In this paper, which should be three to five (3-5) pages long, each student will identify a problem associated with "Western ways of knowing" and define the scope and effects of that problem.
		To do this effectively, you must clearly define what your problem is, in what contexts it operates, why it is significant, and how we can research it and learn more about its history and possible solutions.
		The problem you define should (1) be clearly related to "western assumptions about knowing" and (2) have a clearly detrimental effect on individuals and social groups.
	itech.fgcu.edu /faculty/bsullivan/3301ProbDef.htm (564 words)

	On the Wavelength Assignment Problem in Multifiber WDM Star and Ring Networks
		This paper studies the off-line wavelength assignment problem in star and ring networks that deploy multiple fibers between nodes and use wavelength division multiplexing (WDM) for transmission.
		In particular, sharper per-fiber bounds on the number of required wavelengths are derived for the multifiber version of the assignment problem in star and ring networks.
		Additionally, the complexity of the problem is studied and several constrained versions of the problem are also considered for star and ring networks.
	www.comsoc.org /net/private/2001/feb/60_09net01-li.html (583 words)

	[No title] (Site not responding. Last check: 2007-10-09)
		If I understand you correctly, the problem is this: Let a[i,j] be person i's preference for person j.
		You want to assign the people to the groups so each group has a specified number of people, each person is in one group, and the sum of the a[i,j] for i and j in the same group is maximized.
		I'm pretty sure this is an NP-complete problem (it can be thought of as a version of the Quadratic Assignment Problem).
	www.math.niu.edu /~rusin/known-math/96/distance.matching (247 words)

	How we solved nug30
		The quadratic assignment problem is among the most complex combinatorial optimization problems.
		It belongs to the class of NP complete problems and therefore the time spent by any exact algorithm will grow exponentially with the size of the problem.
		Estimates to solve this problem with the best of our desktop workstation were around 7 years (slighly less than the age of the universe though...).
	www-unix.mcs.anl.gov /metaneos/nug30/solution.html (858 words)

	A COMPARATIVE STUDY OF AN AIRCRAFT ASSIGNMENT PROBLEM AT (Site not responding. Last check: 2007-10-09)
		The assignment of the oncoming airplanes to the gates is thus a very important daily routine for the ground facilities managers.
		In this study, the assignment of the airplanes to the gates is modeled as a Quadratic Assignment Problem (QAP).
		Finally, the best heuristic is recommended for practical problem solving in terms of the improvement it can make over the current assignment and the execution time it requires.
	www.ijienet.org /Abstracts/Volume1/v1n3p3.htm (184 words)

	Decision Sciences: conference paper-reviewer assignment problem, The (Site not responding. Last check: 2007-10-09)
		Conference organizers often face the following problem: Given a collection of submitted papers, select a subset to be presented at the conference.
		An important feature of the solution we find is that each paper is sent to at least one reviewer who is "as expert as possible" for that paper.
		A major component of the problem is modeled as a bottleneck version of a capacitated transshipment problem.
	www.findarticles.com /p/articles/mi_qa3713/is_199907/ai_n8836218 (434 words)

	assignment problem help needed - Dev Articles
		Your professor gave you this assignment for a bloody reason.
		If you have specific questions regarding specific problems (meaning that you already have code to back it up), post them and we can help you.
		But do not ask us to do the entire thing for you -- unless you are offering an ungodly sum of cash and a free vacation to the Bahamas with it.
	forums.devarticles.com /c-c-help-52/assignment-problem-help-needed-22027.html (292 words)

	[No title] (Site not responding. Last check: 2007-10-09)
		The problem evolved out of trying to > track moving particles given an unordered list of their coordinates over > time.
		One example would be minimizing the sum over > all matched pairs of the euclidian distance between the pair.
		This is an example of what's known as an Assignment Problem.
	www.math.niu.edu /~rusin/known-math/99/assignmentprob (245 words)

	Example 3.12: An Assignment Problem
		The sparse input format provides a great deal of flexibility in model specification so that, in many cases, the DATA step can be used to generate the matrix.
		The following assignment problem illustrates some techniques in matrix generation.
		The report shown in Output 3.12.2 gives the assignment of customer, grade of cloth, and machine that maximizes the return and does not violate the machine resource availability.
	www.asu.edu /it/fyi/unix/helpdocs/statistics/sas/sasdoc/sashtml/ormp/chap3/sect57.htm (694 words)

	The assignment problem (Site not responding. Last check: 2007-10-09)
		As the name indicates, the problem is about assigning some objects to some other objects so that certain requirements are satisfied as much as possible.
		If you are to assign office suites to your company employees ranging from the CEO to a clerk, you should know a little about assignment problem and ways to solve this problem.
		This case study will tell you what the problem is about, its detailed formulations and implementations.
	www-fp.mcs.anl.gov /otc/Guide/CaseStudies/assign (117 words)

	Brian's Digest: Software and Source Codes (Site not responding. Last check: 2007-10-09)
		My ANSI C subroutine library has a subroutine which solves the transportation problem, of which assignment problem is a special case.
		Unless you are solving relatively small cases, there is no point in using codes for LP or the Transportation problem (of which LAP is a special case).
		I can also send you (or anyone interested) a Zip-file containing the Jonker and Volgenant codes for the standard Linear Assignment Problem (dense and sparse cases) and the Bottleneck Assignment Problem (all codes in Pascal and Fortran).
	www.worms.ms.unimelb.edu.au /digest/software/assignment97.html (313 words)

	IT problem area assignment
		Introduction: The intent of this assignment is (1) to help students develop closer working relationships, and (2) to shorten the learning curve with respect to acquiring skills in the development of formal papers and in working as members of a group whose communication channels include the Internet.
		Jointly select a problem area in the application and use of information technology in society.
		The problem-area description must be based on at least 5 sources, and the sources must include at least 2 printed sources and 2 Web sources.
	www.gslis.utexas.edu /~l38613dw/website_spring_03/assignments/it_problem.html (434 words)

	Assignment/Problem Generator Test Plan (Site not responding. Last check: 2007-10-09)
		For the integration phase, creating assignments by pulling problems that were entered in the Problem Generator.
		This is so because the Assignment Generator relies heavily on the Problem Generator for data retrieval and its main purpose, generating assignments.
		The professor of the class has requested that you generate the next homework assignment so that it will be ready for next week.
	www.cc.gatech.edu /classes/RWL/Projects/et/Docs/Testing/int.agpg.test.html (383 words)

	QAPLIB Home Page
		The Quadratic Assignment Problem (QAP) has remained one of the great challenges in combinatorial optimization.
		It is still considered a computationally nontrivial task to solve modest size problems, say of size n=25.
		This update included many new problem instances, generated by several researchers for their own testing purposes.
	www.seas.upenn.edu /qaplib (603 words)

	Anycast Routing and Wavelength Assignment Problem on WDM Network -- DIN E88-B (10): 3941 -- IEICE Transactions on ...
		Anycast Routing and Wavelength Assignment Problem on WDM Network -- DIN E88-B (10): 3941 -- IEICE Transactions on Communications
		problem is to find a set of light-paths, one for each source,
		ARWA problem is formulated and studied; since ARWA problem is
	ietcom.oxfordjournals.org /cgi/content/short/E88-B/10/3941?rss=1 (211 words)

Try your search on: Qwika (all wikis)