—The problem of assigning purchases among multiple offers lots is easy and quick to resolve since its underlying complexity is related to the elected ordination algorithm. We have chosen a programming language which implements the algorithm "merge sort" and whose behavior in the worst case scenario is O (N log N). This algorithm is already implemented in sophisticated languages such as Perl, Phyton or Java.
—Lots, reverse auction, sorting method.
The authors are with the Department of Business Administration, Polytechnic School of Engineering (University of Oviedo), Campus de Viesques s/n, CP 33204, Gijón (Asturias), Spain (e-mail: firstname.lastname@example.org, email@example.com, firstname.lastname@example.org, email@example.com, firstname.lastname@example.org, email@example.com).
Cite: David de la Fuente, Jesús Lozano, Nazario García, Alberto Gómez, Isabel Fernández, and Borja Ponte, "Assignment of Purchases to Suppliers through a Reverse Auction with Multiple Offers of Lots," Journal of Economics, Business and Management vol. 3, no. 1, pp. 83-87, 2015.