The auction algorithm: A distributed relaxation method for the assignment problem

Συγγραφείς: Dimitri P. Bertsekas

Πηγή: Annals of Operations Research. 14:105-123

Θεματικοί όροι: Auctions, bargaining, bidding and selling, and other market models, Jacobi-like relaxation method, worst- case complexity, Numerical methods for mathematical programming, optimization and variational techniques, Analysis of algorithms and problem complexity, 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, Integer programming, Parallel numerical computation, 02 engineering and technology, massively parallelizable algorithm

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://dspace.mit.edu/bitstream/1721.1/2982/1/P-1653-17168586.pdf
https://zbmath.org/555731
https://doi.org/10.1007/bf02186476
https://dl.acm.org/doi/10.1007/BF02186476
https://asu.pure.elsevier.com/en/publications/the-auction-algorithm-a-distributed-relaxation-method-for-the-ass
https://link.springer.com/content/pdf/10.1007/BF02186476.pdf
http://dspace.mit.edu/bitstream/handle/1721.1/2982/P-1653-17168586.pdf
https://rd.springer.com/article/10.1007/BF02186476
http://dspace.mit.edu/handle/1721.1/2982