Finding minimum-cost flows by double scaling
From MaRDI portal
transportationcapacity-scalingcost- scalingdynamic tree data structureexcess-scalingminimum-cost circulationsminimum-cost flow problem
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Recommendations
Cites work
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 3936534 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 3349645 (Why is no real title available?)
- A Fast and Simple Algorithm for the Maximum Flow Problem
- A bad network problem for the simplex method and other minimum cost flow algorithms
- A data structure for dynamic trees
- A new approach to the maximum-flow problem
- A strongly polynomial minimum cost circulation algorithm
- An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
- Faster Scaling Algorithms for Network Problems
- Finding Minimum-Cost Circulations by Successive Approximation
- Finding minimum-cost circulations by canceling negative cycles
- Improved Time Bounds for the Maximum Flow Problem
- On a class of capacitated transportation problems
- On the simplex algorithm for networks and generalized networks
- Scaling algorithms for network problems
- Self-adjusting binary search trees
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Cited in
(52)- scientific article; zbMATH DE number 515930 (Why is no real title available?)
- Minimum flow algorithms. Dynamic tree implementations
- scientific article; zbMATH DE number 1869742 (Why is no real title available?)
- Executability of scenarios in Petri nets
- Dominated parasitic flow loops in networks
- On the computational behavior of a polynomial-time network flow algorithm
- How to compute least infeasible flows
- scientific article; zbMATH DE number 903085 (Why is no real title available?)
- Minimum-cost flow algorithms: an experimental evaluation
- A new approach for solving the minimum cost flow problem with interval and fuzzy data
- The cost scaling algorithm for bipartite networks
- A new scaling algorithm for the minimum cost network flow problem
- On dual minimum cost flow algorithms
- A Simple Efficient Interior Point Method for Min-Cost Flow
- \textsc{Hide} \& \textsc{Seek}: privacy-preserving rebalancing on payment channel networks
- Algorithms for dense graphs and networks on the random access computer
- Tight bounds on the number of minimum-mean cycle cancellations and related results
- Minimal-cost network flow problems with variable lower bounds on arc flows
- An exterior simplex type algorithm for the minimum cost network flow problem
- A scaling out-of-kilter algorithm for minimum cost flow in networks with positive lower bounds
- DEA‐based centralized resource allocation with network flows
- A scaling out-of-kilter algorithm for minimum cost flow
- Fast algorithms for specially structured minimum cost flow problems with applications
- Scaling Methods for Finding a Maximum Free Multiflow of Minimum Cost
- A polynomial time primal network simplex algorithm for minimum cost flows
- A novel dual ascent algorithm for solving the min-cost flow problem
- A fast parallel algorithm for minimum-cost small integral flows
- A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows
- Efficient algorithms for minimum-cost flow problems with piecewise-linear convex costs
- Separation, dimension, and facet algorithms for node flow polyhedra
- Parallel algorithms for the assignment and minimum-cost flow problems
- An \(O(m(m+n\log {n})\log(nC))\)-time algorithm to solve the minimum cost tension problem
- Minimum cost flows in graphs with unit capacities
- Parameterized complexity of Eulerian deletion problems
- On the transformation mechanism for formulating a multiproduct two-layer supply chain network design problem as a network flow model
- Finding the Minimum-Cost Maximum Flow in a Series-Parallel Network
- Finding optimal non-datapath caching strategies via network flow
- Minimum-cost flows in unit-capacity networks
- A polynomial algorithm for minimum quadratic cost flow problems
- Flow constrained minimum cost flow problem
- Finding paths with minimum shared edges
- A survey on exact algorithms for the maximum flow and minimum‐cost flow problems
- Parameterized complexity of Eulerian deletion problems
- Chips on wafers, or packing rectangles into grids
- scientific article; zbMATH DE number 515928 (Why is no real title available?)
- scientific article; zbMATH DE number 4064732 (Why is no real title available?)
- Algorithms for the simple equal flow problem
- A double scaling algorithm for the constrained maximum flow problem
- A fast cost scaling algorithm for submodular flow
- A technique for speeding up the solution of the Lagrangean dual
- Faster Scaling Algorithms for Network Problems
- Leveling the grid
This page was built for publication: Finding minimum-cost flows by double scaling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1184348)
