Pages that link to "Item:Q1115790"
From MaRDI portal
The following pages link to Dual coordinate step methods for linear network flow problems (Q1115790):
Displaying 31 items.
- Discrete optimal transport: complexity, geometry and applications (Q262303) (← links)
- Far-field reflector problem and intersection of paraboloids (Q315717) (← links)
- Asynchronous implementation of relaxation and gradient algorithms for convex network flow problems (Q688191) (← links)
- Some aspects of parallel and distributed iterative algorithms - a survey (Q805158) (← links)
- The maximum flow problem: A max-preflow approach (Q811325) (← links)
- A decision support system for the single-depot vehicle rescheduling problem (Q856678) (← links)
- A survey of dynamic network flows (Q917417) (← links)
- The auction algorithm for the transportation problem (Q918416) (← links)
- On the computational behavior of a polynomial-time network flow algorithm (Q1190598) (← links)
- New scaling algorithms for the assignment and minimum mean cycle problems (Q1190599) (← links)
- On the convergence of the affine-scaling algorithm (Q1196183) (← links)
- Auction algorithms for network flow problems: A tutorial introduction (Q1202585) (← links)
- A generic auction algorithm for the minimum cost network flow problem (Q1315446) (← links)
- Data parallel computing for network-structured optimization problems (Q1328430) (← links)
- The invisible hand algorithm: solving the assignment problem with statistical physics (Q1338267) (← links)
- Flow approach to temporal-structural coordination of digital computing units and systems (Q1593989) (← links)
- Critical objective function values in linear sum assignment problems (Q1743488) (← links)
- A forward/reverse auction algorithm for asymmetric assignment problems (Q1803649) (← links)
- A comparison of two algorithms for the assignment problem (Q1804373) (← links)
- Implementation and test of auction methods for solving generalized network flow problems with separable convex cost (Q1810926) (← links)
- Algorithms and codes for dense assignment problems: The state of the art (Q1962018) (← links)
- The assignment problem revisited (Q2136890) (← links)
- Optimal transport: discretization and algorithms (Q2235779) (← links)
- Spoke contour conversion for coverage diagrams (Q2367428) (← links)
- Minimum-cost flow algorithms: an experimental evaluation (Q2943810) (← links)
- Accelerated Dual Descent for Network Flow Optimization (Q2983197) (← links)
- 3/4-Discrete Optimal Transport (Q3303986) (← links)
- Parallel Auction Algorithm for Bus Rescheduling (Q3525429) (← links)
- Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems (Q3813579) (← links)
- A simple effective heuristic for embedded mixed-integer quadratic programming (Q5207801) (← links)
- Stabilized Sparse Scaling Algorithms for Entropy Regularized Transport Problems (Q5230605) (← links)