Reverse Auction and the Solution of Inequality Constrained Assignment Problems

DOI10.1137/0803013zbMath0778.90076OpenAlexW2068310603MaRDI QIDQ5287103

Dimitri P. Bertsekas, Haralampos Tsaknakis, David A. Castanon

Publication date: 11 August 1993

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/0149197c520d6e40502a31ce86a7afd8c591f8cd

zbMATH Keywords

assignment problemsinequality constraintsnetwork optimizationauction algorithmsreverse auctionsymmetric assignment problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Linear programming (90C05) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Auctions, bargaining, bidding and selling, and other market models (91B26) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

The assignment problem revisited ⋮ Towards auction algorithms for large dense assignment problems ⋮ Solving the rectangular assignment problem and applications ⋮ Auction dynamics: a volume constrained MBO scheme ⋮ Auction algorithms for network flow problems: A tutorial introduction ⋮ A new efficient algorithm for optimal assignment of smart weapons to targets ⋮ A forward/reverse auction algorithm for asymmetric assignment problems ⋮ A generic auction algorithm for the minimum cost network flow problem

Uses Software

• RELAX4