scholarly journals Order statistics and the linear assignment problem

Computing ◽  
1987 ◽  
Vol 39 (2) ◽  
pp. 165-174 ◽  
Author(s):  
J. B. G. Frenk ◽  
M. van Houweninge ◽  
A. H. G. Rinnooy Kan
Keyword(s):  
Order Statistics ◽  
Assignment Problem ◽  
Linear Assignment Problem ◽  
Linear Assignment

scholarly journals Topology-Aware Strategy for MPI-IO Operations in Clusters

2018 ◽  
Vol 2018 ◽  
pp. 1-13 ◽  
Author(s):  
Weifeng Liu ◽  
Jie Zhou ◽  
Meng Guo
Keyword(s):  
Phase I ◽  
Execution Time ◽  
Assignment Problem ◽  
Optimal Assignment ◽  
Local Data ◽  
Two Phase ◽  
File Access ◽  
Linear Assignment Problem ◽  
Linear Assignment

This paper presents the topology-aware two-phase I/O (TATP), which optimizes the most popular collective MPI-IO implementation of ROMIO. In order to improve the hop-bytes metric during the file access, topology-aware two-phase I/O employs the Linear Assignment Problem (LAP) for finding an optimal assignment of file domain to aggregators, an aspect which is not considered in most two-phase I/O implementations. The distribution is based on the local data stored by each process, and its main purpose is to reduce the total hop-bytes of the I/O collective operation. Therefore, the global execution time can be improved. In most of the considered scenarios, topology-aware two-phase I/O obtains important improvements when compared with the original two-phase I/O implementations.

A negative dual rectangle cancellation algorithm for the linear assignment problem

2013 ◽  
Vol 65 (4) ◽  
pp. 673-678 ◽  
Author(s):  
Mohammad S. Sabbagh ◽  
Sayyed R. Mousavi ◽  
Yasin Zamani
Keyword(s):  
Assignment Problem ◽  
Linear Assignment Problem ◽  
Linear Assignment

Statistical Physics Algorithms That Converge

1994 ◽  
Vol 6 (3) ◽  
pp. 341-356 ◽  
Author(s):  
A. L. Yuille ◽  
J. J. Kosowsky
Keyword(s):  
Field Theory ◽  
Assignment Problem ◽  
Statistical Physics ◽  
Heuristic Algorithms ◽  
Optimization Problems ◽  
Mean Field Theory ◽  
Mean Field ◽  
Approximate Solutions ◽  
Linear Assignment Problem ◽  
Linear Assignment

In recent years there has been significant interest in adapting techniques from statistical physics, in particular mean field theory, to provide deterministic heuristic algorithms for obtaining approximate solutions to optimization problems. Although these algorithms have been shown experimentally to be successful there has been little theoretical analysis of them. In this paper we demonstrate connections between mean field theory methods and other approaches, in particular, barrier function and interior point methods. As an explicit example, we summarize our work on the linear assignment problem. In this previous work we defined a number of algorithms, including deterministic annealing, for solving the assignment problem. We proved convergence, gave bounds on the convergence times, and showed relations to other optimization algorithms.

Max algebra and the linear assignment problem

2003 ◽  
Vol 98 (1-3) ◽  
pp. 415-429 ◽  
Author(s):  
Rainer E. Burkard ◽  
Peter Butkovic
Keyword(s):  
Assignment Problem ◽  
Linear Assignment Problem ◽  
Max Algebra ◽  
Linear Assignment
Sign in / Sign up

Export Citation Format

Share Document