Auction/Belief Propagation Algorithms for Constrained Assignment Problem

DOI10.1007/978-3-319-14974-5_23MaRDI QIDQ5174969zbMATH OpenOpenAlexFDO

Authors Mindi Yuan, Wei Shen, Jun Li, Yannis Pavlidis, Shen Li

Publication date 19 February 2015

Published in Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-14974-5_23

zbMATH Keywords

assignment problemgeneralize assignment problemloopy graphminimum cost flowretail company

Mathematics Subject Classification ID

Approximation algorithms (68W25) Auctions, bargaining, bidding and selling, and other market models (91B26)

Recommendations

• The auction algorithm: A distributed relaxation method for the assignment problem
• Towards auction algorithms for large dense assignment problems
• scientific article; zbMATH DE number 515937
• scientific article; zbMATH DE number 1833405
• The auction algorithm for assignment and other network flow problems
• Efficient constrained combinatorial auctions
• Reverse Auction and the Solution of Inequality Constrained Assignment Problems
• A forward/reverse auction algorithm for asymmetric assignment problems
• On a dynamic auction mechanism for a bilateral assignment problem
• Auction algorithms for shortest hyperpath problems

Cited in

(3)

• A forward/reverse auction algorithm for asymmetric assignment problems
• Belief propagation for MiniMax Weight Matching
• The bidding selection and assignment problem with minimum quantity commitment

This page was built for publication: Auction/Belief Propagation Algorithms for Constrained Assignment Problem

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