Minimum-cost flow algorithms: an experimental evaluation
From MaRDI portal
Publication:2943810
DOI10.1080/10556788.2014.895828zbMath1320.90095OpenAlexW2053044043MaRDI QIDQ2943810
Publication date: 4 September 2015
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2014.895828
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)
Related Items (23)
Smoothed Analysis of the Successive Shortest Path Algorithm ⋮ A polynomial local optimality condition for the concave piecewise linear network flow problem ⋮ Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm ⋮ Finding extreme supported solutions of biobjective network flow problems: an enhanced parametric programming approach ⋮ A strongly polynomial contraction-expansion algorithm for network flow problems ⋮ Approximate Wasserstein attraction flows for dynamic mass transport over networks ⋮ Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm ⋮ A novel approach to subgraph selection with multiple weights on arcs ⋮ Minimum cost flow problem with conflicts ⋮ Inventory allocation with full downward substitution and monotone cost differences ⋮ The boundary method for semi-discrete optimal transport partitions and Wasserstein distance computation ⋮ Algorithmic Aspects of Disjunctive Total Domination in Graphs ⋮ A survey on exact algorithms for the maximum flow and minimum‐cost flow problems ⋮ 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 ⋮ Vector Space Decomposition for Solving Large-Scale Linear Programs ⋮ On Solving the Quadratic Shortest Path Problem ⋮ LEMON ⋮ On the Computation of Kantorovich--Wasserstein Distances Between Two-Dimensional Histograms by Uncapacitated Minimum Cost Flows
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polynomial dual network simplex algorithms
- A strongly polynomial minimum cost circulation algorithm
- Dual coordinate step methods for linear network flow problems
- Implementation and analysis of a variant of the dual method for the capacitated transshipment problem
- Finding minimum-cost flows by double scaling
- On the computational behavior of a polynomial-time network flow algorithm
- Polynomial-time primal simplex algorithms for the minimum cost network flow problem
- On implementing the push-relabel method for the maximum flow problem
- On dual minimum cost flow algorithms
- A data structure for dynamic trees
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- A Computational Study of Cost Reoptimization for Min-Cost Flow Problems
- Finding minimum cost to time ratio cycles with small integral transit times
- On dual minimum cost flow algorithms (extended abstract)
- Monotone networks
- Finding Minimum-Cost Circulations by Successive Approximation
- Finding minimum-cost circulations by canceling negative cycles
- The Partial Augment–Relabel Algorithm for the Maximum Flow Problem
- An efficient implementation of the network simplex method
- A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm
- An O (n 2 (m + N log n )log n ) min-cost flow algorithm
- A new approach to the maximum-flow problem
- Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems
- Note on Weintraub’s Minimum-Cost Circulation Algorithm
- An Out-of-Kilter Method for Minimal-Cost Flow Problems
- Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem
- A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- A Primal Algorithm to Solve Network Flow Problems with Convex Costs
- A network simplex method
- Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
- Pivot Strategies for Primal-Simplex Network Codes
- The alternating basis algorithm for assignment problems
- An annotated bibliography of network interior point methods
- New polynomial-time cycle-canceling algorithms for minimum-cost flows
- Faster Scaling Algorithms for Network Problems
- Fortran subroutines for network flow optimization using an interior point algorithm
- Efficient implementation of the Goldberg–Tarjan minimum-cost flow algorithm
- A Faster Strongly Polynomial Minimum Cost Flow Algorithm
- Minimum cost network flows: Problems, algorithms, and software
- A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
- On some techniques useful for solution of transportation network problems
- Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm
- Combinatorial optimization. Theory and algorithms.
This page was built for publication: Minimum-cost flow algorithms: an experimental evaluation
