Reverse Auction and the Solution of Inequality Constrained Assignment Problems

In this paper we propose auction algorithms for solving several types of assignment problems with inequality constraints. Included are asymmetric problems with dierent numbers of persons and objects, and multiassignment problems, where persons may be assigned to several objects and reversely. A central new idea in all these algorithms is to combine regular auction, where persons bid for objects by raising their prices, with reverse auction, where objects compete for persons by essentially oering discounts. Reverse auction can also be used to accelerate substantially (and

[1]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[2]  D. R. Fulkerson,et al.  Solving a Transportation Problem , 1956 .

[3]  L. R. Ford,et al.  NETWORK FLOW THEORY , 1956 .

[4]  D. R. Fulkerson,et al.  A primal‐dual algorithm for the capacitated Hitchcock problem , 1957 .

[5]  D. R. Fulkerson,et al.  Maximal Flow Through a Network , 1956 .

[6]  Marshall Hall,et al.  An Algorithm for Distinct Representatives , 1956 .

[7]  Peter Elias,et al.  A note on the maximum flow through a network , 1956, IRE Trans. Inf. Theory.

[8]  D. Gale.  A theorem on flows in networks , 1957 .

[9]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[10]  G. Minty.  Monotone networks , 1960, Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences.

[11]  Robert G. Busacker,et al.  A PROCEDURE FOR DETERMINING A FAMILY OF MINIMUM-COST NETWORK FLOW PATTERNS , 1960 .

[12]  J. A. Hillier,et al.  A Method for Finding the Shortest Route Through a Road Network , 1960 .

[13]  Stephen Warshall,et al.  A Theorem on Boolean Matrices , 1962, JACM.

[14]  Stephen J. Garland,et al.  Algorithm 97: Shortest path , 1962, Commun. ACM.

[15]  T. A. J. Nicholson,et al.  Finding the Shortest Route between Two Points in a Network , 1966, Comput. J..

[16]  Ellis L. Johnson,et al.  Networks and Basic Solutions , 1966, Oper. Res..

[17]  M. Klein.  A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems , 1966 .

[18]  T. L. Saaty,et al.  Finite graphs and networks : an introduction with applications , 1967 .

[19]  D. Luenberger.  Optimization by Vector Space Methods , 1968 .

[20]  Robert B. Dial,et al.  Algorithm 360: shortest-path forest with topological ordering [H] , 1969, CACM.

[21]  Stuart E. Dreyfus,et al.  An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..

[22]  E. A. Dinic.  Algorithm for solution of a problem of maximal flow in a network with power estimation , 1970 .

[23]  V. Klee,et al.  HOW GOOD IS THE SIMPLEX ALGORITHM , 1970 .

[24]  S. Vajda,et al.  Integer Programming and Network Flows , 1970 .

[25]  James M. Ortega,et al.  Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.

[26]  Ivan T. Frisch,et al.  Communication, transmission, and transportation networks , 1971 .

[27]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[28]  Norman Zadeh,et al.  A bad network problem for the simplex method and other minimum cost flow algorithms , 1973, Math. Program..

[29]  Gerald L. Thompson,et al.  Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm , 1973, JACM.

[30]  Yves Tabourier,et al.  All shortest distances in a graph. An improvement to Dantzig's inductive algorithm , 1973, Discret. Math..

[31]  Norman Zadeh.  More pathological examples for network flow problems , 1973, Math. Program..

[32]  U. Pape,et al.  Implementation and efficiency of Moore-algorithms for the shortest route problem , 1974, Math. Program..

[33]  Darwin Klingman,et al.  NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems , 1974 .

[34]  Philip Wolfe,et al.  Note on a method of conjugate subgradients for minimizing nondifferentiable functions , 1974, Math. Program..

[35]  Claude Lemaréchal,et al.  An Algorithm for Minimizing Convex Functions , 1974, IFIP Congress.

[36]  A. V. Karzanov,et al.  Determining the maximal flow in a network by the method of preflows , 1974 .

[37]  Fred Glover,et al.  A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems , 1974 .

[38]  Fred W. Glover,et al.  Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems , 1974, Networks.

[39]  Thomas L. Magnanti,et al.  Implementing primal-dual network flow algorithms , 1976 .

[40]  Claus Kastning,et al.  Integer programming and related areas : a classified bibliography , 1976 .

[41]  Darwin Klingman,et al.  The alternating basis algorithm for assignment problems , 1977, Math. Program..

[42]  Richard V. Helgason,et al.  An Efficient Procedure for Implementing a Dual Simplex Network Flow Algorithm , 1977 .

[43]  Thomas L. Magnanti,et al.  Deterministic network optimization: A bibliography , 1977, Networks.

[44]  Katta G. Murty,et al.  Mathematical Programming Methods , 1977 .

[45]  丸山 徹.  Convex Analysisの二,三の進展について , 1977 .

[46]  C. R. Sergeant.  Linear and Combinatorial Programming , 1977 .

[47]  Donald Goldfarb,et al.  A practicable steepest-edge simplex algorithm , 1977, Math. Program..

[48]  Donald B. Johnson,et al.  Efficient Algorithms for Shortest Paths in Sparse Networks , 1977, J. ACM.

[49]  John M. Mulvey,et al.  Testing of a large-scale network optimization program , 1978, Math. Program..

[50]  F. Glover,et al.  The Generalized Alternating Path Algorithm for Transportation Problems. , 1978 .

[51]  S. N. Maheshwari,et al.  An O(|V|³) Algorithm for Finding Maximum Flows in Networks , 1978, Inf. Process. Lett..

[52]  John M. Mulvey,et al.  Pivot Strategies for Primal-Simplex Network Codes , 1978, JACM.

[53]  Darwin Klingman,et al.  Enhancements of Spanning Tree Labeling Procedures for Network Optimization. , 1979 .

[54]  Norman Zadeh.  Near-Equivalence of Network Flow Algorithms. , 1979 .

[55]  E. Denardo,et al.  Shortest-Route Methods: 1. Reaching, Pruning, and Buckets , 1979, Oper. Res..

[56]  Maurice Snowdon,et al.  Network Flow Programming , 1980 .

[57]  Ray Wild,et al.  Optimization Algorithms for Networks and Graphs , 1980 .

[58]  Richard V. Helgason,et al.  Algorithms for network programming , 1980 .

[59]  Aaron Kershenbaum,et al.  A note on finding shortest path trees , 1981, Networks.

[60]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[61]  Nesa L'abbe Wu,et al.  Linear programming and extensions , 1981 .

[62]  Douglas R. Shiert,et al.  Properties of Labeling Methods for Determining Shortest Path Trees , 1981 .

[63]  Sang Nguyen,et al.  A dual simplex algorithm for finding all shortest paths , 1981, Networks.

[64]  Dimitri P. Bertsekas,et al.  A new algorithm for the assignment problem , 1981, Math. Program..

[65]  M. Engquist.  A Successive Shortest Path Algorithm for The Assignment Problem , 1982 .

[66]  Dimitri P. Bertsekas,et al.  Constrained Optimization and Lagrange Multiplier Methods , 1982 .

[67]  R. von Randow,et al.  Integer programming and related areas : a classified bibliography 1978-1981 , 1982 .

[68]  Leon F. McGinnis,et al.  Implementation and Testing of a Primal-Dual Algorithm for the Assignment Problem , 1983, Oper. Res..

[69]  F. Glover,et al.  A comparison of pivot selection rules for primal simplex based network codes , 1983 .

[70]  Ming S. Hung,et al.  Technical Note - A Polynomial Simplex Method for the Assignment Problem , 1983, Oper. Res..

[71]  F. Glover,et al.  A Primal Simplex Variant for the Maximum Flow Problem , 1984 .

[72]  Stefano Pallottino,et al.  Shortest-path methods: Complexity, interrelations and new propositions , 1984, Networks.

[73]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[74]  Narsingh Deo,et al.  Shortest-path algorithms: Taxonomy and annotation , 1984, Networks.

[75]  Michel Minoux,et al.  Graphs and Algorithms , 1984 .

[76]  Dimitri P. Bertsekas,et al.  RELAX: a computer code for minimum cost network flow problems , 1985 .

[77]  F. Glover,et al.  New Polynomial Shortest Path Algorithms and Their Computational Attributes , 1985 .

[78]  Ulrich Derigs,et al.  The shortest augmenting path method for solving assignment problems — Motivation and computational experience , 1985 .

[79]  Michel Balinski,et al.  Signature Methods for the Assignment Problem , 1985, Oper. Res..

[80]  Fred W. Glover,et al.  A New Polynomially Bounded Shortest Path Algorithm , 1985, Oper. Res..

[81]  D. Bertsekas.  A distributed asynchronous relaxation algorithm for the assignment problem , 1985, 1985 24th IEEE Conference on Decision and Control.

[82]  Michel Balinski,et al.  A competitive (dual) simplex method for the assignment problem , 1986, Math. Program..

[83]  Donald Goldfarb,et al.  Efficient dual simplex algorithms for the assignment problem , 1986, Math. Program..

[84]  R. Jonker,et al.  Improving the Hungarian assignment algorithm , 1986 .

[85]  Paul Tseng,et al.  Relaxation methods for monotropic programming problems , 1986 .

[86]  D. Bertsekas.  Distributed relaxation methods for linear network flow problems , 1986, 1986 25th IEEE Conference on Decision and Control.

[87]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

[88]  Darwin Klingman,et al.  Threshold assignment algorithm , 1986 .

[89]  G. Gallo,et al.  SHORTEST PATH METHODS: A UNIFYING APPROACH , 1986 .

[90]  Samuel S. Blackman,et al.  Multiple-Target Tracking with Radar Applications , 1986 .

[91]  David K. Smith,et al.  Integer Programming and Related Areas: A Classified Bibliography 1981-1984 , 1986 .

[92]  Dimitri P. Bertsekas,et al.  Dynamic Programming: Deterministic and Stochastic Models , 1987 .

[93]  Andrew Vladislav Goldberg,et al.  Efficient graph algorithms for sequential and parallel computers , 1987 .

[94]  Dimitri P. Bertsekas,et al.  Distributed Asynchronous Relaxation Methods for Linear Network Flow Problems , 1987 .

[95]  Paul Tseng,et al.  Relaxation Methods for Linear Programs , 1987, Math. Oper. Res..

[96]  D. Bertsekas,et al.  Distributed asynchronous relaxation methods for convex network flow problems , 1987 .

[97]  D. Bertsekas,et al.  Relaxation methods for network flow problems with convex arc costs , 1987 .

[98]  Andrew V. Goldberg,et al.  Solving minimum-cost flow problems by successive approximation , 1987, STOC.

[99]  Paul Tseng,et al.  Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems , 1988, Oper. Res..

[100]  D. Bertsekas.  The auction algorithm: A distributed relaxation method for the assignment problem , 1988 .

[101]  Dimitri P. Bertsekas,et al.  Dual coordinate step methods for linear network flow problems , 1988, Math. Program..

[102]  D. El Baz,et al.  A computational experience with distributed asynchronous iterative methods for convex network flow problems , 1989 .

[103]  Dimitri P. Bertsekas,et al.  The auction algorithm for the minimum cost network flow problem , 1989 .

[104]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[105]  Ravindra K. Ahuja,et al.  A Fast and Simple Algorithm for the Maximum Flow Problem , 2011, Oper. Res..

[106]  Egon Balas,et al.  A PARALLEL SHORTEST PATH ALGORITHM FOR THE ASSIGNMENT PROBLEM , 1989 .

[107]  Dimitri P. Bertsekas,et al.  The Auction Algorithm for Assignment and Other Network Flow Problems: A Tutorial , 1990 .

[108]  D. Bertsekas,et al.  Partially asynchronous, parallel algorithms for network flow and other problems , 1990 .

[109]  J. M. Wein,et al.  Massively parallel auction algorithms for the assignment problem , 1990, [1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation.

[110]  Donald Goldfarb,et al.  Anti-stalling pivot rules for the network simplex algorithm , 1990, Networks.

[111]  Donald Goldfarb,et al.  A primal simplex algorithm that solves the maximum flow problem in at mostnm pivots and O(n2m) time , 1990, Math. Program..

[112]  Paul Tseng,et al.  Relaxation methods for monotropic programs , 1990, Math. Program..

[113]  Dimitri P. Bertsekas,et al.  PARALLEL ASYNCHRONOUS PRIMAL-DUAL METHODS FOR THE MINIMUM COST FLOW PROBLEM' , 1990 .

[114]  Kurt Mehlhorn,et al.  Faster algorithms for the shortest path problem , 1990, JACM.

[115]  Dimitri P. Bertsekas,et al.  RELAXT-III : a new and improved version of the RELAX code , 1990 .

[116]  Donald Goldfarb,et al.  Efficient Shortest Path Simplex Algorithms , 1990, Oper. Res..

[117]  David A. Castañón,et al.  Reverse Auction Algorithms for Assignment Problems , 1991, Network Flows And Matching.

[118]  Lazaros Polymenakos.  Analysis of parallel asynchronous schemes for the auction shortest path algorithm , 1991 .

[119]  Dimitri P. Bertsekas,et al.  Linear network optimization - algorithms and codes , 1991 .

[120]  Dimitri P. Bertsekas,et al.  An Auction Algorithm for Shortest Paths , 1991, SIAM J. Optim..

[121]  Dimitri P. Bertsekas,et al.  Parallel synchronous and asynchronous implementations of the auction algorithm , 1991, Parallel Comput..

[122]  Stavros A. Zenios,et al.  On the Massively Parallel Solution of the Assignment Problem , 1991, J. Parallel Distributed Comput..

[123]  Jeffery L. Kennington,et al.  Performance Characteristics of the Jacobi and the Gauss-Seidel Versions of the Auction Algorithm on the Alliant FX/8 , 1991, INFORMS J. Comput..

[124]  David L. Jensen,et al.  On the computational behavior of a polynomial-time network flow algorithm , 1992, Math. Program..

[125]  James Evans,et al.  Optimization algorithms for networks and graphs , 1992 .

[126]  B. L. Schwartz.  A computational analysis of the Auction algorithm , 1994 .

[127]  Hossam A. Zaki.  A comparison of two algorithms for the assignment problem , 1995, Comput. Optim. Appl..