Auction algorithms for network flow problems: A tutorial introduction
From MaRDI portal
Publication:1202585
DOI10.1007/BF00247653zbMath0766.90025MaRDI QIDQ1202585
Publication date: 14 February 1993
Published in: Computational Optimization and Applications (Search for Journal in Brave)
transportationsurvey papershortest pathsauction algorithmtransshipmentassignmentsnetworks flow problems
Programming involving graphs or networks (90C35) Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Deterministic network models in operations research (90B10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Optimum matchings in weighted bipartite graphs, Data parallel computing for network-structured optimization problems, The assignment problem revisited, Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem, Distributed coordination of emergency medical service for angioplasty patients, Unnamed Item, An auction algorithm for the max-flow problem, Numerical solution of the optimal transportation problem using the Monge-Ampère equation, Semi-discrete optimal transport: hardness, regularization and numerical solution, A fast solver for generalized optimal transport problems based on dynamical system and algebraic multigrid, Multi-agent based optimal equilibrium selection with resilience constraints for traffic flow, Entropic model predictive optimal transport over dynamical systems, Discrete Optimal Transport with Independent Marginals is #P-Hard, A study of auction mechanisms for multilateral procurement based on subgradient and bundle methods, Automatic coarsening in algebraic multigrid utilizing quality measures for matching-based aggregations, Parallel Auction Algorithm for Bus Rescheduling, Center-outward quantiles and the measurement of multivariate risk, Distributed optimization of P2P live streaming overlays, Decentralized algorithms for distributed integer programming problems with a coupling cardinality constraint, A pricing approach for bandwidth allocation in differentiated service networks, The Monge-Ampère-Kantorovich approach to reconstruction in cosmology, Group preference modeling for intelligent shared environments: social welfare beyond the sum, Coordinated road-network search route planning by a team of UAVs, Stochastic downscaling method: application to wind refinement, Auction protocols for decentralized scheduling, Descending price multi-item auctions, The vehicle rescheduling problem: Model and algorithms, Distributed greedy algorithm for multi-agent task assignment problem with submodular utility functions, Uncertain programming model for uncertain optimal assignment problem, Empirical optimal transport on countable metric spaces: distributional limits and statistical applications, Application of optimal transportation theory to the reconstruction of the early Universe, Combinatorial auctions for electronic business, Optimal transport by omni-potential flow and cosmological reconstruction, A comprehensive simplex-like algorithm for network optimization and perturbation analysis, A generic auction algorithm for the minimum cost network flow problem, Simultaneous independent online auctions with discrete bid increments
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An algorithm for ranking paths that may contain cycles
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- Dual coordinate step methods for linear network flow problems
- Parallel synchronous and asynchronous implementations of the auction algorithm
- A generic auction algorithm for the minimum cost network flow problem
- The auction algorithm: A distributed relaxation method for the assignment problem
- A computational analysis of the auction algorithm
- Parallel shortest path auction algorithms
- A forward/reverse auction algorithm for asymmetric assignment problems
- Polynomial auction algorithms for shortest paths
- A Fast and Simple Algorithm for the Maximum Flow Problem
- Analysis of Preflow Push Algorithms for Maximum Network Flow
- Finding Minimum-Cost Circulations by Successive Approximation
- Adaptive aggregation methods for infinite horizon dynamic programming
- A new algorithm for the assignment problem
- An Auction Algorithm for Shortest Paths
- Reverse Auction and the Solution of Inequality Constrained Assignment Problems
- An Appraisal of Some Shortest-Path Algorithms
- A Descent Numerical Method for Optimization Problems with Nondifferentiable Cost Functionals
