Pages that link to "Item:Q3351112"

The following pages link to Finding Minimum-Cost Circulations by Successive Approximation (Q3351112):

Displaying 50 items.

• Fair matchings and related problems (Q270032) (← links)
• A fast cost scaling algorithm for submodular flow (Q294751) (← links)
• A sparse multiscale algorithm for dense optimal transport (Q334276) (← links)
• SIRALINA: Efficient two-steps heuristic for storage optimisation in single period task scheduling (Q411217) (← links)
• An \(O(m(m+n\log {n})\log(nC))\)-time algorithm to solve the minimum cost tension problem (Q442108) (← links)
• Approximation algorithms for \(k\)-hurdle problems (Q627530) (← links)
• Two strongly polynomial cut cancelling algorithms for minimum cost network flow (Q689972) (← links)
• A combinatorial approximation algorithm for concurrent flow problem and its application (Q707017) (← links)
• Multicommodity flows in tree-like networks (Q733946) (← links)
• Truthful mechanism design for multidimensional scheduling via cycle monotonicity (Q834857) (← links)
• Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization (Q847846) (← links)
• Simplified linear-time Jordan sorting and polygon clipping (Q911762) (← links)
• A double scaling algorithm for the constrained maximum flow problem (Q941539) (← links)
• Using combinatorial optimization in model-based trimmed clustering with cardinality constraints (Q962299) (← links)
• A faster polynomial algorithm for the unbalanced Hitchcock transportation problem (Q1003485) (← links)
• Las Vegas RNC algorithms for unary weighted perfect matching and \(T\)-join problems (Q1183464) (← links)
• Finding minimum-cost flows by double scaling (Q1184348) (← links)
• On the computational behavior of a polynomial-time network flow algorithm (Q1190598) (← links)
• Polynomial-time primal simplex algorithms for the minimum cost network flow problem (Q1193519) (← links)
• A new fixed point approach for stable networks and stable marriages (Q1201153) (← links)
• Auction algorithms for network flow problems: A tutorial introduction (Q1202585) (← links)
• A parallel algorithm for finding a blocking flow in an acyclic network (Q1263969) (← links)
• Algorithms for network piecewise-linear programs: A comparative study (Q1278601) (← links)
• A generic auction algorithm for the minimum cost network flow problem (Q1315446) (← links)
• Tight bounds on the number of minimum-mean cycle cancellations and related results (Q1317475) (← links)
• Network flow and 2-satisfiability (Q1317481) (← links)
• On the complexity of preflow-push algorithms for maximum-flow problems (Q1322568) (← links)
• Data parallel computing for network-structured optimization problems (Q1328430) (← links)
• A decomposition approach for a resource constrained scheduling problem (Q1333515) (← links)
• A decomposition approach in a DSS for a resource constrained scheduling problem (Q1342055) (← links)
• Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time (Q1363422) (← links)
• A polynomial time primal network simplex algorithm for minimum cost flows (Q1373741) (← links)
• Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm (Q1373746) (← links)
• How to compute least infeasible flows (Q1373747) (← links)
• Efficient parallel algorithms for the minimum cost flow problem (Q1379929) (← links)
• Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations (Q1598763) (← links)
• Efficient contraflow algorithms for quickest evacuation planning (Q1623855) (← links)
• A decentralized flow redistribution algorithm for avoiding cascaded failures in complex networks (Q1673339) (← links)
• Minimum-cost flows in unit-capacity networks (Q1693987) (← links)
• On the transformation mechanism for formulating a multiproduct two-layer supply chain network design problem as a network flow model (Q1718489) (← links)
• A faster polynomial algorithm for the constrained maximum flow problem (Q1761207) (← links)
• Implementation and test of auction methods for solving generalized network flow problems with separable convex cost (Q1810926) (← links)
• Improving time bounds on maximum generalised flow computations by contracting the network (Q1884873) (← links)
• An efficient cost scaling algorithm for the assignment problem (Q1914072) (← links)
• Algorithms and codes for dense assignment problems: The state of the art (Q1962018) (← links)
• A new scaling algorithm for the minimum cost network flow problem (Q1970413) (← links)
• Online hole healing for sensor coverage (Q2010111) (← links)
• A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks (Q2029899) (← links)
• Efficient algorithms for abstract flow with partial switching (Q2079298) (← links)
• The assignment problem revisited (Q2136890) (← links)