Reverse Auction and the Solution of Inequality Constrained Assignment Problems
From MaRDI portal
assignment problemsauction algorithmsinequality constraintsnetwork optimizationreverse auctionsymmetric assignment problems
Computational methods for problems pertaining to operations research and mathematical programming (90-08) Deterministic network models in operations research (90B10) Linear programming (90C05) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Auctions, bargaining, bidding and selling, and other market models (91B26)
Recommendations
Cited in
(15)- Auction algorithms for network flow problems: A tutorial introduction
- A generic auction algorithm for the minimum cost network flow problem
- The invisible hand algorithm: solving the assignment problem with statistical physics
- On a dynamic auction mechanism for a bilateral assignment problem
- Auction dynamics: a volume constrained MBO scheme
- A forward/reverse auction algorithm for asymmetric assignment problems
- The assignment problem revisited
- Solving the rectangular assignment problem and applications
- A formulation of combinatorial auction via reverse convex programming
- scientific article; zbMATH DE number 515937 (Why is no real title available?)
- Auction/Belief Propagation Algorithms for Constrained Assignment Problem
- Reverse auction-based job assignment among foundry fabs
- Relative-interior solution for the (incomplete) linear assignment problem with applications to the quadratic assignment problem
- Towards auction algorithms for large dense assignment problems
- A new efficient algorithm for optimal assignment of smart weapons to targets
This page was built for publication: Reverse Auction and the Solution of Inequality Constrained Assignment Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5287103)