Pages that link to "Item:Q1320412"
From MaRDI portal
The following pages link to The auction algorithm: A distributed relaxation method for the assignment problem (Q1320412):
Displaying 50 items.
- Metrics and barycenters for point pattern data (Q89375) (← links)
- Distributed coordination of emergency medical service for angioplasty patients (Q314475) (← links)
- Comparing problem formulations for coupled sets of components (Q374648) (← links)
- Properties of the DGS-auction algorithm (Q431903) (← links)
- Distributed optimization of P2P live streaming overlays (Q455928) (← links)
- A heuristic for the time constrained asymmetric linear sum assignment problem (Q511701) (← links)
- Optimal assignment of resources to strengthen the weakest link in an uncertain environment (Q646646) (← links)
- Two strongly polynomial cut cancelling algorithms for minimum cost network flow (Q689972) (← links)
- Some aspects of parallel and distributed iterative algorithms - a survey (Q805158) (← links)
- The auction algorithm for the transportation problem (Q918416) (← links)
- Solution of large dense transportation problems using a parallel primal algorithm (Q922946) (← links)
- A new efficient algorithm for optimal assignment of smart weapons to targets (Q979812) (← links)
- Dual coordinate step methods for linear network flow problems (Q1115790) (← links)
- Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem (Q1118534) (← links)
- New scaling algorithms for the assignment and minimum mean cycle problems (Q1190599) (← links)
- Topological design of computer communication networks -- the overall design problem (Q1194726) (← links)
- Auction algorithms for network flow problems: A tutorial introduction (Q1202585) (← links)
- Multiplier methods: A survey (Q1223623) (← links)
- The two-machine total completion time flow shop problem (Q1266536) (← links)
- A generic auction algorithm for the minimum cost network flow problem (Q1315446) (← links)
- Data parallel computing for network-structured optimization problems (Q1328430) (← links)
- On combined minmax-minsum optimization (Q1333027) (← links)
- Data-level parallel solution of min-cost network flow problems using \(\varepsilon\)-relaxations (Q1342646) (← links)
- Massively parallel augmenting path algorithms for the assignment problem (Q1365535) (← links)
- Routing and capacity assignment in backbone communication networks (Q1373886) (← links)
- Efficient parallel algorithms for the minimum cost flow problem (Q1379929) (← links)
- Interpolating between random walks and optimal transportation routes: flow with multiple sources and targets (Q1619310) (← links)
- Sparsity and independence: balancing two objectives in optimization for source separation with application to fMRI analysis (Q1661463) (← links)
- Gross substitutability: an algorithmic survey (Q1682734) (← links)
- Critical objective function values in linear sum assignment problems (Q1743488) (← links)
- Dual bounds of a service level assignment problem with applications to efficient pricing (Q1754037) (← links)
- A forward/reverse auction algorithm for asymmetric assignment problems (Q1803649) (← links)
- A comparison of two algorithms for the assignment problem (Q1804373) (← links)
- A data parallel augmenting path algorithm for the dense linear many-to-one assignment problem (Q1814992) (← links)
- An algorithm for fractional assignment problems (Q1842662) (← links)
- The singly constrained assignment problem: An AP basis algorithm (Q1908532) (← links)
- An efficient cost scaling algorithm for the assignment problem (Q1914072) (← links)
- A distributed simplex algorithm for degenerate linear programs and multi-agent assignments (Q1937523) (← links)
- The importance of memory for price discovery in decentralized markets (Q1995460) (← links)
- The assignment problem revisited (Q2136890) (← links)
- A multiscale semi-smooth Newton method for optimal transport (Q2144980) (← links)
- Bargaining dynamics in exchange networks (Q2253845) (← links)
- Assignment problems with changeover cost (Q2267319) (← links)
- Economic efficiency requires interaction (Q2278948) (← links)
- Sliced and Radon Wasserstein barycenters of measures (Q2353415) (← links)
- Sets in excess demand in simple ascending auctions with unit-demand bidders (Q2449341) (← links)
- New optimal algorithm of data association for multi-passive-sensor location system (Q2461479) (← links)
- Collaborative assignment using belief-desire-intention agent modeling and negotiation with speedup strategies (Q2476755) (← links)
- Vector copulas (Q2697978) (← links)
- Efficient Advert Assignment (Q2830760) (← links)
