scientific article; zbMATH DE number 515937

MaRDI QIDQ4283453zbMATHFDO

Authors David A. Castanon

Publication date 10 March 1994

zbMATH Keywords

auction algorithmcost scalingDIMACS algorithmforward-reverse auctionminimum cost bipartite matching

Mathematics Subject Classification ID

Linear programming (90C05) Combinatorial optimization (90C27) Auctions, bargaining, bidding and selling, and other market models (91B26) Integer programming (90C10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• The auction algorithm for assignment and other network flow problems
• Reverse Auction and the Solution of Inequality Constrained Assignment Problems
• The auction algorithm: A distributed relaxation method for the assignment problem
• A forward/reverse auction algorithm for asymmetric assignment problems
• The assignment problem revisited

Cited in

(10)

• Towards auction algorithms for large dense assignment problems
• A forward/reverse auction algorithm for asymmetric assignment problems
• The assignment problem revisited
• Reverse auction-based job assignment among foundry fabs
• A generic auction algorithm for the minimum cost network flow problem
• Auction/Belief Propagation Algorithms for Constrained Assignment Problem
• A reverse point algorithm for the assignment problem of the assignment of jobs with less number persons than jobs
• Parametrization of Random Vectors in Polynomial Chaos Expansions via Optimal Transportation
• An efficient algorithm for the bipartite matching problem
• An efficient cost scaling algorithm for the assignment problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4283453)