Finding Minimum-Cost Circulations by Successive Approximation
From MaRDI portal
Recommendations
Cited in
(91)- Finding minimum-cost circulations by canceling negative cycles
- Multicommodity network flows: A survey. II: Solution methods
- A conservative constrained clustering-merging algorithm for particle-in-cell codes
- Min-Cost Flow in Unit-Capacity Planar Graphs
- Las Vegas RNC algorithms for unary weighted perfect matching and \(T\)-join problems
- More efficient parallel flow algorithms
- Conflict-tolerant and conflict-free multi-agent meeting
- A survey on exact algorithms for the maximum flow and minimum‐cost flow problems
- A new fixed point approach for stable networks and stable marriages
- Truthful mechanism design for multidimensional scheduling via cycle monotonicity
- SIRALINA: Efficient two-steps heuristic for storage optimisation in single period task scheduling
- Fair matchings and related problems
- Algorithms for the minimum cost circulation problem based on maximizing the mean improvement
- Minimum-cost flow algorithms: an experimental evaluation
- Network restructuring for dynamic flow improvement
- A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows
- A combinatorial approximation algorithm for concurrent flow problem and its application
- A faster polynomial algorithm for the unbalanced Hitchcock transportation problem
- On variants of a load-balancing problem with unit-load jobs
- A parallel algorithm for finding a blocking flow in an acyclic network
- Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization
- A decentralized flow redistribution algorithm for avoiding cascaded failures in complex networks
- Online hole healing for sensor coverage
- A sparse algorithm for dense optimal transport
- Database repairing with soft functional dependencies
- Algorithms for network piecewise-linear programs: A comparative study
- Improving time bounds on maximum generalised flow computations by contracting the network
- Auction algorithms for network flow problems: A tutorial introduction
- A faster polynomial algorithm for the constrained maximum flow problem
- Mathematical Considerations on the Relationship between the Ordering of players and Winning Probability in Certain Types of Team Sports
- Software project scheduling under activity duration uncertainty
- A polynomial time primal network simplex algorithm for minimum cost flows
- A fast cost scaling algorithm for submodular flow
- The balanced \(p\)-median problem with unitary demand
- A double scaling algorithm for the constrained maximum flow problem
- How to compute least infeasible flows
- An \(O(m(m+n\log {n})\log(nC))\)-time algorithm to solve the minimum cost tension problem
- Separation, dimension, and facet algorithms for node flow polyhedra
- Maximum skew-symmetric flows
- A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks
- A decomposition approach for a resource constrained scheduling problem
- An efficient cost scaling algorithm for the assignment problem
- Two strongly polynomial cut cancelling algorithms for minimum cost network flow
- A Push/Relabel framework for submodular flows and its definement for 0-1 submodular flows
- Network flow and 2-satisfiability
- Computing Minimum Length Representations of Sets of Words of Uniform Length
- Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
- Characterization of random walks on space of unordered trees using efficient metric simulation
- Efficient contraflow algorithms for quickest evacuation planning
- An O (n 2 (m + N log n )log n ) min-cost flow algorithm
- Finding minimum-cost flows by double scaling
- On the computational behavior of a polynomial-time network flow algorithm
- Isolating cuts, (bi-)submodularity, and faster algorithms for connectivity
- A critical survey on the network optimization algorithms for evacuation planning problems
- On the complexity of preflow-push algorithms for maximum-flow problems
- A sparse multiscale algorithm for dense optimal transport
- Data parallel computing for network-structured optimization problems
- Inflow-dependent quickest multi-commodity flow problem with partial lane reversals
- Approximation Algorithms for k-Hurdle Problems
- Approximation algorithms for \(k\)-hurdle problems
- A Simple Efficient Interior Point Method for Min-Cost Flow
- Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm
- A generic auction algorithm for the minimum cost network flow problem
- Simplified linear-time Jordan sorting and polygon clipping
- A decomposition approach in a DSS for a resource constrained scheduling problem
- Minimum-cost flows in unit-capacity networks
- Implementation and test of auction methods for solving generalized network flow problems with separable convex cost
- Finding optimal non-datapath caching strategies via network flow
- Smoothed analysis of the successive shortest path algorithm
- Polynomial-time primal simplex algorithms for the minimum cost network flow problem
- Note on Weintraub’s Minimum-Cost Circulation Algorithm
- An out-of-kilter method for the algebraic circulation problem
- Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time
- A new scaling algorithm for the minimum cost network flow problem
- The assignment problem revisited
- A faster strongly polynomial time algorithm to solve the minimum cost tension problem
- Multicommodity flows in tree-like networks
- Using combinatorial optimization in model-based trimmed clustering with cardinality constraints
- Efficient algorithms for abstract flow with partial switching
- Computing minimum length representations of sets of words of uniform length
- Database repairing with soft functional dependencies
- A sequential reduction algorithm for the large-scale fixed-charge network flow problems
- Algorithms and codes for dense assignment problems: The state of the art
- Minimum cost noncrossing flow problem on layered networks
- The problem of synthesis of reliable networks
- Recent developments in maximum flow algorithms
- Efficient parallel algorithms for the minimum cost flow problem
- Tight bounds on the number of minimum-mean cycle cancellations and related results
- Stabilized Sparse Scaling Algorithms for Entropy Regularized Transport Problems
- An \(O(n(m+n\log n)\log n)\) time algorithm to solve the minimum cost tension problem
- On the transformation mechanism for formulating a multiproduct two-layer supply chain network design problem as a network flow model
This page was built for publication: Finding Minimum-Cost Circulations by Successive Approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3351112)
