Minimum-cost flow algorithms: an experimental evaluation
From MaRDI portal
Recommendations
Cites work
- A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm
- A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems
- A computational study of cost reoptimization for min-cost flow problems
- A data structure for dynamic trees
- A Faster Strongly Polynomial Minimum Cost Flow Algorithm
- A network simplex method
- A new approach to the maximum-flow problem
- A Primal Algorithm to Solve Network Flow Problems with Convex Costs
- A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
- A strongly polynomial minimum cost circulation algorithm
- An O (n 2 (m + N log n )log n ) min-cost flow algorithm
- An annotated bibliography of network interior point methods
- An efficient implementation of the network simplex method
- An Out-of-Kilter Method for Minimal-Cost Flow Problems
- Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Combinatorial optimization. Theory and algorithms.
- Connections in combinatorial optimization
- Dual coordinate step methods for linear network flow problems
- Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem
- Efficient implementation of the Goldberg–Tarjan minimum-cost flow algorithm
- Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
- Faster Scaling Algorithms for Network Problems
- Finding minimum cost to time ratio cycles with small integral transit times
- Finding minimum-cost circulations by canceling negative cycles
- Finding Minimum-Cost Circulations by Successive Approximation
- Finding minimum-cost flows by double scaling
- Fortran subroutines for network flow optimization using an interior point algorithm
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3791941 (Why is no real title available?)
- Implementation and analysis of a variant of the dual method for the capacitated transshipment problem
- Minimum cost network flows: Problems, algorithms, and software
- Monotone networks
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Network flows. Theory, algorithms, and applications.
- New polynomial-time cycle-canceling algorithms for minimum-cost flows
- Note on Weintraub’s Minimum-Cost Circulation Algorithm
- On dual minimum cost flow algorithms
- On dual minimum cost flow algorithms (extended abstract)
- On implementing the push-relabel method for the maximum flow problem
- On some techniques useful for solution of transportation network problems
- On the computational behavior of a polynomial-time network flow algorithm
- Pivot Strategies for Primal-Simplex Network Codes
- Polynomial dual network simplex algorithms
- Polynomial-time primal simplex algorithms for the minimum cost network flow problem
- Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems
- The alternating basis algorithm for assignment problems
- The Partial Augment–Relabel Algorithm for the Maximum Flow Problem
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Cited in
(36)- Finding extreme supported solutions of biobjective network flow problems: an enhanced parametric programming approach
- A strongly polynomial contraction-expansion algorithm for network flow problems
- LEMON
- The multi-terminal vertex separator problem: polyhedral analysis and branch-and-cut
- Allocation under a general substitution structure
- A network simplex method for the budget-constrained minimum cost flow problem
- The quadratic shortest path problem: complexity, approximability, and solution methods
- Exact solution algorithms for the maximum flow problem with additional conflict constraints
- A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks
- A polynomial local optimality condition for the concave piecewise linear network flow problem
- Approximate Wasserstein attraction flows for dynamic mass transport over networks
- A novel approach to subgraph selection with multiple weights on arcs
- The boundary method for semi-discrete optimal transport partitions and Wasserstein distance computation
- Prim-based support-graph preconditioners for min-cost flow problems
- A computational study of cost reoptimization for min-cost flow problems
- Algorithmic aspects of disjunctive total domination in graphs
- Smoothed analysis of the minimum-mean cycle canceling algorithm and the network simplex algorithm
- On solving the quadratic shortest path problem
- Smoothed analysis of the successive shortest path algorithm
- scientific article; zbMATH DE number 1263274 (Why is no real title available?)
- scientific article; zbMATH DE number 515927 (Why is no real title available?)
- scientific article; zbMATH DE number 515929 (Why is no real title available?)
- Efficient implementation of the Goldberg–Tarjan minimum-cost flow algorithm
- Vector Space Decomposition for Solving Large-Scale Linear Programs
- Smoothed analysis of the minimum-mean cycle canceling algorithm and the network simplex algorithm
- On the computation of Kantorovich-Wasserstein distances between two-dimensional histograms by uncapacitated minimum cost flows
- scientific article; zbMATH DE number 5663509 (Why is no real title available?)
- Minimum cost flow problem with conflicts
- Inventory allocation with full downward substitution and monotone cost differences
- A survey on exact algorithms for the maximum flow and minimum‐cost flow problems
- Nonsmooth projection-free optimization with functional constraints
- Interior point methods in the year 2025
- Transport dependency: optimal transport based dependency measures
- Maximum flow and minimum-cost flow in almost-linear time
- A regularized interior point method for sparse optimal transport on graphs
- On variants of a load-balancing problem with unit-load jobs
This page was built for publication: Minimum-cost flow algorithms: an experimental evaluation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2943810)
