Pages that link to "Item:Q1202585"

The following pages link to Auction algorithms for network flow problems: A tutorial introduction (Q1202585):

Displaying 36 items.

• Optimum matchings in weighted bipartite graphs (Q265439) (← links)
• Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem (Q300032) (← links)
• Distributed coordination of emergency medical service for angioplasty patients (Q314475) (← links)
• Numerical solution of the optimal transportation problem using the Monge-Ampère equation (Q348765) (← links)
• Distributed optimization of P2P live streaming overlays (Q455928) (← links)
• Group preference modeling for intelligent shared environments: social welfare beyond the sum (Q506766) (← links)
• Simultaneous independent online auctions with discrete bid increments (Q816718) (← links)
• A pricing approach for bandwidth allocation in differentiated service networks (Q925818) (← links)
• The Monge-Ampère-Kantorovich approach to reconstruction in cosmology (Q942800) (← links)
• A generic auction algorithm for the minimum cost network flow problem (Q1315446) (← links)
• Data parallel computing for network-structured optimization problems (Q1328430) (← links)
• Uncertain programming model for uncertain optimal assignment problem (Q1788760) (← links)
• An auction algorithm for the max-flow problem (Q1906750) (← links)
• Stochastic downscaling method: application to wind refinement (Q2001956) (← links)
• The assignment problem revisited (Q2136890) (← links)
• Center-outward quantiles and the measurement of multivariate risk (Q2212163) (← links)
• Decentralized algorithms for distributed integer programming problems with a coupling cardinality constraint (Q2218645) (← links)
• Distributed greedy algorithm for multi-agent task assignment problem with submodular utility functions (Q2280688) (← links)
• Empirical optimal transport on countable metric spaces: distributional limits and statistical applications (Q2286450) (← links)
• Descending price multi-item auctions (Q2495374) (← links)
• Application of optimal transportation theory to the reconstruction of the early Universe (Q2567711) (← links)
• Combinatorial auctions for electronic business (Q2571439) (← links)
• Optimal transport by omni-potential flow and cosmological reconstruction (Q2861751) (← links)
• Parallel Auction Algorithm for Bus Rescheduling (Q3525429) (← links)
• A comprehensive simplex-like algorithm for network optimization and perturbation analysis (Q4764598) (← links)
• (Q5214190) (← links)
• Coordinated road-network search route planning by a team of UAVs (Q5410832) (← links)
• The vehicle rescheduling problem: Model and algorithms (Q5434589) (← links)
• Auction protocols for decentralized scheduling (Q5938627) (← links)
• Semi-discrete optimal transport: hardness, regularization and numerical solution (Q6038666) (← links)
• A fast solver for generalized optimal transport problems based on dynamical system and algebraic multigrid (Q6053002) (← links)
• Multi-agent based optimal equilibrium selection with resilience constraints for traffic flow (Q6077653) (← links)
• Entropic model predictive optimal transport over dynamical systems (Q6103050) (← links)
• Discrete Optimal Transport with Independent Marginals is #P-Hard (Q6155882) (← links)
• A study of auction mechanisms for multilateral procurement based on subgradient and bundle methods (Q6160378) (← links)
• Automatic coarsening in algebraic multigrid utilizing quality measures for matching-based aggregations (Q6176673) (← links)