Interfaces, Vol. 20, No. 4, The Practice of Mathematical Programming (Jul. - Aug., 1990), pp. 133-149 (17 pages) The auction algorithm is an intuitive method for solving the classical assignment ...

In this paper, we solve a residing combinatorial optimization problem commonly known as graph-based pairwise assignment, maximum bipartite cardinality matching, min-cut, or max-sum problem by the ...

An example of the quadratic assignment problem (QAP) is the facility location problem, in which n facilities are assigned, at minimum cost, to n sites. Between each pair of facilities, there is a ...

"Assignment problems (for example, networks of workers and jobs they could be assigned to)\n", "Planning problems (for example, critical path analysis for project planning)\n", ...

The Berth Allocation Problem (BAP) is the problem of allocating berthing spaces and scheduling container vessels on these spaces so as to minimize total weighted time. We study a version of BAP in ...

Simulated Annealing (SA) offers several advantages for Linear Programming (LP) problems, such as the ability to handle nonlinear, discrete, or mixed-integer problems which are difficult or ...