Computational Framework for Target Tracking Information Fusion Problems
In this work, we propose computationally tractable techniques for extracting valuable
information from diverse data sources collected by multiple sensors in a variety of formats …
information from diverse data sources collected by multiple sensors in a variety of formats …
Integer programming models for the multidimensional assignment problem with star costs
We consider a variant of the multidimensional assignment problem (MAP) with
decomposable costs in which the resulting optimal assignment is described as a set of …
decomposable costs in which the resulting optimal assignment is described as a set of …
A dual approach to multi-dimensional assignment problems
In this paper, we extend the purely dual formulation that we recently proposed for the three-
dimensional assignment problems to solve the more general multidimensional assignment …
dimensional assignment problems to solve the more general multidimensional assignment …
Efficient sensor network management for asset localization
Asset localization represents an important application over wireless sensor networks (WSN)
with a wide area of applicability ranging from network surveillance to search and rescue …
with a wide area of applicability ranging from network surveillance to search and rescue …
Multidimensional Assignment Problem for multipartite entity resolution
Multipartite entity resolution aims at integrating records from multiple datasets into one entity.
We derive a mathematical formulation for a general class of record linkage problems in …
We derive a mathematical formulation for a general class of record linkage problems in …
A novel convex dual approach to three-dimensional assignment problem: theoretical analysis
In this paper, we propose a novel convex dual approach to the three dimensional
assignment problem, which is an NP-hard binary programming problem. It is shown that the …
assignment problem, which is an NP-hard binary programming problem. It is shown that the …
GPU-accelerated lagrangian heuristic for multidimensional assignment problems with decomposable costs
In this paper, we describe a GPU-accelerated parallel algorithm for the axial
Multidimensional Assignment Problem with Decomposable Costs (MDADC), which is one of …
Multidimensional Assignment Problem with Decomposable Costs (MDADC), which is one of …
Modeling of a scheduling method for organizing training assignments
A Diponegoro, F Rukman - 2nd Annual International Seminar on …, 2017 - atlantis-press.com
The objectives of this research are (i) to develop a model for managing staff assignments in
an institution that organizes various events oftraining; and (ii) to propose a method for …
an institution that organizes various events oftraining; and (ii) to propose a method for …
Enhancement method for assignments of staff in multiple events
A Diponegoro - SHS Web of Conferences, 2018 - shs-conferences.org
A problem of staff assignment in an organization with multiple assignments of scheduled
events is addressed here. The objective is to propose an efficient and practical approach for …
events is addressed here. The objective is to propose an efficient and practical approach for …
GPU-based Lagrangian heuristic for multidimensional assignment problems with decomposable costs
S Natu - 2018 - ideals.illinois.edu
Multidimensional assignment problem (MAP) is one of the many formulations of data
association problem which categorizes data based on various data sources. A higher …
association problem which categorizes data based on various data sources. A higher …