An augmenting path method for solving Linear Bottleneck Assignment problems

Computing ◽  
1978 ◽  
Vol 19 (4) ◽  
pp. 285-295 ◽  
Author(s):  
U. Derigs ◽  
U. Zimmermann
Keyword(s):  
Assignment Problems ◽  
Augmenting Path

A Parallel Shortest Augmenting Path Algorithm for the Assignment Problem

1989 ◽  
Author(s):  
Egon Balas ◽  
Donald Miller ◽  
Joseph Pekny ◽  
Paolo Toth
Keyword(s):  
Assignment Problem ◽  
Augmenting Path

Computer algorithms

2018 ◽  
Author(s):  
Mark Newman
Keyword(s):  
Data Structures ◽  
Analysis Of Algorithms ◽  
Shortest Paths ◽  
Minimum Cut ◽  
Network Data ◽  
Computer Algorithms ◽  
Breadth First Search ◽  
Augmenting Path ◽  
Basic Concepts ◽  
Maximum Flows

This chapter introduces some of the fundamental concepts of numerical network calculations. The chapter starts with a discussion of basic concepts of computational complexity and data structures for storing network data, then progresses to the description and analysis of algorithms for a range of network calculations: breadth-first search and its use for calculating shortest paths, shortest distances, components, closeness, and betweenness; Dijkstra's algorithm for shortest paths and distances on weighted networks; and the augmenting path algorithm for calculating maximum flows, minimum cut sets, and independent paths in networks.

scholarly journals Random Assignment Problems on 2d Manifolds

2021 ◽  
Vol 183 (2) ◽  
Author(s):  
D. Benedetto ◽  
E. Caglioti ◽  
S. Caracciolo ◽  
M. D’Achille ◽  
G. Sicuro ◽  
...  
Keyword(s):  
Assignment Problem ◽  
Unit Area ◽  
Constant Term ◽  
Beltrami Operator ◽  
Explicit Calculation ◽  
Dimensional Manifold ◽  
Two Dimensional ◽  
Random Assignment ◽  
Assignment Problems ◽  
Theoretical Formulation

AbstractWe consider the assignment problem between two sets of N random points on a smooth, two-dimensional manifold $$\Omega $$ Ω of unit area. It is known that the average cost scales as $$E_{\Omega }(N)\sim {1}/{2\pi }\ln N$$ E Ω ( N ) ∼ 1 / 2 π ln N with a correction that is at most of order $$\sqrt{\ln N\ln \ln N}$$ ln N ln ln N . In this paper, we show that, within the linearization approximation of the field-theoretical formulation of the problem, the first $$\Omega $$ Ω -dependent correction is on the constant term, and can be exactly computed from the spectrum of the Laplace–Beltrami operator on $$\Omega $$ Ω . We perform the explicit calculation of this constant for various families of surfaces, and compare our predictions with extensive numerics.

Sign in / Sign up

Export Citation Format

Share Document