A shortest augmenting path algorithm for dense and sparse linear assignment problems

@article{Jonker2005ASA,
  title={A shortest augmenting path algorithm for dense and sparse linear assignment problems},
  author={Roy Jonker and A. Volgenant},
  journal={Computing},
  year={2005},
  volume={38},
  pages={325-340}
}
We develop a shortest augmenting path algorithm for the linear assignment problem. It contains new initialization routines and a special implementation of Dijkstra's shortest path method. For both dense and sparse problems computational experiments show this algorithm to be uniformly faster than the best algorithms from the literature. A Pascal implementation is presented.ZusammenfassungWir entwickeln einen Algorithmus mit kürzesten alternierenden Wegen für das lineare Zuordnungsproblem. Er… 
Massively parallel augmenting path algorithms for the assignment problem
TLDR
It is proved by doing that the technique suggested, which reduces the computational complexity from the sequentialO(n3) to the parallel complexity of O(n2), can be efficiently implemented on commercial available, massively parallel computers.
An Auction Algorithm for Shortest Pathsi
We propose a new and simple algorithm for finding shortest paths in a directed graph. In the single origin/single destination case, the algorithm maintains a single path starting at the origin, which
Algorithm 1015
TLDR
The well-known epsilon scaling approach used in the Auction algorithm is introduced to approximate the dual variables of the successive shortest path algorithm prior to solving the assignment problem to limit the complexity of the path search.
Iterative Graph Alignment via Supermodular Approximation
TLDR
This paper approaches the task of designing an efficient polynomial-time approximation algorithm for graph matching from a previously unconsidered perspective and concludes that graph matching can be formulated as maximizing a monotone, supermodular set function subject to matroid intersection constraints.
Combining Bipartite Graph Matching and Beam Search for Graph Edit Distance Approximation
TLDR
The original approximation framework is combined with a fast tree search procedure to improve the overall approximation quality, and the assignment from the original approximation as a starting point for a subsequent beam search is regarded.
Bipartite Graph Edit Distance
TLDR
This chapter reformulates the graph edit distance problem to a quadratic assignment problem, and builds the basis for a recent approximation algorithm, which in turn builds the core algorithm for the second part of the present book.
Computation of graph edit distance: Reasoning about optimality and speed-up
  • F. Serratosa
  • Mathematics, Computer Science
    Image Vis. Comput.
  • 2015
TLDR
This paper compares the three versions of Bipartite algorithm and shows how the violation of the theoretically imposed restrictions do not affect the optimality of the algorithm and so, the three algorithms obtain similar distances and recognition ratios in classification applications although the restrictionsDo not hold.
Improving bipartite graph edit distance approximation using various search strategies
TLDR
How the well-known bipartite graph edit distance approximation can substantially be improved with respect to distance accuracy is shown and six different methodologies for extending the graph matching framework are introduced.
A negative dual rectangle cancellation algorithm for the linear assignment problem
TLDR
This paper defines the concept of Negative Dual Rectangle (NDR) and suggests an algorithm that solves two of these dual problems by repeatedly finding and cancelling NDRs until it yields an optimal solution to the assignment problem.
Tolerance-based greedy algorithms for the traveling salesman problem
TLDR
This paper introduces three greedy algorithms for the traveling salesman problem that use arc tolerances, rather than arc weights, to decide whether or not to include an arc in a solution.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 35 REFERENCES
Algorithm for the solution of the assignment problem for sparse matrices
The FORTRAN implementation of an efficient algorithm which solves the Assignment Problem for sparse matrices is given. Computional results are presented, showing the proposed method to be generally
An efficient labeling technique for solving sparse assignment problems
TLDR
A new implementation of the shortest augmenting path approach for solving sparse assignment problems and computational experience documenting its efficiency is described.
An in-core/out-of-core method for solving large scale assignment problems
We describe how the shortest augmenting path method can be used as basis for a so called “in-core/out-of-core” approach for solving large assignment problems in which the data cannot be kept in
Efficient dual simplex algorithms for the assignment problem
  • D. Goldfarb
  • Mathematics, Computer Science
    Math. Program.
  • 1986
TLDR
Efficient algorithms based upon Balinski's signature method are described for solving then × n assignment problem and are shown to have computational bounds of O(n3) space and O(mn + n2 logn) time in the worst case.
Improving the Hungarian assignment algorithm
We describe three easily implementable improvement for the Hungarian linear assignment algorithm. Computation times vary from about two to more than three times lower than previously, where the
Combinatorial Optimization: Algorithms and Complexity
This clearly written , mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient
New Polynomial Shortest Path Algorithms and Their Computational Attributes
This paper presents six new variants of the polynomially bounded Partitioning Shortest Path (PSP) algorithm for finding the shortest path from one node to all other nodes in a network. Three of these
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
TLDR
New algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimum-cost flow problem are presented, and Dinic shows that, in a network with n nodes and p arcs, a maximum flow can be computed in 0 (n2p) primitive operations by an algorithm which augments along shortest augmenting paths.
Solving the Assignment Problem by Relaxation
This paper presents a new algorithm for solving the assignment problem. The algorithm is based on a scheme of relaxing the given problem into a series of simple network flow transportation problems
A New Polynomially Bounded Shortest Path Algorithm
This paper develops a new polynomially bounded shortest path algorithm, called the partitioning shortest path PSP algorithm, for finding the shortest path from one node to all other nodes in a
...
1
2
3
4
...