scholarly journals On the hardness of range assignment problems

Networks ◽  
2008 ◽  
Vol 52 (4) ◽  
pp. 183-195 ◽  
Author(s):  
Bernhard Fuchs
Keyword(s):  
Assignment Problems ◽  
Range Assignment

Submodular Formulations for Range Assignment Problems

2010 ◽  
Vol 36 ◽  
pp. 239-246
Author(s):  
Frank Baumann ◽  
Christoph Buchheim
Keyword(s):  
Assignment Problems ◽  
Range Assignment

A Chaotic Local Search Algorithm with Adaptive Exchange of Elements for Quadratic Assignment Problems

2014 ◽  
Vol 2 ◽  
pp. 362-365
Author(s):  
Akio Watanabe ◽  
Kaori Kuroda ◽  
Kantaro Fujiwara ◽  
Tohru Ikeguchi
Keyword(s):  
Local Search ◽  
Search Algorithm ◽  
Quadratic Assignment ◽  
Local Search Algorithm ◽  
Assignment Problems ◽  
Quadratic Assignment Problems

Personnel Assignment-Problems

2009 ◽  
Author(s):  
Michael Knörzer
Keyword(s):  
Assignment Problems

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.

Simulation of optimal solutions for assignment problems in the context of incomplete information

2020 ◽  
Author(s):  
Irina Zaitseva ◽  
Oleg Malafeyev ◽  
Ekaterina Konopko ◽  
Viktoriya Taran ◽  
Anna Durakova
Keyword(s):  
Incomplete Information ◽  
Optimal Solutions ◽  
Assignment Problems
Sign in / Sign up

Export Citation Format

Share Document