A computational analysis of the auction algorithm

DOI10.1016/0377-2217(94)90214-3zbMath0806.90106OpenAlexW2028745618MaRDI QIDQ1330563

Benjamin L. Schwartz

Publication date: 21 July 1994

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90214-3

zbMATH Keywords

auction algorithmlinear assignment

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Parallel numerical computation (65Y05) Auctions, bargaining, bidding and selling, and other market models (91B26)

Related Items

Towards auction algorithms for large dense assignment problems ⋮ Algorithms and codes for dense assignment problems: The state of the art ⋮ Auction algorithms for network flow problems: A tutorial introduction

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item