scispace - formally typeset
Proceedings ArticleDOI

The multidimensional assignment problem with application

Hassen T. Dorrah, +1 more
- pp 1154-1157
Reads0
Chats0
TLDR
In this paper, the mathematical foundation of a special class of the symmetric multidimensional assignment problem is presented as a generalization of the well-known two-dimensional assignment model.
Abstract
The mathematical foundation of a special class of the symmetric multidimensional assignment problem is presented as a generalization of the well-known two-dimensional assignment model. The formulation is based on constructing a multidimensional performance index for the problem, to be optimized such that one assignment is attained at each layer. A procedure is suggested for solving such a formulation, based on modifying its elements until one independent zero component is attained in each plane. A case study of the limestone selection in a quarry for cement manufacturing is furnished to demonstrate the efficacy of the approach. It is shown that the optimal strategy, based on multidimensional assignment formulation, is effective and tends to considerably reduce the resulting fluctuations in raw material quality. >

read more

Citations
More filters
Journal ArticleDOI

An LP-based algorithm for the data association problem in multitarget tracking

TL;DR: This work presents a linear programming (LP) based approach for solving the data association problem (DAP) in multiple target tracking using an iterated K-scan sliding window technique and presents a compact formulation of the DAP.
Proceedings ArticleDOI

Unsupervised discovery of facial events

TL;DR: A temporal clustering algorithm, Aligned Cluster Analysis (ACA), and a multi-subject correspondence algorithm for matching expressions are proposed to discover facial events directly from video of naturally occurring facial behavior, without recourse to FACS or other labeling schemes.
Journal ArticleDOI

Three-dimensional axial assignment problems with decomposable cost coefficients

TL;DR: It is shown that the maximization version of this problem can be solved in polynomial time, whereas an NP-completeness proof for the minimization version is presented.
Journal ArticleDOI

Scheduling sports competitions on multiple venues

TL;DR: An integer goal program is developed to construct a schedule that satisfies a variety of conditions and is motivated by the request from a head coach of a major-college football team to assist in the development of a training schedule for intra-squad team competitions on various drill stations.
Journal ArticleDOI

The column subtraction algorithm: an exact method for solving weighted set covering, packing and partitioning problems

TL;DR: A novel greedy heuristic that makes use of only the nonbasic surplus variables for the column subtractions, and which generates excellent bounds quickly is introduced, which highlights the effective overall performance of the column subtraction algorithm.
Related Papers (5)